General recursive function
In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense. If the function is total, it is also called a total recursive function (sometimes shortened to recursive function). In computability theory, it is shown that the μ-recursive functions are precisely the functions that can be computed by Turing machines (this is one of the theorems that supports the Church–Turing thesis). The μ-recursive functions are closely related to primitive recursive functions, and their inductive definition (below) builds upon that of the primitive recursive functions. However, not every total recursive function is a primitive recursive fun
known for
Wikipage disambiguates
1905 in science1932 in science1936 in science1977 in science20th century in scienceAlgorithm characterizationsAndrzej_GrzegorczykBrainfuckChurch–Turing thesisComputabilityComputability theoryComputable functionComputable numberComputable topologyComputational complexityCounter-machine modelCounter machineDieter RöddingDouble recursionEnumeration reducibilityFunction (mathematics)General-recursiveGeneral recursiveGödel numbering for sequencesHistory of computer scienceHistory of mathematicsHistory of the function conceptIndex of philosophy articles (R–Z)Integer-valued functionJacques HerbrandJudith GerstingKlaus Peter JantkeKleene's T predicateKleene's recursion theoremLOOP (programming language)List of computer scientistsList of terms relating to algorithms and data structuresList of types of functionsLoop variantM-recursive function
Link from a Wikipage to another Wikipage
primaryTopic
General recursive function
In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense. If the function is total, it is also called a total recursive function (sometimes shortened to recursive function). In computability theory, it is shown that the μ-recursive functions are precisely the functions that can be computed by Turing machines (this is one of the theorems that supports the Church–Turing thesis). The μ-recursive functions are closely related to primitive recursive functions, and their inductive definition (below) builds upon that of the primitive recursive functions. However, not every total recursive function is a primitive recursive fun
has abstract
Em lógica matemática e ciência ...... da complexidade computacional.
@pt
En informatique et en mathémat ...... ue sur la classe de fonctions.
@fr
En lògica matemàtica i computa ...... ambda i les cadenes de Markov.
@ca
En lógica matemática y computa ...... ambda y las cadenas de Markov.
@es
Funkcja rekurencyjna – funkcja ...... cji pierwotnie rekurencyjnych:
@pl
In de theoretische informatica ...... n met de berekenbare functies.
@nl
In mathematical logic and comp ...... ory as the complexity class R.
@en
Nella logica matematica e nell ...... ate da un algoritmo di Markov.
@it
Částečně rekurzivní funkce (ČR ...... . primitivně rekurzivní funkce
@cs
Στη μαθηματική λογική και την ...... υπολογιστικής πολυπλοκότητας .
@el
Link from a Wikipage to an external page
Wikipage page ID
Link from a Wikipage to a Wikipage in a different language about the same or a related subject.
page length (characters) of wiki page
Wikipage revision ID
1,021,669,149
Link from a Wikipage to another Wikipage
b
p
wikiPageUsesTemplate
comment
Em lógica matemática e ciência ...... emplo é a função de Ackermann.
@pt
En informatique et en mathémat ...... ue sur la classe de fonctions.
@fr
En lògica matemàtica i computa ...... egut és la funció d'Ackermann.
@ca
En lógica matemática y computa ...... do es la función de Ackermann.
@es
Funkcja rekurencyjna – funkcja ...... cji pierwotnie rekurencyjnych:
@pl
In de theoretische informatica ...... n met de berekenbare functies.
@nl
In mathematical logic and comp ...... n is a primitive recursive fun
@en
Nella logica matematica e nell ...... ramite una macchina di Turing.
@it
Částečně rekurzivní funkce (ČR ...... . primitivně rekurzivní funkce
@cs
Στη μαθηματική λογική και την ...... ο διάσημο παράδειγμα είναι η .
@el
label
Fonction récursive
@fr
Funció recursiva
@ca
Función recursiva
@es
Funkcja rekurencyjna
@pl
Funzione ricorsiva
@it
Função μ-recursiva
@pt
General recursive function
@en
Částečně rekurzivní funkce
@cs
Μ-Rekursion
@de
Μ-recursieve functie
@nl