4 ms·
>they are both expressible in terms of what he called a Universal Machine. Prove it.
by dilemma 10y ago
>they are both expressible in terms of what he called a Universal Machine.
Prove it.
- zingermc 10y agoWe are still waiting on a proof of the Church-Turing Thesis, so maybe that is next on the agenda.