CSCI3130 · 5
Chapter outline · Computability
Definitions and theorem statements recorded in the web, in note order, with the exact proof steps behind their recorded connections.
0 of 5 public sections have indexed statements. This outline covers only those statements, not every theorem in the chapter. Recorded connections are still being reviewed.
Turing machines, decidability, and undecidability
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Undecidability: self-reference and a halting reduction
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Rice's theorem and semantic properties
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Why Post correspondence is undecidable
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Why context-free grammar universality is undecidable
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.