Date: Jan 29, 2013 4:39 PM
Author: Graham Cooper
Subject: UN-PROVABLE, UN-COMPUTABLE & UN-COUNTABLE are all UN-BELIEVABLE!
Consider Turing Machine 1 halts on input value 1.

1 e POWERSET(N)_SUBSET1

Every possible formulatic method in existence!

ensures every possible subset of N <1 2 3 4...>

is COMPUTABLE!

BIJECTION FROM N TO POWERSET(N)

1 <=> < 1 2 3 4 5 ...> tm1

2 <=> < 2 4 6 8 ... > tm2

3 <=> < 1 2 > tm3

...

A SEMI-DECIDABLE LIST OF (ALL COMPUTABLE) SUBSETS OF N!

====================================

the only UN-PROVABLE sentences are idiotic nonsense like

X = 'not (exist( proof( X )))'

The only WITNESS to missing computable reals is CHAITANS OMEGA which

is based on :

S: if Halts(S) Gosub S

Halt() MUST BE UN-COMPUTABLE!???

--------------------------

Really, abstract mathematics is the biggest century long con to ever

exist under the guise of 'WEVE FORMALLY PROVED IT ALL!'

You haven't formally proven ANY OF ALL THE UN-DOABLE RUBBISH!

You redid the same errors with Calculus and BIJECTION / ONTO self

defeating function definitions instead!

|N| = |GODEL NUMBERS| = |FUNCTIONS|

= |CHOICE FUNCTIONS| = |SETS|

by your own AXIOM OF CHOICE

THIS IS IMPOSSIBLE!

These errors all stem from

INFINITIE LENGTH FUNCTION STRINGS!

As if a TM couldn't do this with a finite formula!

1 + 1/2 - 1/3 + 1/4 - 1/5 + ....

-----------------------------------

|R| > |N| is all in their heads!

Herc

--

www.BLoCKPROLOG.com