{"id": "card_chain_cobham_1965", "kind": "reference", "title": "Cobham 1965 — The intrinsic computational difficulty of functions", "body": "A. Cobham (1965). The intrinsic computational difficulty of functions. Logic, Methodology and Philosophy of Science (Proc. 1964 Congress), North-Holland, 1965, 24–30. Cited by its record. License as found: cited by its record. What it gave the chain: feasible = polynomial in the LENGTH of the input, and the length of a number is its logarithm.", "source": {"label": "A. Cobham (1965), Logic, Methodology and Philosophy of Science (Proc. 1964 Congress), North-Holland, 1965, 24–30", "url": "", "domain": "computer_science", "authority_tier": "reference"}, "shelf": "codex", "box": "chain", "bands": ["chain", "record", "1965", "cobham", "computer science"], "subject": "The intrinsic computational difficulty of functions", "connections": [{"to_card_id": "card_chain_briggs_1624", "relationship": "builds_on", "evidence": "feasible = polynomial in the LENGTH of the input, and the length of a number is its logarithm"}, {"to_card_id": "card_question_p_vs_np", "relationship": "connects_at", "evidence": "where the logarithm enters: the length of the input is the logarithm of the number; polynomial means polynomial in that log (sealed: the digits of 2^64)"}, {"to_card_id": "card_chain_turing_1936", "relationship": "builds_on", "evidence": "feasible = polynomial in the LENGTH of the input, and the length of a number is its logarithm"}, {"to_card_id": "card_src_mill_cook_1971", "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": ["1965", "cobham", "computer science", "record"]}, "presentation": {"glyph": "•", "kind_label": "chain", "by": "A. Cobham (1965), Logic, Methodology and Philosophy of Science (Proc. 1964 Congress), North-Holland, 1965, 24–30", "authority": "reference", "posted": "", "standing": ""}, "neighbors": [{"id": "card_chain_briggs_1624", "title": "Briggs 1624 — Arithmetica logarithmica", "relationship": "builds on", "why": "feasible = polynomial in the LENGTH of the input, and the length of a number is its logarithm", "href": "/card/card_chain_briggs_1624", "resolved": true}, {"id": "card_question_p_vs_np", "title": "P versus NP", "relationship": "connects at", "why": "where the logarithm enters: the length of the input is the logarithm of the number; polynomial means polynomial in that log (sealed: the digits of 2^64)", "href": "/card/card_question_p_vs_np", "resolved": true}, {"id": "card_chain_turing_1936", "title": "Turing 1936 — On computable numbers, with an application to the Entscheidungsproblem", "relationship": "builds on", "why": "feasible = polynomial in the LENGTH of the input, and the length of a number is its logarithm", "href": "/card/card_chain_turing_1936", "resolved": true}, {"id": "card_src_mill_cook_1971", "title": "S. A. Cook 1971 — The complexity of theorem-proving procedures", "relationship": "enables", "why": "a later work standing on an earlier one", "href": "/card/card_src_mill_cook_1971", "resolved": true}], "house": {"door": "FIND", "kind": "card", "trail": "connections", "seal": "/card/card_chain_cobham_1965", "next_step": {"do": "follow a connection: what this card rests on, and what rests on it", "door": "FIND", "tool": "card_connections", "params": {"id": "card_chain_cobham_1965"}}, "ends": "a verdict or a card · the trail · a seal · one next step"}}