Friday, 9 March 2012
Disembodied machines
“What was clearly new about the Turing model of computation was its successful disembodiment of the machine. For practical purposes, this was not as complete as the post-Turing theoretician likes to pretend: the reembodied computer that is now a familiar feature of the modern world was hard won by pioneering engineers. But, for the purposes of the stored program computer, and for the proof of incomputability of the halting set, the essential disembodiment was that delivering program-data duality. This playing down of distinction between information and process has been taken further, and become a familiar feature of programming and theory.” - Cooper, S.B., 2012. Turing's Titanic Machine? Communications of the ACM, 55(3), p.74.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment
Thank you so much for your comment. Unfortunately, some people have tried to add comments to sell things and, moreover, have nothing to do with the post. I am sure you would never do that, but to ensure that your comment is relevant, it will be reviewed by a human before appearing on the blog.