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,...

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

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...

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...

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

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...

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...

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

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

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...

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...

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...

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...

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...

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

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...

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

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...

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...

LOOP is a simple register language that precisely captures the primitive recursive functions. The language is derived from the counter-machine model. Like...

the similarities between these two languages, in part because of their use of dynamic typing, and the simple recursive nature of their data structures....

computable functions are the Turing-computable functions and the general recursive functions. According to the Church–Turing thesis, computable functions...

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

fac (n : int) : int = n * fac (n - 1) This describes the factorial as a recursive function, with a single terminating base case. It is similar to the descriptions...

expression evaluation, parameterised recursive functions, and data types and structures, while assembly language was considered "low-level". Today, many...

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

is a member of a formal language. The class of languages which can be decided by such machines is the set of recursive languages. Given an arbitrary Turing...

Asia, from Korea to Vietnam. Sagart also groups the Austronesian languages in a recursive-like fashion, placing Kra-Dai as a sister branch of Malayo-Polynesian...