Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Concrete digital computation: What does it take for a physical system to compute?
Fresco N. Journal of Logic, Language and Information20 (4):513-537,2011.Type:Article
Date Reviewed: Jan 6 2012

The many accounts of digital computation “establish different (but not all irreducibly different) requirements for a physical system.” This paper addresses the physical meaning of digital computation. Instead of offering a new account of concrete computation, it gives two rather straightforward arguments: concrete digital computations entail nontrivial, distinct physical requirements, and computational frontiers are usually linked to Turing’s abstract formalism of computability, without concrete specifications. Surprisingly, philosophers and cognitive scientists ignore these arguments. The author states that “[he] shall remain neutral on whether cognition can indeed be fully explained computationally.”

For some reason, the paper does not compellingly exercise the so-called Church-Turing thesis. This may be due to its insufficient mathematical rigor, lending the unanswered computation-cognition question to engineering rather than a philosophical treatment. Informally, the Church-Turing thesis states that all reasonable computational models are algorithmically equivalent, differing only in performance. Apparently, cognition must rely on content-addressable memory with some intelligent resolution of multiple responses, such as in Google PageRank. The most suitable realization of such a scheme is through cloud computing.

Reviewer:  Simon Berkovich Review #: CR139749 (1205-0501)
Bookmark and Share
  Reviewer Selected
 
 
Computability Theory (F.1.1 ... )
 
 
Algorithms Implemented In Hardware (B.7.1 ... )
 
 
General (I.2.0 )
 
 
Models Of Computation (F.1.1 )
 
 
Modes Of Computation (F.1.2 )
 
Would you recommend this review?
yes
no
Other reviews under "Computability Theory": Date
Decidability of the purely existential fragment of the theory of term algebras
Venkataraman K. Journal of the ACM 34(2): 492-510, 1987. Type: Article
Jul 1 1988
Computability
Weihrauch K. (ed), Springer-Verlag New York, Inc., New York, NY, 1987. Type: Book (9789780387137216)
Nov 1 1988
Computability and logic: 3rd ed.
Boolos G., Jeffrey R., Cambridge University Press, New York, NY, 1989. Type: Book (9789780521380263)
Jul 1 1990
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy