Biokinetica wrote:
wavefreak58 wrote:
Research Turing Machines, Godel's Incompleteness Theorem (as ruveyn mentioned already), and Theory of Computation in general.
As ruveyn already said, you are essentially asking for a proof generator and as I recall, a general proof generator is impossible. Not impossible as in lacking computer power, but impossible in the same way that 1+1 can never = 3. It is impossible even with a quantum computer. Very loosely, for any proof generator, you can generate the proofs within that system, but there are things outside of the system that you can't "get to" from within the system. Making more proof generating systems and "linking them together", doesn't work because they (again very loosely) all reduce to the same system if you can link them. If you can't link them, they will prove different different, sometime contradictory things. Any Theory of Computation expert would cringe at this explanation, but it gives a bit of the flavor of the problem.
Quantum physicists aren't even sure of that. How are you?
Quantum computing allows many states in a single quantum bit, but the mathematics still reduces to binary. A quantum computer will be very fast, but it cannot compute things that are non-computable any more than it can make 1+1 equal 3. The quantum aspects don't change the underlying mathematics of computation.
_________________
When God made me He didn't use a mold. I'm FREEHAND baby!
The road to my hell is paved with your good intentions.
17 Mar 2011, 3:47 pm
