Close, but no cigar. The problem is that while a Turing machine can simulate arbitrarily powerful computers, they can’t simulate infinitely powerful computers like a hyper computer, which is necessary to do.
As constructed, I don’t see how UDASSA solves the problem.
Close, but no cigar. The problem is that while a Turing machine can simulate arbitrarily powerful computers, they can’t simulate infinitely powerful computers like a hyper computer, which is necessary to do.
As constructed, I don’t see how UDASSA solves the problem.