|
|
![[parent]](http://images.planetmath.org:8080/images/uparrow.png) Viewing Message
|
|
|
| ``Self reference''
by AxelBoldt on 2002-04-01 22:54:34 |
|
| I think the proof glosses over the crucial part: How can Break refer to itself within Break's definition?
You need to use Goedel's trick somehow: first construct an algorithm B that stops if and only if its argument, interpreted as an algorithm, won't stop on its own description, and then feed the description of B to B itself.
Akin to the barber (B) who shaves everybody who doesn't shave himself. Ask whether B shaves B and it blows up. |
| | [ reply | up ] | |
|
|
|
|
|
|
|
