On Sat, Jul 24, 2010 at 3:59 PM, Jim Bromer <jimbro...@gmail.com> wrote:
> Solomonoff Induction may require a trans-infinite level of complexity just > to run each program. Suppose each program is iterated through the > enumeration of its instructions. Then, not only do the infinity of > possible programs need to be run, many combinations of the infinite programs > from each simulated Turing Machine also have to be tried. All the > possible combinations of (accepted) programs, one from any two or more of > the (accepted) programs produced by each simulated Turing Machine, have to > be tried. Although these combinations of programs from each of the > simulated Turing Machine may not all be unique, they all have to be tried. > Since each simulated Turing Machine would produce infinite programs, I am > pretty sure that this means that Solmonoff Induction is, *by > definition,*trans-infinite. > Jim Bromer > All the possible combinations of (accepted) programs, one program taken from any two or more simulated Turing Machines, have to be tried. Since each simulated Turing Machine would produce infinite programs and there are infinite simulated Turing Machines, I am pretty sure that this means that Solmonoff Induction is, *by definition,* trans-infinite. ------------------------------------------- agi Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: https://www.listbox.com/member/?member_id=8660244&id_secret=8660244-6e7fb59c Powered by Listbox: http://www.listbox.com
