On Sat, Aug 27, 2016 at 03:38:40PM -0700, Charles Goodwin wrote: > Hi everyone and everything, I was discussing comp and similar things with > Liz the other day and we came across a sticking point in what I think (from > memory) is step 7 of the UDA. Maybe you can help? > > I'm assuming AR, "Yes, Doctor" and so on. At step 7 we reach the point > where we assume that a physical Universal Dovetailer can be created and > that it runs forever, and ask what is the probability that my observer > moments are generated by it, rather than by my brain. > > Now ISTM that the UD will have an infinite number of possible programmes to > run, so even if it runs forever, how does it get on to the second step in > any of them? >
By dovetailing. Consider programs p[0], p[1], ... whose steps are p[i][0], p[i][1], etc Then run the steps as p[0][0], p[1][0], p[0][1], p[1][1], p[2][0], p[2][1], p[0][2], p[1][2], p[2][2], p[3][0], p[3][1], p[3][2], p[0][3], p[1][3], p[2][3], p[3][3], ... Other schemes are of course possible. Net result is that all steps of all programs are eventually executed. Cheers -- ---------------------------------------------------------------------------- Dr Russell Standish Phone 0425 253119 (mobile) Principal, High Performance Coders Visiting Senior Research Fellow hpco...@hpcoders.com.au Economics, Kingston University http://www.hpcoders.com.au ---------------------------------------------------------------------------- -- 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 everything-list+unsubscr...@googlegroups.com. To post to this group, send email to everything-list@googlegroups.com. Visit this group at https://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/d/optout.
