4 ms·
Oh yes the the incompleteness theorem. Sorry. I meant to say "one single ruling programming language to solve every Turing programming problem". For example J
by frankreyes 3y ago
Oh yes the the incompleteness theorem. Sorry.
I meant to say "one single ruling programming language to solve every Turing programming problem".
For example Java will be the ultimate ruling programming language, having a CPU that would directly run java byte code.
Nope.