science, a formal language (a set of finite sequences of symbols taken from a fixed alphabet) is called recursive if it is a recursive subset of the set...

In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable, semidecidable,...

In computability theory, a primitive recursive function is, roughly speaking, a function that can be computed by a computer program whose loops are all...

A recursive acronym is an acronym that refers to itself, and appears most frequently in computer programming. The term was first used in print in 1979...

explained as the consequence of recursion in natural language. This can be understood in terms of a recursive definition of a syntactic category, such as a sentence...

Formal Languages by A. Salomaa, page 14, Example 2.5). An example of recursive language that is not context-sensitive is any recursive language whose decision...

recursive elements of language such as spatial prepositions. Then this merged with their parents' non-recursive language to create recursive language...

primitive recursive function of the current step number, and the learner encodes a language guess as a program that enumerates the language i.e. the class...

computability theory, a set of natural numbers is called computable, recursive, or decidable if there is an algorithm which takes a number as input,...

computer science, a recursive descent parser is a kind of top-down parser built from a set of mutually recursive procedures (or a non-recursive equivalent) where...

every context-free language is context-sensitive, every context-sensitive language is recursive and every recursive language is recursively enumerable. These...

repeatedly call code. It is proved in computability theory that these recursive-only languages are Turing complete; this means that they are as powerful (they...

target of a tail is the same subroutine, the subroutine is said to be tail recursive, which is a special case of direct recursion. Tail recursion (or tail-end...

halt. The halting language is therefore recursively enumerable. It is possible to construct languages which are not even recursively enumerable, however...

A recursive island or lake, also known as a nested island or lake, is an island or a lake that lies within a lake or an island. For the purposes of defining...

Otherwise it is called a non-recursive grammar. For example, a grammar for a context-free language is left recursive if there exists a non-terminal...

However, the language S(x) may not even be a recursive language, since there are uncountably many such x, but only countably many recursive languages. A function...

general recursive fixpoint queries, which compute transitive closures. In standard SQL:1999 hierarchical queries are implemented by way of recursive common...

Recursive self-improvement (RSI) is a process in which an early or weak artificial general intelligence (AGI) system enhances its own capabilities and...

Derivative code ISO/IEC 10967 ISO/IEC 11404 Language interoperability Pivot language Recursive transcompiling Specification language Transcompiler v t e...

an undecidable problem is a problem whose language is not a recursive set; see the article Decidable language. There are uncountably many undecidable problems...

unlike SNOBOL4 patterns, are not recursive, which gives a distinct computational advantage to SNOBOL4 patterns. (Recursive expressions did appear in Perl...

In mathematics and computer science, a recursive definition, or inductive definition, is used to define the elements in a set in terms of other elements...

elementary recursive function, also called an elementary function, or a Kalmár elementary function, is a restricted form of a primitive recursive function...

that compute them. A related notion is the circuit complexity of a recursive language that is decided by a uniform family of circuits C 1 , C 2 , … {\displaystyle...

exceedingly complex meanings. It is distinguished by the property of recursivity: for example, a noun phrase can contain another noun phrase (as in "[[the...

earlier, but unrelated, programming language that Thompson designed for use on Multics. B was designed for recursive, non-numeric, machine-independent applications...

A recursive neural network is a kind of deep neural network created by applying the same set of weights recursively over a structured input, to produce...

and that every recursive language is a unique solution of some equation. For a one-letter alphabet, Leiss discovered the first language equation with a...

Scheme is a statically scoped and properly tail-recursive dialect of the Lisp programming language invented by Guy L. Steele, Jr. and Gerald Jay Sussman...