Pete Olcott

2017-06-13 17:55:40 UTC

<html>

<head>

<meta http-equiv="content-type" content="text/html; charset=utf-8">

</head>

<body bgcolor="#FFFFFF" text="#000000">

<p><font face="Segoe UI Symbol"><a class="moz-txt-link-freetext" href="https://groups.google.com/forum/#!original/">https://groups.google.com/forum/#!original/</a><b>comp.theory</b>/2-h0Q98BWr0/BgRbliY-jMkJ

<br>

From: <b>Graham Cooper</b> <a class="moz-txt-link-rfc2396E" href="mailto:***@gmail.com"><***@gmail.com></a><br>

Newsgroups: comp.theory,sci.logic<br>

Subject: Re: The answer to the Halting Problem stored within

Permutations of<br>

Internal States?<br>

Date: Wed, <b>16 May 2012</b> 23:04:47 -0700 (PDT)<br>

</font></p>

<p><font face="Segoe UI Symbol"><b>Here is my formula: </b><b><br>

</b>G( ~∃Γ ⊂ PM (Γ ⊢ G) ) // Incompleteness Theorem as a named

predicate <br> <b>In other words: G( ~Provable(PM, G) )</b><br> </font></p> <p><b>Here is Graham Cooper's way of saying it:</b><b><br> </b>PROOF(C) =3D C v (PROOF(A) ^ PROOF(B) ^ (A^B->C))<br>

<br>

THE PROOF PREDICATE GODEL PROVED DOESN'T EXIST!<br>

<br>

C is proven IF c is a theorem in the theory<br>

OR C is derived from other theorems (A^B) in the theory!<br>

<br>

It's slightly rearranged from the original specification, a dual

tail<br>

end <b>recursive directed acyclic graph of binary deductions</b>!<br>

</p>

-- <br>

<div class="moz-signature">

<p class="western" style="margin-bottom: 0in"><b><font

face="Arial, sans-serif"><font style="font-size: 12pt"

size="2">(Γ

</font><font style="font-size: 12pt" size="2">⊨ </font><sub><font

style="font-size: 8pt" size="2">FS</font></sub><font

style="font-size: 12pt" size="2">

A) ≡ (</font><font style="font-size: 12pt" size="2">Γ </font><font

style="font-size: 12pt" size="2">⊢

</font><sub><font style="font-size: 8pt" size="2">FS</font></sub><font

style="font-size: 12pt" size="2">

A)</font></font></b></p>

<b>

</b>

<p class="western" style="margin-bottom: 0in"><br>

</p>

</div>

</body>

</html>

<head>

<meta http-equiv="content-type" content="text/html; charset=utf-8">

</head>

<body bgcolor="#FFFFFF" text="#000000">

<p><font face="Segoe UI Symbol"><a class="moz-txt-link-freetext" href="https://groups.google.com/forum/#!original/">https://groups.google.com/forum/#!original/</a><b>comp.theory</b>/2-h0Q98BWr0/BgRbliY-jMkJ

<br>

From: <b>Graham Cooper</b> <a class="moz-txt-link-rfc2396E" href="mailto:***@gmail.com"><***@gmail.com></a><br>

Newsgroups: comp.theory,sci.logic<br>

Subject: Re: The answer to the Halting Problem stored within

Permutations of<br>

Internal States?<br>

Date: Wed, <b>16 May 2012</b> 23:04:47 -0700 (PDT)<br>

</font></p>

<p><font face="Segoe UI Symbol"><b>Here is my formula: </b><b><br>

</b>G( ~∃Γ ⊂ PM (Γ ⊢ G) ) // Incompleteness Theorem as a named

predicate <br> <b>In other words: G( ~Provable(PM, G) )</b><br> </font></p> <p><b>Here is Graham Cooper's way of saying it:</b><b><br> </b>PROOF(C) =3D C v (PROOF(A) ^ PROOF(B) ^ (A^B->C))<br>

<br>

THE PROOF PREDICATE GODEL PROVED DOESN'T EXIST!<br>

<br>

C is proven IF c is a theorem in the theory<br>

OR C is derived from other theorems (A^B) in the theory!<br>

<br>

It's slightly rearranged from the original specification, a dual

tail<br>

end <b>recursive directed acyclic graph of binary deductions</b>!<br>

</p>

-- <br>

<div class="moz-signature">

<p class="western" style="margin-bottom: 0in"><b><font

face="Arial, sans-serif"><font style="font-size: 12pt"

size="2">(Γ

</font><font style="font-size: 12pt" size="2">⊨ </font><sub><font

style="font-size: 8pt" size="2">FS</font></sub><font

style="font-size: 12pt" size="2">

A) ≡ (</font><font style="font-size: 12pt" size="2">Γ </font><font

style="font-size: 12pt" size="2">⊢

</font><sub><font style="font-size: 8pt" size="2">FS</font></sub><font

style="font-size: 12pt" size="2">

A)</font></font></b></p>

<b>

</b>

<p class="western" style="margin-bottom: 0in"><br>

</p>

</div>

</body>

</html>