[ Followup-To: set ]https://en.wikipedia.org/wiki/Zeno_machine
>
In sci.math Scott Hoge <nospam@nospam.com> wrote:On 2026-04-27, olcott <polcott333@gmail.com> wrote:>[...]>>On 4/26/2026 3:01 PM, Scott Hoge wrote:>[...]>The correct interpretation was, I argued, not "This sentence
is unprovable," but rather:>The following is unprovable (1):
The following is unprovable (2):
The following is unprovable (3):
...>The directed graph of the evaluation sequence of G
has a cycle preventing its evaluation from ever
terminating.>If you have no idea what directed graphs are you will
never get this. If you always knew what directed graphs
of evaluation sequences that contain cycles are then
you rebuttal has always been pure dishonesty.I learned what directed graphs were in high school.>It seems our views are somewhat in agreement, but my directed>
graph looks like this:(D1)>
· ─→ · ─→ · ─→ · ─→ ...
I strongly urge you to read and understand an actual proof of Gödel's
incompleteness theorem[*]. There are no looping or endless directed
graphs in these. Such notions result from misunderstandings by those
lacking formal training in mathematics.
>
[*] I would suggest finding a second hand copy of "Gödel, Escher, Bach,
an Eternal Golden Braid" by Douglas Hofstadter, published around 1978 or
1979. A proof of the incompleteness theorem is a central theme of the
book, which is witty and entertaining and well worth reading.
>
Peter Olcott has never read and understood such a proof. Although not
particularly difficult, it is beyond his understanding.
>
And please note, this theorem is _TRUE_. It has been proven rigorously
and verified by millions of students and academics over a very long time
period.
>
Peter Olcott doesn't like it any more than he doesn't understand it, so
he pours scorn on the distinguished mathematicians of the past, falsely
claiming it to be false. I would urge you to be sceptical of _any_ so
called "result" emanating from him.
>
[ .... ]
>-- Scott Hoge>
Les messages affichés proviennent d'usenet.