1.Previous
3.Next

general recursiveness and Emil Post's 1-definability.

Today, any formal statement or calculation that exhibits this quality of well-definedness is termed computable, while the statement or calculation itself is referred to as a computation.

Turing's definition apportioned "well-definedness" to a very large class of mathematical statements, including all well-formed algebraic statements, and all

1.Previous
3.Next