1. David J. Chalmers (manuscript). Analog Vs. Digital Computation. .
    It is fairly well-known that certain hard computational problems (that is, 'difficult' problems for a digital processor to solve) can in fact be solved much more easily with an analog machine. This raises questions about the true nature of the distinction between analog and digital computation (if such a distinction exists). I try to analyze the source of the observed difference in terms of (1) expanding parallelism and (2) more generally, infinite-state Turing machines. The issue of discreteness vs continuity will also be touched upon, although it is not so important for analyzing these particular problems.
    Reading list   |  Discuss  |  Edit  |  Categorize  |  
     
    My bibliography  |
     
    Export citation | Scholar | At my library
    148 downloads  |  Added to index: 2009-01-28  |  Mark as duplicate  |  Remove from index  |  Revision history
    Bookmark and Share