On Mon, Aug 2, 2010 at 7:21 AM, Jim Bromer <[email protected]> wrote:
> I see that erasure is from an alternative definition for a Turing Machine. > I am not sure if a four state Turing Machine could be used to > make Solomonoff Induction convergent. If all programs that required working > memory greater than the length of the output string could be eliminated then > that would have an impact on convergent feasibility. > But then again this is getting back to my whole thesis. By constraining the definition of "all possible programs" sufficiently, we should be left with a definable subset of programs that could be used in an actual computations. I want to study more to try to better understand Abrams definition of a convergent derivation of Solomonoff Induction. Jim Bromer ------------------------------------------- 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
