Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

How Do You ---RUN--- an Uncountable Function?

10 views
Skip to first unread message

Graham Cooper

unread,
Nov 18, 2012, 9:50:52 PM11/18/12
to
Why this is marked as abuse? It has been marked as abuse.
Report not abuse
*****************************************************
*****************************************************

Q5
Which 1 of these does not hold?

a) |N| = |GODEL NUMBERS|
b) |GODEL NUMBERS| = |FUNCTIONS|
c) |FUNCTIONS| = |CHOICE FUNCTIONS|
d) |CHOICE FUNCTIONS| = |SETS|
e) |SETS| > |N|

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

That must be 1 MUTHA HUGE COMPUTER to run all those UNCOUNTABLE
choice functions!


Herc

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

William Hughes

unread,
Nov 19, 2012, 12:20:42 AM11/19/12
to
On Nov 18, 10:50 pm, Graham Cooper <grahamcoop...@gmail.com> wrote:
> *****************************************************
> *****************************************************
>
> Q5
> Which 1 of these does not hold?
>
> a)  |N| = |GODEL NUMBERS|
> b)  |GODEL NUMBERS| = |FUNCTIONS|
> c)  |FUNCTIONS| = |CHOICE FUNCTIONS|
> d)  |CHOICE FUNCTIONS| =  |SETS|
> e)  |SETS| > |N|
>



(b) does not hold


> *****************************************************
> *****************************************************
>
> That must be 1 MUTHA HUGE COMPUTER to run all those UNCOUNTABLE
> choice functions!

Since all but a countable subset are uncomputable, the vast
majority cannot be run.

0 new messages