On 08/10/2007, Richard Loosemore <[EMAIL PROTECTED]> wrote: > William Pearson wrote: > > On 07/10/2007, Richard Loosemore <[EMAIL PROTECTED]> wrote: > >> William Pearson wrote: > >>> On 07/10/2007, Richard Loosemore <[EMAIL PROTECTED]> wrote: > > > >> The TM implementation not only has no relevance to the behavior of > >> GoL(-T) at all, it also has even less relevance to the particular claims > >> that I made about GoL (or GoL(-T)). > >> > >> If you think the TM implementation does impact it, you should > >> demonstrate exactly how. > > > > The TM implementation has no impact *itself* to any claims, and its > > removal equally has no bearing on the properties of the whole system. > > The impact it does have is to demonstrate the system it is implemented > > in is Turing Complete. Or computationally universal if you wish to > > avoid say the word Turing. > > > > Lets say I implemented a TM on my laptop, and then had my operating > > system disallow that program to be run. Would it stop my laptop being > > computationally universal, and all that entails about its > > predictability? Nope, because the computational universality doesn't > > rest on that implementation, it is merely demonstrated by it. > > Well, I have to say that you have made a valiant effort to defend the > idea, but nothing seems to be working. > > You argue that Game of Life is Turing Complete even when we exclude all > the cases in which the initial cells are arranged to make a Turing > Machine. You then try to justify this strange idea with an analogy. > > But in your analogy, you surrepticiously insert a system that is ALREADY > a Turing Machine at the base level (your laptop) and then you implement > ANOTHER Turing Machine on top of that one (your TM program running on > the laptop). This is a false analogy.
Laptops aren't TMs. They have random access memory, registers, program counters not a tape and 5-tuple instructions. They are computationally universal, but that is all they share with TMs (as does the GoL). Please read the wiki entry to see that my laptop isn't a TM. http://en.wikipedia.org/wiki/Turing_machine Will Pearson ----- This list is sponsored by AGIRI: http://www.agiri.org/email To unsubscribe or change your options, please go to: http://v2.listbox.com/member/?member_id=8660244&id_secret=51203540-99609d
