[JamesP81]

BTW, non-axiomatic computational models generally work by implicitly sifting all possible answers they are capable of expressing in parallel, selecting the best answer in a given context from the entire set.

Yep. That's why a quantum computer can break the RSA code so much more easily than classical machines.

I continually find it amazing that computer science has a tendency to lead a person to attempt to deal with some of the most fundamental questions of human existence.

[tortoise]

Yep. That's why a quantum computer can break the RSA code so much more easily than classical machines.

Apples and oranges though. I do not know of anyone that has shown non-axiomatic computation on quantum computers is generally more efficient than using classical computers. Everything done with quantum computers to date is classic axiomatic computation, albeit in a different fashion. Without thinking about it too hard, there are aspects of non-axiomatic computation that are probably not amenable to quantum shortcuts.

Non-axiomatic computers have an intrinsic massive parallelism, but it is a very different kind of parallelism than quantum computing exploits.