On 1/17/2013 7:10 PM, Richard Ruquist wrote:
I particularly liked this statement by Baez which relates to Feynman
renomalization for QED and Crammer's Transactioanal Analysis:
"Manin and Marcolli  derived similar results in a broader context and
studied phase transitions in those systems. Manin [18, 19] also outlined an
ambitious program to treat the inﬁnite runtimes one ﬁnds in
undecidable problems as singularities to be removed through the
process of renormalization."
"To see algorithmic entropy as a special case of the entropy of a
probability measure, it is useful to follow Solomonoﬀ  and take a
Bayesian viewpoint." which answers Russell's concern.
My overall impression from tthe Baez paper is that the Quantum Mind
could use a similar analysis to predict/represent the behavior of
classical systems based on computable real numbers but not quantum
systems based on complex variables.
The "the behavior of classical systems based on computable real
numbers" is not an improvement over quantum systems based on complex
numbers. At least systems based on complex numbers can deal with phase
relations and generate finite approximations in finite time. Real number
based computation is ... difficult. See:
http://en.wikipedia.org/wiki/Real_computation How can you even program them?
On Thu, Jan 17, 2013 at 4:21 PM, Russell Standish<li...@hpcoders.com.au> wrote:
> From just the abstract alone, I can't see how this differs from the
>Solomonff universal prior?
You received this message because you are subscribed to the Google Groups
"Everything List" group.
To post to this group, send email to firstname.lastname@example.org.
To unsubscribe from this group, send email to
For more options, visit this group at