skip to main content
article
Free Access

How we know what technology can do

Authors Info & Claims
Published:01 November 2001Publication History
First page image

References

  1. 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.Google ScholarGoogle Scholar
  2. 2 Burgin, M. Topological algorithms. In Proceedings of 16th International Conference for Computers and Applications ISCA. (Seattle, WA, 2001), 61-64.Google ScholarGoogle Scholar
  3. 3 Cho, A. Hairpins trigger an automatic solution. Science 288 (2000). AAAS, Washington, D.C.Google ScholarGoogle Scholar
  4. 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.Google ScholarGoogle Scholar
  5. 5 Dijkstra, E.W. The end of computing science? Commun. ACM 44, 3 (Mar. 2001), 92. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Goldin, D. and Wegner, P. Persistent Turing machines. Brown University Technical Report, 1998Google ScholarGoogle Scholar
  7. 7 Hamkins, J.D., and Lewis, A. Infinite time Turing machines. J. Symbolic Logic 65 (2000). Assoc. of Symbolic Logic, Poughkeepsie, NY, 567-604.Google ScholarGoogle Scholar
  8. 8 Moore, C. Recursion theory on the real- and continuous-time computation. Theoretical Computer Science 162 (1996), 23-44 Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Siegelman, H.T. Neural Networks and Analog Computation. Birkhauser, Berlin, 1999 Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 Tsichritzis, D. Forget the past to win the future. Commun. ACM 44, 3 (Mar. 2001), 100-101. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Winograd, T. The design of interaction. Beyond Calculation: The Next 50 Years of Computing (1997) Copernicus, N.Y.,149-161 Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. How we know what technology can do

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image Communications of the ACM
      Communications of the ACM  Volume 44, Issue 11
      Nov. 2001
      96 pages
      ISSN:0001-0782
      EISSN:1557-7317
      DOI:10.1145/384150
      Issue’s Table of Contents

      Copyright © 2001 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 November 2001

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format .

    View HTML Format