메뉴 건너뛰기




Volumn 5, Issue 1, 2000, Pages 798-801

Noise, physics, and non-Turing computation

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LEARNING SYSTEMS; PROBLEM SOLVING; QUANTUM THEORY; STATISTICAL MECHANICS; TURING MACHINES;

EID: 1642339781     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (2)

References (12)
  • 1
    • 35948974968 scopus 로고
    • A suggested interpretation of the quantum theory in terms of "hidden" variables
    • Bohm, D (1952), A suggested interpretation of the quantum theory in terms of "hidden" variables, Phys. Rev. 85, pp. 166-193.
    • (1952) Phys. Rev. , vol.85 , pp. 166-193
    • Bohm, D.1
  • 2
    • 0000954072 scopus 로고
    • An unsolvable problem of elementary number theory
    • Church, A (1936), An unsolvable problem of elementary number theory, American Journal of Mathematics 58, pp. 345-363.
    • (1936) American Journal of Mathematics , vol.58 , pp. 345-363
    • Church, A.1
  • 3
    • 0022421379 scopus 로고
    • Quantum theory, the Church-Turing principle and the universal quantum computer
    • Deutsch, D (1985), Quantum theory, the Church-Turing principle and the universal quantum computer, Proc. R. Soc, Lond. A 400, pp. 97-117.
    • (1985) Proc. R. Soc, Lond. A , vol.400 , pp. 97-117
    • Deutsch, D.1
  • 4
    • 84875672183 scopus 로고    scopus 로고
    • Cognition and the Computational Power of Connectionist Networks
    • Vancouver, Lawrence Erlbaum Assoc.
    • Hadley, R.F (1999), Cognition and the Computational Power of Connectionist Networks, Proc. 21st Ann. Conf. of the Cognitive Science Society, Vancouver, Lawrence Erlbaum Assoc.
    • (1999) Proc. 21st Ann. Conf. of the Cognitive Science Society
    • Hadley, R.F.1
  • 5
    • 0032156178 scopus 로고    scopus 로고
    • Why Gödel's Theorem Cannot Refute Computationalism
    • P J Hayes and K M Ford, September
    • LaForte, G (1998), P J Hayes and K M Ford, Why Gödel's Theorem Cannot Refute Computationalism, Artificial Intelligence 104 (1-2), pp. 265-286, September.
    • (1998) Artificial Intelligence , vol.104 , Issue.1-2 , pp. 265-286
    • LaForte, G.1
  • 6
    • 0000965389 scopus 로고    scopus 로고
    • Quantum computation over continuous variables
    • 22 February
    • Lloyd, S and S L Braunstein (1999), Quantum computation over continuous variables, Phys. Rev. Lett 82 (8), 22 February.
    • (1999) Phys. Rev. Lett , vol.82 , Issue.8
    • Lloyd, S.1    Braunstein, S.L.2
  • 7
    • 25044479054 scopus 로고    scopus 로고
    • Analog Neural Nets with Gaussian or other Common Noise Distributions cannot Recognize Arbitrary Regular Languages
    • Maass, W (1997), Analog Neural Nets with Gaussian or other Common Noise Distributions cannot Recognize Arbitrary Regular Languages, Electronic Colloquium on Computational Complexity Report TR97-052.
    • (1997) Electronic Colloquium on Computational Complexity Report , vol.TR97-052
    • Maass, W.1
  • 8
    • 0033621171 scopus 로고    scopus 로고
    • Noise shaping in populations of coupled model neurons
    • C C Chow, W Gerstner, R. W Adams, and J J Adams, August
    • Mar, D J (1999), C C Chow, W Gerstner, R. W Adams, and J J Adams, Noise shaping in populations of coupled model neurons, Proc. Natl. Acad. Sci. USA 96, pp. 10450-10455, August.
    • (1999) Proc. Natl. Acad. Sci. USA , vol.96 , pp. 10450-10455
    • Mar, D.J.1
  • 12
    • 84960561455 scopus 로고
    • On computable numbers, with an application to the Entscheidungsproblem
    • Turing, A M (1936), On computable numbers, with an application to the Entscheidungsproblem, Proc. London Mathematical Society, Series 2, 42, pp. 230-265.
    • (1936) Proc. London Mathematical Society, Series 2 , vol.42 , pp. 230-265
    • Turing, A.M.1


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