[math-fun] preprint: uncertainty principle in AIT

Greg Chaitin defined Omega_U as the halting probability for a self-delimiting Turing machine U. (Self-delimiting means that the domain of U is a prefix-free set; that is, no program is the prefix of another.) I noticed that Chaitin's theorem about the (un)computability of bits of Omega_U can be recast as an uncertainty principle. My professor and I have written a paper; a preprint is available at http://www.cs.auckland.ac.nz/CDMTCS/researchreports/235cris.pdf I'd appreciate any comments. Thanks! -- Mike Stay staym@clear.net.nz http://www.cs.auckland.ac.nz/~msta039