On 07-Jan-19 16:18, Liang Ng wrote:
> On Monday, 7 January 2019 22:45:33 UTC+8,
foxaudio...@gmail.com
> wrote:
>> On Monday, January 7, 2019 at 3:41:31 AM UTC-5, Alex McDonald
>> wrote:
>>>
>>> Good luck with the proof.
>>>
>>>
https://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_theorems#Second_incompleteness_theorem
>>>
>>>
>>>
I hope you find this suitably theoretical.
>
> I would like to put forward two of my perspectives:
>
> (1) Mathematicians like Godel are human beings, born before the age
> of electronic computers, or more strictly, before Dijkstra's stack
> machine reverse polish notation (SMRPN).
Here's your chance to win the Field's medal, and be the mathematical
hero of our age. Prove Gödel wrong.
>
> We programmers should propose a bootstrap theorem.
What on earth does this mean?
> I have attempted
> with SM1 above, by combining SMRPN with induction. It is just the
> beginning, and open ended. The beauty of this proof is that it is
> homoiconic and self-verifying -- which should be the fundamental
> criteria of all SMRPN theorems. So the extent of the proof depends on
> how many functions (Forth words) can be executed, starting from the
> proof of natural numbers.
The theory that dinosaurs are thin at one end, fat in the middle and
thin at the other end, is easily disproved by archaeopteryx. A theorem
is not a proof. All the above and the rest I've snipped is pseudo
mathematical bafflegab I'm afraid. No, I am not a professional
mathematician, but it's plainly obvious you aren't either.
I'm not understanding what you are trying to achieve by posting on clf.
[snip]
--
Alex