How we know what technology can do

Communications of the ACM

Volumn 44, Issue 11, 2001, Pages 82-88

  Burgin, Mark ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013067041     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/384150.384166     Document Type: Article

References (11)

1. Burgin, M. Super-recursive algorithms as a tool for high performance computing. In Proceedings of the High Performance Computing Symposium. (San Diego, Calif., 1999), 224–228.
2. Burgin, M. Topological algorithms. In Proceedings of 16th International Conference for Computers and Applications ISCA. (Seattle, WA, 2001), 61–64.
3. Cho, A. Hairpins trigger an automatic solution. Science 288 (2000). AAAS, Washington, D.C.
4. Deutsch, D., Ekert, A., and Lupacchini, R. Machines, logic and quantum physics. Bulletin of Symbolic Logic 6 (2000). Assoc. of Symbolic Logic, Poughkeepsie, NY, 265–283.
5. Dijkstra, E.W. The end of computing science? Commun. ACM 44, 3 (Mar. 2001), 92.
6. Goldin, D. and Wegner, P. Persistent Turing machines. Brown University Technical Report, 1998
7. Hamkins, J.D., and Lewis, A. Infinite time Turing machines. J. Symbolic Logic 65 (2000). Assoc. of Symbolic Logic, Poughkeepsie, NY, 567–604.
8. Moore, C. Recursion theory on the real- and continuous-time computation. Theoretical Computer Science 162 (1996), 23–44
9. Siegelman, H.T. Neural Networks and Analog Computation. Birkhauser, Berlin, 1999
10. Tsichritzis, D. Forget the past to win the future. Commun. ACM 44, 3 (Mar. 2001), 100–101.
11. Winograd, T. The design of interaction. Beyond Calculation: The Next 50 Years of Computing (1997) Copernicus, N.Y., 149–161