Definitions for co-recursive
co-re·cur·sive

WiktionaryRate this definition:0.0 / 0 votes

1. co-recursiveadjective

   Describing a definition, particularly of an algorithm, given in terms of its output, rather than its input.

   Co-recursive algorithms allow infinite large objects to be used without necessarily running out of memory.

WikipediaRate this definition:0.0 / 0 votes

1. co-recursive

   In computer science, corecursion is a type of operation that is dual to recursion. Whereas recursion works analytically, starting on data further from a base case and breaking it down into smaller data and repeating until one reaches a base case, corecursion works synthetically, starting from a base case and building it up, iteratively producing data further removed from a base case. Put simply, corecursive algorithms use the data that they themselves produce, bit by bit, as they become available, and needed, to produce further bits of data. A similar but distinct concept is generative recursion which may lack a definite "direction" inherent in corecursion and recursion. Where recursion allows programs to operate on arbitrarily complex data, so long as they can be reduced to simple data (base cases), corecursion allows programs to produce arbitrarily complex and potentially infinite data structures, such as streams, so long as it can be produced from simple data (base cases) in a sequence of finite steps. Where recursion may not terminate, never reaching a base state, corecursion starts from a base state, and thus produces subsequent steps deterministically, though it may proceed indefinitely (and thus not terminate under strict evaluation), or it may consume more than it produces and thus become non-productive. Many functions that are traditionally analyzed as recursive can alternatively, and arguably more naturally, be interpreted as corecursive functions that are terminated at a given stage, for example recurrence relations such as the factorial. Corecursion can produce both finite and infinite data structures as results, and may employ self-referential data structures. Corecursion is often used in conjunction with lazy evaluation, to produce only a finite subset of a potentially infinite structure (rather than trying to produce an entire infinite structure at once). Corecursion is a particularly important concept in functional programming, where corecursion and codata allow total languages to work with infinite data structures.

How to pronounce co-recursive?

1. Alex

   US English

   David

   US English

   Mark

   US English

   Daniel

   British

   Libby

   British

   Mia

   British

   Karen

   Australian

   Hayley

   Australian

   Natasha

   Australian

   Veena

   Indian

   Priya

   Indian

   Neerja

   Indian

   Zira

   US English

   Oliver

   British

   Wendy

   British

   Fred

   US English

   Tessa

   South African

How to say co-recursive in sign language?

Numerology

1. Chaldean Numerology

   The numerical value of co-recursive in Chaldean Numerology is: 7

2. Pythagorean Numerology

   The numerical value of co-recursive in Pythagorean Numerology is: 3

Examples of co-recursive in a Sentence

1. Edsger W. Dijkstra:

   The argument against recursive procedures was always an efficiency argument: non-re-entrant code could be executed so much more efficiently. But with the advent of multiprogramming another need for felxible storage allocation has emerged. And if there are still machines in which the use of recursive routines is punished by too heavy a penalty, then I would venture the opinion that the structure of such a machine should now be called somewhat old-fashioned.

References

1. ^ Wiktionary
   https://en.wiktionary.org/wiki/Co-Recursive
2. ^ Wikipedia
   https://en.wikipedia.org/wiki/Co-Recursive