|
|
![[parent]](http://images.planetmath.org:8080/images/uparrow.png) Viewing Message
|
|
|
| ``Re: Self reference''
by archibal on 2004-02-10 16:21:35 |
|
| This is true, but in this particular case it's not really a problem to gloss over the fact. Goedel's trick in this context is: find a way to encode an algorithm as a string of data that an algorithm can process. But this is exact what programming languages do. Running "Halt" on the encoded form of "Break" is not a diificult opertaion to visualize.
Of course, for a full proof, you're quite right. But if one is willing to accept that, say, Scheme is Turing-complete (easy to demonstrate: just write a Turing machine simlator) the proof is relatively straightforward.
|
| | [ reply | up | top ] | |
|
|
|
|
|
|
|
