All of the proofs ASSUME that there is an input D that can ACTUALLY DONo, the proof assumes there is a *decider* and then shows exactly *how*
the opposite of whatever value that H returns making it impossible for H
to decide D.
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 499 |
Nodes: | 16 (2 / 14) |
Uptime: | 46:53:51 |
Calls: | 9,834 |
Calls today: | 4 |
Files: | 13,764 |
Messages: | 6,193,832 |