http://LiarParadox.org/HP_Infinite_Recursion.pdf
As this page 319 of An Introduction to Formal Languages and Automata
by Peter Linz 1990 indicates
From H' we construct another Turing machine H-Hat. This new machine takes as input Wm, copies it then behaves exactly like H'.
q0 Wm |-* H-Hat q0 Wm Wm...
Page 320 indicates that we apply H-Hat to itself as input.
The problem is that every H-Hat needs a pair of inputs.
H-Hat takes an H-Hat as input and copies it so that it
can analyze how its input H-hat would analyze the copy
of H-Hat that it just made.
The input H-Hat would have to copy its own input H-Hat
so that it can analyze what its own input H-Hat would
do on its own input, on and on forever...
Copyright 2016 and 2017 Pete Olcott.
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 365 |
Nodes: | 16 (2 / 14) |
Uptime: | 64:35:35 |
Calls: | 7,774 |
Files: | 12,908 |
Messages: | 5,749,829 |