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
The methodological thesis that every effectively calculable function is computable by a Turing machine, equivalently by other standard models of computation.
This is a thesis identifying an informal notion with a formal class, not a theorem proved from purely formal premises.
wp-church-turing-thesisnlab-church-turing-thesisturing-computable-numbersEach relation below ends 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-numbersEach relation below starts at this concept.
No direct relations are authored in this direction.