Article View: comp.ai
Article #1195Re: Algorithms, Turing, Semantics
From: Albert Boulanger
Date: Wed, 17 Jan 1990 01:51
Date: Wed, 17 Jan 1990 01:51
19 lines
1373 bytes
1373 bytes
In article <12945@phoenix.Princeton.EDU>, Karl Robert Pfleger writes: Lastly, there is no proof that physical systems have an infinite number of states. Space could be discrete. Time could be discrete. Either could be finite. Yeah. Interestingly, T. Erber and S. Putterman in "Randomness in Quantum Mechanics -- Nature's Ultimate Cryptogram?", Nature, Vol 318 #7, November 1985, pp 41-43, suggest looking for pseudo-random signatures in isolated single-ion systems, based in part by the quantum-mechanical quantization of phase-space at Plank lengths. If QM was deterministic, (and the axiomatic development of QM says nothing about this quality), then single isolated QM systems would recur. Looking for a QM computer with maximal algorithmic complexity quantities, Albert Boulanger BBN Systems & Technologies Corp. aboulanger@bbn.com
Technical Details
Message-ID:
<51004@bbn.COM>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!usc!bbn!bbn.com!aboulangReferences:
<12883@phoenix.Princeton.EDU> <91Eq02wy7eX=01@amdahl.uts.amdahl.com> <12945@phoenix.Princeton.EDU>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!usc!bbn!bbn.com!aboulang From: aboulang@bbn.com (Albert Boulanger) Newsgroups: comp.ai Subject: Re: Algorithms, Turing, Semantics Message-ID: <51004@bbn.COM> Date: 17 Jan 90 01:51:05 GMT References: <12883@phoenix.Princeton.EDU> <91Eq02wy7eX=01@amdahl.uts.amdahl.com> <12945@phoenix.Princeton.EDU> Sender: news@bbn.COM Reply-To: aboulanger@bbn.com Lines: 19 In-reply-to: kpfleger@phoenix.Princeton.EDU's message of 15 Jan 90 17:18:34 GMT