Out of the box, a classical computer doesn’t represent the ontology of rQM because all information has an observer-independent representation, but s software layer can hide literal representations in the way a
LISP gensym does. Uncomputability is not required.
In any case, classical computability isn’t a good index of complexity. It’s an index of how close something is to a classical computer. Problems are harder or easier to solve according to the technology used to solve them. That’s why people don’t write device drivers in LISP.
Out of the box, a classical computer doesn’t represent the ontology of rQM because all information has an observer-independent representation, but s software layer can hide literal representations in the way a LISP gensym does. Uncomputability is not required.
In any case, classical computability isn’t a good index of complexity. It’s an index of how close something is to a classical computer. Problems are harder or easier to solve according to the technology used to solve them. That’s why people don’t write device drivers in LISP.
Um, computability has very little to do with “classical” computers. It’s a very general idea relating to the existence of any algorithm at all.
Uncomputability isn’t needed to model the ontology of rQM,