메뉴 건너뛰기




Volumn 2055 LNCS, Issue , 2001, Pages 288-299

On the computational power of a continuous-space optical model of computation

Author keywords

[No Author keywords available]

Indexed keywords

MICROCONTROLLERS; OPTICAL DATA PROCESSING;

EID: 23044527694     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45132-3_20     Document Type: Conference Paper
Times cited : (16)

References (11)
  • 1
    • 0028496407 scopus 로고
    • Computability with low-dimensional dynamical systems
    • P. Koiran, M. Cosnard, and M. Garzon. Computability with low-dimensional dynamical systems. Theoretical Computer Science, 132(1-2):113-128, 1994.
    • (1994) Theoretical Computer Science , vol.132 , Issue.1-2 , pp. 113-128
    • Koiran, P.1    Cosnard, M.2    Garzon, M.3
  • 2
    • 0004165618 scopus 로고
    • Computation: Finite and infinite machines
    • Prentice Hall, Englewood Cliffs, New Jersey
    • M. L. Minsky. Computation: Finite and Infinite Machines. Series in Automatic Computation. Prentice Hall, Englewood Cliffs, New Jersey, 1967.
    • (1967) Series in Automatic Computation
    • Minsky, M.L.1
  • 4
    • 0033690369 scopus 로고    scopus 로고
    • A model of computation for Fourier optical processors
    • Quebec, June
    • T. J. Naughton. A model of computation for Fourier optical processors. In Optics in Computing 2000, Proc. SPIE vol. 4089, pp. 24-34, Quebec, June 2000.
    • (2000) Optics in Computing 2000, Proc. SPIE , vol.4089 , pp. 24-34
    • Naughton, T.J.1
  • 5
    • 0034514808 scopus 로고    scopus 로고
    • Continuous-space model of computation is Turing universal
    • San Diego, California, August
    • T. J. Naughton. Continuous-space model of computation is Turing universal. In Critical Technologies for the Future of Computing, Proc. SPIE vol. 4109, pp. 121-128, San Diego, California, August 2000.
    • (2000) Critical Technologies for the Future of Computing, Proc. SPIE , vol.4109 , pp. 121-128
    • Naughton, T.J.1
  • 6
    • 11744322095 scopus 로고    scopus 로고
    • Conditional branching is not necessary for universal computation in von Neumann computers
    • R. Rojas. Conditional branching is not necessary for universal computation in von Neumann computers. J. Universal Computer Science, 2(11):756-768, 1996.
    • (1996) J. Universal Computer Science , vol.2 , Issue.11 , pp. 756-768
    • Rojas, R.1
  • 8
    • 84960561455 scopus 로고
    • On computable numbers, with an application to the Entscheidungsproblem
    • A. M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society ser. 2, 42(2):230-265, 1936.
    • (1936) Proceedings of the London Mathematical Society Ser. 2 , vol.42 , Issue.2 , pp. 230-265
    • Turing, A.M.1
  • 9
    • 0001602511 scopus 로고
    • Correction in vol. 43, pp. 544-546, 1937.
    • (1937) Correction , vol.43 , pp. 544-546
  • 11
    • 85062122079 scopus 로고    scopus 로고
    • On the relationship between computational models and scientific theories
    • National University of Ireland, Maynooth, Ireland, February
    • D. Woods and J. P. Gibson. On the relationship between computational models and scientific theories. Technical Report NUIM-CS-TR-2001-05, National University of Ireland, Maynooth, Ireland, February 2001.
    • (2001) Technical Report NUIM-CS-TR-2001-05
    • Woods, D.1    Gibson, J.P.2


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