Author |
Topic: The 10^n riddle from GEB (Read 1598 times) |
|
Yair
Guest
|
In more words, the puzzle is to represent the notion "m is a power of 10" in the TNT formal system, as presented in the book "Godel, Escher, Bach". The book says it's quite difficult and requires good knowledge of number theory. After having spent many ours trying to solve it myself, I sort of gave up and went looking for a solution online. However, the closest I came to finding it was some broken link to a usenet post which presumably contained the solution . However, the linking page did say that the solution utilized the Chinese Remainder Theorem. Also, I have another, more general Formal Logic/GEB-related question: What is the proof that every primitive-recursive procedure (that is, a bounded loop) is represented by a TNT formula?
|
|
IP Logged |
|
|
|
Yair
Guest
|
|
Re: The 10^n riddle from GEB
« Reply #2 on: Jun 29th, 2005, 12:55pm » |
Quote Modify
Remove
|
Thanks a lot! BTW the same page also contains the outline of an answer to my second question.
|
|
IP Logged |
|
|
|
|