theorem 3.96 Turing
open in the book ·
parts/02-mathematical-methods/01-logic-sets.tex:2778
· p. 51
Rests on
-
depends_on
definition 3.93
Computable function, decidable set
¶
- depends_on definition 3.92 Turing machine ¶
- depends_on definition 3.92 Turing machine ¶ ↺
- proves proof ch:01-logic-sets@proof-23 ¶
Supports
- depends_on theorem A.30 Church, Turing ¶
- depends_on theorem 3.98 Church–Turing ¶
- depends_on theorem 3.97 Rice ¶
Neighborhood
Every logical edge within two steps of this node.
- declared and complete
- partly declared
- a check failed
- not graded
- declared in the source
- inferred from structure
Edges
| type | direction | node | provenance | where |
|---|---|---|---|---|
cites |
→ | On Computable Numbers, with an Application to the Entscheidungsproblem | derived | parts/02-mathematical-methods/01-logic-sets.tex:2782 |
depends_on |
→ | Computable function, decidable set | declared | parts/02-mathematical-methods/01-logic-sets.tex:2783 |
depends_on |
→ | Turing machine | declared | parts/02-mathematical-methods/01-logic-sets.tex:2783 |
depends_on |
← | Church, Turing | declared | appendices/A-long-proofs.tex:2581 |
depends_on |
← | Church–Turing | declared | parts/02-mathematical-methods/01-logic-sets.tex:2863 |
depends_on |
← | Rice | declared | parts/02-mathematical-methods/01-logic-sets.tex:2825 |
proves |
← | ch:01-logic-sets@proof-23 | declared | parts/02-mathematical-methods/01-logic-sets.tex:2786 |