Proof of the Halting Problem Solved by 'Musatov' Induction Method

STATICALLY, the right lever law is: +- -+ | | I1 I2 I3 ... I[n-2] I
[n-1] I[n] | | | | C[1,n] C[1,1] C[1,2] ... C[1,n-3] C[1,n-2] C
[1,n-1]| | | |C[2,n-1] C[2,n] C[2,1] ... C[2,n-4] C[2,n-3] C[2,n-2]| |
count using 1, 2, 3...

Due to CANTOR we can also count


(0,) 1, 2, 3, ... omega, omega+1, omega+2, ... [etc. ad infinitum]


Concerning the _number_ (cardinal number) of the set of natural
numbers we
have: |{0, 1, 2, 3, ...}| = aleph_0.


Any natural number is a _finite_ cardinal, and aleph_0 is the first
_infinite_ cardinal.


Hence we have: |{ }| = 0 |{0}| = 1 |{0,1}| = 2 :


and (in addition) |{0, 1, 2, 3, ...}| = aleph_0

Category:

Science & Technology

Tags:

• P Versus NP
• Theory of Computation
• Halting Problem
• 'Musatov' Video Proof
• 'Musatov' Solution