You must log in or register to comment.
In short, everything that is Turing-conplete can compute anything.
Except for that which is non-computable.
New to me that there is proof that something is not computable.
The most obvious answer to this is the halting problem.
Like yo Mama’s weight!
SCNR
That doesn’t compute.
