A card from a free library — ask anything, no account, works offline. Every card carries its source.
Turing 1936 — On computable numbers, with an application to the Entscheidungsproblem
chain
A. M. Turing (1936). On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc. (2) 42 (1937) 230–265. DOI 10.1112/plms/s2-42.1.230. Canonical: https://doi.org/10.1112/plms/s2-42.1.230. Cited by its record. License as found: Wiley terms and conditions — publisher's copyright, cited. What it gave the chain: the machine: what computation is.
source
card id
card_chain_turing_1936
address
WIT.codex.FCT/on-computable-numbers-with-an-application-to-the/REF.WITNESSED@a-m-turing
adjoining cards
- part of → The P versus NP chain - from the machine and the circuit to the three barriers — a root of this chain - one of the two trees it began from
- enables → Hartmanis 1965 — On the computational complexity of algorithms — time as a resource: the hierarchy of complexity classes
- enables → Cobham 1965 — The intrinsic computational difficulty of functions — feasible = polynomial in the LENGTH of the input, and the length of a number is its logari
- enables → Edmonds 1965 — Paths, trees, and flowers — a 'good' algorithm is a polynomial-time one: the class P named by its intent
- enables → M. Davis 1962 — A machine program for theorem-proving — a later work standing on an earlier one
Is this card incomplete? Tell the library — it will call out for more ↗