Site Navigation
Categories:
Recursion theory
Theory of computation

Summary Of: Computable function

the problem of determining the complexity of a computable function is known as a... If a computable function is defined then it returns a single natural number as output... The basic characteristic of a computable function is that there must be a finite procedure... Thus every computable function must have a finite program that completely describes how the function is to be computed... coding system must be developed to allow a computable function to take an arbitrary word in the language as input... Every computable function has a finite procedure telling how to compute it...

Encyclodia Page On: Computable function

These Are Links To Other Documents
Recursive function | computability theory | algorithm | model of computation | Turing machines | register machines | mathematicians | exponentially | superexponentially | feasible computability | computational complexity | Church-Turing thesis | algorithm | Blum axioms | computational complexity theory | function problem | finitary | partial functions | natural numbers | Turing machine | models of computation | Turing machines | μ-recursive functions | Lambda calculus | Post-Turing machines | tag machines | Register machines | pairing function | domain | total | Algorithm | algorithm | compiler | computational complexity | if and only if | injective | finitary relation | Formal language | computability theory in computer science | formal languages | domain | constant function | Addition | greatest common divisor | Bézout's identity | Diophantine equation | Busy Beaver function | Church-Turing thesis | List of undecidable problems | computable number | Busy beaver | Halting problem | Entscheidungsproblem | David Hilbert | relativized | set | natural numbers | Turing machines | oracle | Hypercomputation | Hyperarithmetical theory | Computable number | Effective method | Theory of computation | Recursion theory | Turing degree | Arithmetical hierarchy | Hypercomputation | Super-recursive algorithm | Semicomputable function | Turing, A. | Categories | Recursion theory | Theory of computation |
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Computable function".