Math Forum Discussions

The Math Forum

Welcome, Guest

	Login / Register
	Guest Settings
	FAQ
Contact Us

Search All of the Math Forum:

Browse our Internet Mathematics Library

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: Pathological Self-Reference and the Halting Problem [was:The
empty string as a code]
Replies: 3 Last Post: Jun 18, 2012 3:37 AM

Reply to this Topic

Back to Topic List

Jump to Tree View

Messages: [ Previous | Next ]

Graham Cooper

Posts: 4,048
Registered: 5/20/10

Re: Pathological Self-Reference and the Halting Problem [was:The
empty string as a code]
Posted: Jun 18, 2012 3:37 AM

Plain Text

Reply

An ACTUAL Godel Statement.

*******************************

a0(a11)=a11

a0(a11)=a0(a111)^a0(a110)^(!(a111^a110)va11)

a1=11111010010101111001111

!a0(a1)

*******************************

OK 4 lines!

PROOF(c)<->c
PROOF(c)<->PROOF(a)^PROOF(b)^(a^b)->c
a1=8203215
NOT(PROOF(a1)) **GodelStatement**

8203215 GODEL NUMBER (a1)
!a0(a1) GODEL STATEMENT

01a(,)^v!= 0123456789

Herc
--
http://tinyURL.com/BLUEPRINTS-GODEL

Date

Subject

Author

6/18/12

Re: Pathological Self-Reference and the Halting Problem [was:The
empty string as a code]

Graham Cooper

6/18/12

Re: Pathological Self-Reference and the Halting Problem [was:The
empty string as a code]

Graham Cooper

[Privacy Policy] [Terms of Use]