Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

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: CHAITAN'S POWERSET!
Replies: 3   Last Post: Mar 6, 2013 1:24 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Graham Cooper

Posts: 4,293
Registered: 5/20/10
CHAITAN'S POWERSET!
Posted: Jan 16, 2013 3:48 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

INPUT 1 2 3 4 5 6 7 8 9 10 ...
=============================
TM1 H L H H H L L L L L ...
TM2 H H H H H H H H H H ...
TM3 H L L L L L L L L L ...
TM4 L H L H L H L H L H ...
...
If TM1(1) Halts then 1 e POWERSET_1
If TM1(2) Loops then 2 !e POWERSET_1
...
If TM2(1) Halts then 1 e POWERSET_2
If TM2(2) Halts then 2 e POWERSET_2
...

1 <=> {1,3,4,5,...}
2 <=> {1,2,3,4,5,...}
3 <=> {1}
4 <=> {2,4,6,8,10...}
| | | | |
TM4 LHLHLHLHLH ...

Instead of constructing an UN-COMPUTABLE REAL
And using CHAITANS OMEGA to argue computable reals are UN-COUNTABLE

YOU CAN CONSTRUCT AN ACTUAL SEMI-DECIDABLE
POWERSET OF N!

Herc
--
S: if stops(S) gosub S
G. GREENE: this proves stops() must be un-computable!




Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.