메뉴 건너뛰기




Volumn 46, Issue 4, 2003, Pages 100-102

Computation beyond turing machines

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL STRENGTH; COMPUTER MODEL; GROUP THEORY; TURNING MACHINES;

EID: 0347442145     PISSN: 00010782     EISSN: None     Source Type: Journal    
DOI: 10.1145/641205.641235     Document Type: Review
Times cited : (69)

References (11)
  • 1
    • 4243084116 scopus 로고
    • Association for computing machinery. Curriculum '68: Recommendations for academic programs in computer science
    • ACM, NY
    • Association for Computing Machinery. Curriculum '68: Recommendations for academic programs in computer science. In ACM Curricula. Recommendations for Computer Science. ACM, NY, 1968.
    • (1968) ACM Curricula. Recommendations for Computer Science
  • 3
    • 0009737277 scopus 로고
    • On formally undecidable propositions of principia mathematica and related systems
    • in German
    • Gödel, K. On formally undecidable propositions of principia mathematica and related systems. Monatshefte fur Mathematik und Physik 38 1931 (in German); English translation in M. Davis, Ed., The Undecidable. Raven Press 1965.
    • (1931) Monatshefte fur Mathematik und Physik , vol.38
    • Gödel, K.1
  • 4
    • 0003983574 scopus 로고
    • English translation Raven Press
    • Gödel, K. On formally undecidable propositions of principia mathematica and related systems. Monatshefte fur Mathematik und Physik 38 1931 (in German); English translation in M. Davis, Ed., The Undecidable. Raven Press 1965.
    • (1965) The Undecidable
    • Davis, M.1
  • 6
    • 0027353881 scopus 로고
    • Elements of interaction (turing award lecture)
    • Jan.
    • Milner, R. Elements of interaction (Turing Award lecture). Commun. ACM 36, 1 (Jan. 1993).
    • (1993) Commun. ACM , vol.36 , pp. 1
    • Milner, R.1
  • 8
    • 0001602510 scopus 로고
    • On computable numbers with an application to the Entscheidungsproblem
    • Turing, A. On computable numbers with an application to the Entscheidungsproblem. In Proceedings of the London Math Society 2, 42, 1936.
    • (1936) Proceedings of the London Math Society , vol.2 , pp. 42
    • Turing, A.1
  • 9
    • 0040403007 scopus 로고
    • Intelligent machinery
    • D.C. Ince, Ed., North-Holland
    • Turing, A. Intelligent machinery. In D.C. Ince, Ed., Mechanical Intelligence, North-Holland, 1992.
    • (1992) Mechanical Intelligence
    • Turing, A.1
  • 10
    • 0002470168 scopus 로고    scopus 로고
    • The Turing machine paradigm in contemporary computing
    • B. Enquist and W. Schmidt, Eds., LNCS, Springer-Verlag
    • van Leeuwen, J. and Wiedermann, J. The Turing machine paradigm in contemporary computing. In B. Enquist and W. Schmidt, Eds., Mathematics Unlimited - 2001 and Beyond. LNCS, Springer-Verlag, 2000.
    • (2000) Mathematics Unlimited - 2001 and Beyond
    • Van Leeuwen, J.1    Wiedermann, J.2
  • 11
    • 0031144006 scopus 로고    scopus 로고
    • Why interaction is more powerful than algorithms
    • May
    • Wegner, P. Why interaction is more powerful than algorithms. Commun. ACM 40, 5 (May 1997).
    • (1997) Commun. ACM , vol.40 , pp. 5
    • Wegner, P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.