Faster access than browser!
75 relations: Ackermann function, Ad infinitum, Ancestor, Andrew Plotkin, Axiomatic system, Barycentric subdivision, Bellman equation, Brian Kernighan, Cantor set, Circular definition, Computer programming, Computer science, Corecursion, Course-of-values recursion, Daniel Everett, Dennis Ritchie, Digital infinity, Divide and conquer algorithm, Douglas Hofstadter, Dynamic programming, Factorial, Fibonacci number, Fixed-point combinator, Fractal, Function (mathematics), Gödel's incompleteness theorems, Giotto, Glossary, GNU, Google, Hot chocolate, Index (publishing), Infinite compositions of analytic functions, Infinite loop, Infinite regress, Infinitism, Iterated function, Linguistics, Logic, M. C. Escher, Mathematical induction, Mathematical logic, Mathematical optimization, Mathematics, Matryoshka doll, Maze, Mise en abyme, Natural number, Noam Chomsky, Parent, ..., Parsing, Peano axioms, PHP, Pirahã language, Print Gallery (M. C. Escher), Production (computer science), Proof by exhaustion, Recurrence relation, Recursion, Recursive acronym, Recursive grammar, Reentrancy (computing), Self-reference, Semantics, Set (mathematics), Set theory, Sourdough, Stefaneschi Triptych, Strange loop, Structural induction, Tail call, The C Programming Language, Tupper's self-referential formula, Turtles all the way down, Wine (software). Expand index (25 more) »
Ackermann function
In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable function that is not primitive recursive.
New!!: Recursion and Ackermann function · See more »
Ad infinitum
Ad infinitum is a Latin phrase meaning "to infinity" or "forevermore".
New!!: Recursion and Ad infinitum · See more »
Ancestor
An ancestor is a parent or (recursively) the parent of an antecedent (i.e., a grandparent, great-grandparent, great-great-grandparent, and so forth).
New!!: Recursion and Ancestor · See more »
Andrew Plotkin
Andrew Plotkin (born May 15, 1970), also known as Zarf, is a central figure in the modern interactive fiction (IF) community.
New!!: Recursion and Andrew Plotkin · See more »
Axiomatic system
In mathematics, an axiomatic system is any set of axioms from which some or all axioms can be used in conjunction to logically derive theorems.
New!!: Recursion and Axiomatic system · See more »
Barycentric subdivision
In geometry, the barycentric subdivision is a standard way of dividing an arbitrary convex polygon into triangles, a convex polyhedron into tetrahedra, or, in general, a convex polytope into simplices with the same dimension, by connecting the barycenters of their faces in a specific way.
New!!: Recursion and Barycentric subdivision · See more »
Bellman equation
A Bellman equation, named after Richard E. Bellman, is a necessary condition for optimality associated with the mathematical optimization method known as dynamic programming.
New!!: Recursion and Bellman equation · See more »
Brian Kernighan
Brian Wilson Kernighan (born January 1, 1942) is a Canadian computer scientist who worked at Bell Labs alongside Unix creators Ken Thompson and Dennis Ritchie and contributed to the development of Unix.
New!!: Recursion and Brian Kernighan · See more »
Cantor set
In mathematics, the Cantor set is a set of points lying on a single line segment that has a number of remarkable and deep properties.
New!!: Recursion and Cantor set · See more »
Circular definition
A circular definition is one that uses the term(s) being defined as a part of the definition or assumes a prior understanding of the term being defined.
New!!: Recursion and Circular definition · See more »
Computer programming
Computer programming is the process of building and designing an executable computer program for accomplishing a specific computing task.
New!!: Recursion and Computer programming · See more »
Computer science
Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.
New!!: Recursion and Computer science · See more »
Corecursion
In computer science, corecursion is a type of operation that is dual to recursion.
New!!: Recursion and Corecursion · See more »
Course-of-values recursion
In computability theory, course-of-values recursion is a technique for defining number-theoretic functions by recursion.
New!!: Recursion and Course-of-values recursion · See more »
Daniel Everett
Daniel Leonard Everett (born 1951) is an American linguistic anthropologist and author best known for his study of the Amazon Basin's Pirahã people and their language.
New!!: Recursion and Daniel Everett · See more »
Dennis Ritchie
Dennis MacAlistair Ritchie (September 9, 1941 – October 12, 2011) was an American computer scientist.
New!!: Recursion and Dennis Ritchie · See more »
Digital infinity
Digital infinity is a technical term in theoretical linguistics.
New!!: Recursion and Digital infinity · See more »
Divide and conquer algorithm
In computer science, divide and conquer is an algorithm design paradigm based on multi-branched recursion.
New!!: Recursion and Divide and conquer algorithm · See more »
Douglas Hofstadter
Douglas Richard Hofstadter (born February 15, 1945) is an American professor of cognitive science whose research focuses on the sense of self in relation to the external world, consciousness, analogy-making, artistic creation, literary translation, and discovery in mathematics and physics.
New!!: Recursion and Douglas Hofstadter · See more »
Dynamic programming
Dynamic programming is both a mathematical optimization method and a computer programming method.
New!!: Recursion and Dynamic programming · See more »
Factorial
In mathematics, the factorial of a non-negative integer n, denoted by n!, is the product of all positive integers less than or equal to n. For example, The value of 0! is 1, according to the convention for an empty product.
New!!: Recursion and Factorial · See more »
Fibonacci number
In mathematics, the Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and characterized by the fact that every number after the first two is the sum of the two preceding ones: Often, especially in modern usage, the sequence is extended by one more initial term: By definition, the first two numbers in the Fibonacci sequence are either 1 and 1, or 0 and 1, depending on the chosen starting point of the sequence, and each subsequent number is the sum of the previous two.
New!!: Recursion and Fibonacci number · See more »
Fixed-point combinator
In computer science's combinatory logic, a fixed-point combinator (or fixpoint combinator) is a higher-order function fix that, for any function f that has an attractive fixed point, returns a fixed point x of that function.
New!!: Recursion and Fixed-point combinator · See more »
Fractal
In mathematics, a fractal is an abstract object used to describe and simulate naturally occurring objects.
New!!: Recursion and Fractal · See more »
Function (mathematics)
In mathematics, a function was originally the idealization of how a varying quantity depends on another quantity.
New!!: Recursion and Function (mathematics) · See more »
Gödel's incompleteness theorems
Gödel's incompleteness theorems are two theorems of mathematical logic that demonstrate the inherent limitations of every formal axiomatic system containing basic arithmetic.
New!!: Recursion and Gödel's incompleteness theorems · See more »
Giotto
Giotto di Bondone (1267 – January 8, 1337), known mononymously as Giotto and Latinised as Giottus, was an Italian painter and architect from Florence during the Late Middle Ages.
New!!: Recursion and Giotto · See more »
Glossary
A glossary, also known as a vocabulary or clavis, is an alphabetical list of terms in a particular domain of knowledge with the definitions for those terms.
New!!: Recursion and Glossary · See more »
GNU
GNU is an operating system and an extensive collection of computer software.
New!!: Recursion and GNU · See more »
Google LLC is an American multinational technology company that specializes in Internet-related services and products, which include online advertising technologies, search engine, cloud computing, software, and hardware.
New!!: Recursion and Google · See more »
Hot chocolate
Hot chocolate, also known as Chocolate tea, drinking chocolate or just cocoa is a heated beverage consisting of shaved chocolate, melted chocolate or cocoa powder, heated milk or water, and usually a sweetener.
New!!: Recursion and Hot chocolate · See more »
Index (publishing)
An index (plural: usually indexes, more rarely indices; see below) is a list of words or phrases ('headings') and associated pointers ('locators') to where useful material relating to that heading can be found in a document or collection of documents.
New!!: Recursion and Index (publishing) · See more »
Infinite compositions of analytic functions
In mathematics, infinite compositions of analytic functions (ICAF) offer alternative formulations of analytic continued fractions, series, products and other infinite expansions, and the theory evolving from such compositions may shed light on the convergence/divergence of these expansions.
New!!: Recursion and Infinite compositions of analytic functions · See more »
Infinite loop
An infinite loop (or endless loop) is a sequence of instructions in a computer program which loops endlessly, either due to the loop having no terminating condition, having one that can never be met, or one that causes the loop to start over.
New!!: Recursion and Infinite loop · See more »
Infinite regress
An infinite regress in a series of propositions arises if the truth of proposition P1 requires the support of proposition P2, the truth of proposition P2 requires the support of proposition P3,...
New!!: Recursion and Infinite regress · See more »
Infinitism
Infinitism is the view that knowledge may be justified by an infinite chain of reasons.
New!!: Recursion and Infinitism · See more »
Iterated function
In mathematics, an iterated function is a function (that is, a function from some set to itself) which is obtained by composing another function with itself a certain number of times.
New!!: Recursion and Iterated function · See more »
Linguistics
Linguistics is the scientific study of language, and involves an analysis of language form, language meaning, and language in context.
New!!: Recursion and Linguistics · See more »
Logic
Logic (from the logikḗ), originally meaning "the word" or "what is spoken", but coming to mean "thought" or "reason", is a subject concerned with the most general laws of truth, and is now generally held to consist of the systematic study of the form of valid inference.
New!!: Recursion and Logic · See more »
M. C. Escher
Maurits Cornelis Escher (17 June 1898 – 27 March 1972) was a Dutch graphic artist who made mathematically-inspired woodcuts, lithographs, and mezzotints.
New!!: Recursion and M. C. Escher · See more »
Mathematical induction
Mathematical induction is a mathematical proof technique.
New!!: Recursion and Mathematical induction · See more »
Mathematical logic
Mathematical logic is a subfield of mathematics exploring the applications of formal logic to mathematics.
New!!: Recursion and Mathematical logic · See more »
Mathematical optimization
In mathematics, computer science and operations research, mathematical optimization or mathematical programming, alternatively spelled optimisation, is the selection of a best element (with regard to some criterion) from some set of available alternatives.
New!!: Recursion and Mathematical optimization · See more »
Mathematics
Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.
New!!: Recursion and Mathematics · See more »
Matryoshka doll
A matryoshka doll (a), also known as a Russian nesting doll, stacking dolls, or Russian doll, is a set of wooden dolls of decreasing size placed one inside another.
New!!: Recursion and Matryoshka doll · See more »
Maze
A maze is a path or collection of paths, typically from an entrance to a goal.
New!!: Recursion and Maze · See more »
Mise en abyme
Mise en abyme (also mise en abîme) is a term used in Western art history to describe a formal technique of placing a copy of an image within itself, often in a way that suggests an infinitely recurring sequence.
New!!: Recursion and Mise en abyme · See more »
Natural number
In mathematics, the natural numbers are those used for counting (as in "there are six coins on the table") and ordering (as in "this is the third largest city in the country").
New!!: Recursion and Natural number · See more »
Noam Chomsky
Avram Noam Chomsky (born December 7, 1928) is an American linguist, philosopher, cognitive scientist, historian, social critic and political activist.
New!!: Recursion and Noam Chomsky · See more »
Parent
A parent is a caregiver of the offspring in their own species.
New!!: Recursion and Parent · See more »
Parsing
Parsing, syntax analysis or syntactic analysis is the process of analysing a string of symbols, either in natural language, computer languages or data structures, conforming to the rules of a formal grammar.
New!!: Recursion and Parsing · See more »
Peano axioms
In mathematical logic, the Peano axioms, also known as the Dedekind–Peano axioms or the Peano postulates, are axioms for the natural numbers presented by the 19th century Italian mathematician Giuseppe Peano.
New!!: Recursion and Peano axioms · See more »
PHP
PHP: Hypertext Preprocessor (or simply PHP) is a server-side scripting language designed for Web development, but also used as a general-purpose programming language.
New!!: Recursion and PHP · See more »
Pirahã language
Pirahã (also spelled Pirahá, Pirahán), or Múra-Pirahã, is the indigenous language of the isolated Pirahã of Amazonas, Brazil.
New!!: Recursion and Pirahã language · See more »
Print Gallery (M. C. Escher)
Print Gallery is a lithograph printed in 1956 by the Dutch artist M. C. Escher.
New!!: Recursion and Print Gallery (M. C. Escher) · See more »
Production (computer science)
A production or production rule in computer science is a rewrite rule specifying a symbol substitution that can be recursively performed to generate new symbol sequences.
New!!: Recursion and Production (computer science) · See more »
Proof by exhaustion
Proof by exhaustion, also known as proof by cases, proof by case analysis, complete induction, or the brute force method, is a method of mathematical proof in which the statement to be proved is split into a finite number of cases or sets of equivalent cases and each type of case is checked to see if the proposition in question holds.
New!!: Recursion and Proof by exhaustion · See more »
Recurrence relation
In mathematics, a recurrence relation is an equation that recursively defines a sequence or multidimensional array of values, once one or more initial terms are given: each further term of the sequence or array is defined as a function of the preceding terms.
New!!: Recursion and Recurrence relation · See more »
Recursion
Recursion occurs when a thing is defined in terms of itself or of its type.
New!!: Recursion and Recursion · See more »
Recursive acronym
A recursive acronym is an acronym that refers to itself.
New!!: Recursion and Recursive acronym · See more »
Recursive grammar
In computer science, a grammar is informally called a recursive grammar if it contains production rules that are recursive, meaning that expanding a non-terminal according to these rules can eventually lead to a string that includes the same non-terminal again.
New!!: Recursion and Recursive grammar · See more »
Reentrancy (computing)
In computing, a computer program or subroutine is called reentrant if it can be interrupted in the middle of its execution and then safely be called again ("re-entered") before its previous invocations complete execution.
New!!: Recursion and Reentrancy (computing) · See more »
Self-reference
Self-reference occurs in natural or formal languages when a sentence, idea or formula refers to itself.
New!!: Recursion and Self-reference · See more »
Semantics
Semantics (from σημαντικός sēmantikós, "significant") is the linguistic and philosophical study of meaning, in language, programming languages, formal logics, and semiotics.
New!!: Recursion and Semantics · See more »
Set (mathematics)
In mathematics, a set is a collection of distinct objects, considered as an object in its own right.
New!!: Recursion and Set (mathematics) · See more »
Set theory
Set theory is a branch of mathematical logic that studies sets, which informally are collections of objects.
New!!: Recursion and Set theory · See more »
Sourdough
Sourdough bread is made by the fermentation of dough using naturally occurring lactobacilli and yeast.
New!!: Recursion and Sourdough · See more »
Stefaneschi Triptych
The Stefaneschi Altarpiece is a triptych by the Italian medieval painter Giotto, commissioned by Cardinal Giacomo Gaetani Stefaneschi to serve as an altarpiece for one of the altars of Old St. Peter's Basilica in Rome.
New!!: Recursion and Stefaneschi Triptych · See more »
Strange loop
A strange loop is a cyclic structure that goes through several levels in a hierarchical system.
New!!: Recursion and Strange loop · See more »
Structural induction
Structural induction is a proof method that is used in mathematical logic (e.g., in the proof of Łoś' theorem), computer science, graph theory, and some other mathematical fields.
New!!: Recursion and Structural induction · See more »
Tail call
In computer science, a tail call is a subroutine call performed as the final action of a procedure.
New!!: Recursion and Tail call · See more »
The C Programming Language
The C Programming Language (sometimes termed K&R, after its authors' initials) is a computer programming book written by Brian Kernighan and Dennis Ritchie, the latter of whom originally designed and implemented the language, as well as co-designed the Unix operating system with which development of the language was closely intertwined.
New!!: Recursion and The C Programming Language · See more »
Tupper's self-referential formula
Tupper's self-referential formula is a formula that visually represents itself when graphed at a specific location in the (x, y) plane.
New!!: Recursion and Tupper's self-referential formula · See more »
Turtles all the way down
"Turtles all the way down" is an expression of the problem of infinite regress.
New!!: Recursion and Turtles all the way down · See more »
Wine (software)
Wine (recursive backronym for Wine Is Not an Emulator) is a free and open-source compatibility layer that aims to allow computer programs (application software and computer games) developed for Microsoft Windows to run on Unix-like operating systems.
New!!: Recursion and Wine (software) · See more »
Redirects here:
Base case (recursion), Infinite loop motif, Infinite-loop motif, Mathematical recursion, Recursion (Concept), Recursion (concept), Recursion definition, Recursion principle, Recursionism, Recursionisms, Recursions, Recursive, Recursive routine, Recursive structure, Recursively, Recursiveness, Recursivity, Recursor function.
References
[1] https://en.wikipedia.org/wiki/Recursion
