= 27d567bc2d48d9f40e9ccc20ea370b15)
TheAncientGeek comments on If Many-Worlds Had Come First - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (179)
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,