{"id": "card_chain_turing_1936", "kind": "reference", "title": "Turing 1936 — On computable numbers, with an application to the Entscheidungsproblem", "body": "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": {"label": "A. M. Turing (1936), Proc. London Math. Soc. (2) 42 (1937) 230–265", "url": "https://doi.org/10.1112/plms/s2-42.1.230", "domain": "computer_science", "authority_tier": "reference"}, "shelf": "codex", "box": "chain", "bands": ["chain", "record", "1936", "turing", "computer science"], "subject": "On computable numbers, with an application to the Entscheidungsproblem", "connections": [{"to_card_id": "card_floor_p_vs_np", "relationship": "part_of", "evidence": "a root of this chain - one of the two trees it began from"}, {"to_card_id": "card_chain_hartmanis_stearns_1965", "relationship": "enables", "evidence": "time as a resource: the hierarchy of complexity classes"}, {"to_card_id": "card_chain_cobham_1965", "relationship": "enables", "evidence": "feasible = polynomial in the LENGTH of the input, and the length of a number is its logarithm"}, {"to_card_id": "card_chain_edmonds_1965", "relationship": "enables", "evidence": "a 'good' algorithm is a polynomial-time one: the class P named by its intent"}, {"to_card_id": "card_src_mill_davis_logemann_loveland_1962", "relationship": "enables", "evidence": "a later work standing on an earlier one"}], "author": "engine", "created_at": 0.0, "updated_at": 0.0, "visibility": "public", "lifecycle_stage": "public", "volatility": "permanent", "surface": "secular", "generated": false, "call": "codex.chain", "facets": {"subject": ["1936", "computer science", "record", "turing"]}, "presentation": {"glyph": "•", "kind_label": "chain", "by": "A. M. Turing (1936), Proc. London Math. Soc. (2) 42 (1937) 230–265", "authority": "reference", "posted": "", "standing": "", "link": {"url": "https://doi.org/10.1112/plms/s2-42.1.230", "host": "doi.org", "provider": "", "titled": "Turing 1936 — On computable numbers, with an application to the Entscheidungsproblem", "waybill_line": "", "reach": "", "embed": ""}}, "neighbors": [{"id": "card_floor_p_vs_np", "title": "The P versus NP chain - from the machine and the circuit to the three barriers", "relationship": "part of", "why": "a root of this chain - one of the two trees it began from", "href": "/card/card_floor_p_vs_np", "resolved": true}, {"id": "card_chain_hartmanis_stearns_1965", "title": "Hartmanis 1965 — On the computational complexity of algorithms", "relationship": "enables", "why": "time as a resource: the hierarchy of complexity classes", "href": "/card/card_chain_hartmanis_stearns_1965", "resolved": true}, {"id": "card_chain_cobham_1965", "title": "Cobham 1965 — The intrinsic computational difficulty of functions", "relationship": "enables", "why": "feasible = polynomial in the LENGTH of the input, and the length of a number is its logarithm", "href": "/card/card_chain_cobham_1965", "resolved": true}, {"id": "card_chain_edmonds_1965", "title": "Edmonds 1965 — Paths, trees, and flowers", "relationship": "enables", "why": "a 'good' algorithm is a polynomial-time one: the class P named by its intent", "href": "/card/card_chain_edmonds_1965", "resolved": true}, {"id": "card_src_mill_davis_logemann_loveland_1962", "title": "M. Davis 1962 — A machine program for theorem-proving", "relationship": "enables", "why": "a later work standing on an earlier one", "href": "/card/card_src_mill_davis_logemann_loveland_1962", "resolved": true}], "house": {"door": "FIND", "kind": "card", "trail": "connections", "seal": "/card/card_chain_turing_1936", "next_step": {"do": "read the source itself", "door": "FIND", "web": "/reader.html?card=card_chain_turing_1936"}, "ends": "a verdict or a card · the trail · a seal · one next step"}}