On Fri, Jul 19, 2019 at 1:33 PM Telmo Menezes <te...@telmomenezes.net> wrote:
> *How do you decide if something is a Turing Machine or not? * X is a Turing Machine if and only if for any given input to X there exists a Turing Machine that will produce the same output as X does with the same input. *> Is Domino a Turing Machine? * A Domino computer is. *> What about my brain?* It's a Turing Machine. > *What about the billiard ball computer?* It's a Turing Machine. *> The only equivalence used in Computer Science is in completeness: Van > Neumann Machines and GPUs are Turing Complete, in the sense that they are > as general a computational device as a Turing Machine.* > Only?! If X is Turing Complete then a Turing Machine can emulate X and X can emulate a Turing Machine. *> I never heard or read anyone before claiming that Turing Machines are > physically more fundamental, * > Do you know of anything simpler that can make calculations than read a square, erase what you read and then print either a 0 or a 1 on it depending on your state, then change into another state depending on what you read, then either halt or move right or left and read another square. John K Clark > > -- 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 view this discussion on the web visit https://groups.google.com/d/msgid/everything-list/CAJPayv2HL22OknRKijRMMjfFS5hBvq7r0eWpyEAhK1QuOC3jgA%40mail.gmail.com.
