On 2/20/2015 8:54 AM, Bruno Marchal wrote:
It is a theorem of comp, also. The many worlds, in his relative state formulation, is already a consequence of computationalism. By church thesis, *all* computations are emulated in all possible ways in elementary arithmetic, with a typical machine-independent redundancy: it makes the notion of "world" formulable,
Does it? What's the definition of a world in comp? Can you show that there are distinction denumerable worlds?
Brent -- You received this message because you are subscribed to the Google Groups "Everything List" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/d/optout.
