Keyboard graph navigation: press N for concepts or E for relations; use arrow keys, Home, and End to move; Enter selects; Shift plus Enter selects and centers; plus and minus zoom; zero fits; Escape clears the selection. Use the visible viewport buttons as alternatives to dragging, wheel, and pinch gestures.
Canonical static concept record
Open this concept in the interactive graphRead the Markdown equivalent
A finitely specified, mechanically executable procedure given by unambiguous rules for transforming inputs, producing outputs when it terminates.
wp-algorithmnlab-algorithmturing-computable-numbersEach relation below ends at this concept.
No direct relations are authored in this direction.
Each relation below starts at this concept.
This is an authored directed relation from the source endpoint to the target endpoint.
Attempts to characterize the informal notion of an effective algorithm led to mutually equivalent formal models and the Church–Turing thesis.
The source experiment, observation, anomaly, or problem materially motivated the development, revision, or acceptance of the target concept. Historical influence is not logical derivation; the edge detail states the documented role and avoids retrospective origin myths.
turing-computable-numbersThis is an authored directed relation from the source endpoint to the target endpoint.
A terminating or partial algorithm determines a partial function. The assertion that every effective algorithm is captured by Turing computability is the Church–Turing thesis, not a formal theorem.
Reinterpret an object, pass to an equivalent presentation, or relate canonically corresponding structures; the carrier may change.
turing-computable-numbersThis is an authored directed relation from the source endpoint to the target endpoint.
A Turing machine is one precise mathematical model of a finitely specified mechanical procedure; identifying it with the full informal notion of algorithm invokes the Church–Turing thesis.
A more specific theory, model, entity class, or regime is obtained by restricting or extending the scope of a broader framework.
turing-computable-numbers