On 3 June 2015 at 05:47, John Clark <[email protected]> wrote: > > On Mon, Jun 1, 2015 at 5:46 PM, LizR <[email protected]> wrote: > > > A Turing Machine is actually an *algorithm* >>>> >>> >>> Yes, a algorithm that is a set of instructions that explains how to >>> organize matter that obeys the laws of physics in such a way that it can >>> make any finite calculation. >>> >> >> > It doesn't explain how to organise matter - which is obvious from the >> fact that all sorts of systems can be Turing-universal, >> > > There are many ways to make a computer and Turing's 1936 paper said > nothing about the practicalities and engineering details, but he did prove > that the logical schematic of any computer can be reduced to something that > we now call a Turing Machine; but you can't make a calculation with just a > schematic, you need matter that obeys the laws of physics too. >
But not any specific arrangement. Hence it is contingent. -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/everything-list. For more options, visit https://groups.google.com/d/optout.
