메뉴 건너뛰기




Volumn 13, Issue 1, 2003, Pages 103-114

Neural and super-Turing computing

Author keywords

Analog computation; Chaos; Computational theory; Dynamical systems; Neuron

Indexed keywords

ALGORITHMS; CHAOS THEORY; COMPUTER SCIENCE; CONSTRAINT THEORY; DATA MINING; NEURAL NETWORKS;

EID: 0037316681     PISSN: 09246495     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021376718708     Document Type: Article
Times cited : (62)

References (24)
  • 1
    • 0031190762 scopus 로고    scopus 로고
    • Computational power of neural networks: A characterization in terms of kolmogorov complexity
    • Balcázar, J.L., Gavaldà, R. and Siegelmann, H.T. (1997), 'Computational Power of Neural Networks: A Characterization in Terms of Kolmogorov Complexity', IEEE Transactions on Information Theory 43(4), pp. 1175-1183.
    • (1997) IEEE Transactions on Information Theory , vol.43 , Issue.4 , pp. 1175-1183
    • Balcázar, J.L.1    Gavaldà, R.2    Siegelmann, H.T.3
  • 2
    • 84968516134 scopus 로고
    • On a theory of computation and complexity over the real numbers: NP completeness, recursive functions, and universal machines
    • Blum, L., Shub, M. and Smale, S. (1989), 'On a Theory of Computation and Complexity Over the Real Numbers: NP Completeness, Recursive Functions, and Universal Machines,' Bull. A.M.S. 21, pp. 1-46.
    • (1989) Bull. A.M.S. , vol.21 , pp. 1-46
    • Blum, L.1    Shub, M.2    Smale, S.3
  • 3
    • 0002691913 scopus 로고    scopus 로고
    • Narrow versus wide mechanism
    • Copeland, B.J. (2000), 'Narrow Versus Wide Mechanism', Journal of Philosophy 97, pp. 5-32.
    • (2000) Journal of Philosophy , vol.97 , pp. 5-32
    • Copeland, B.J.1
  • 4
    • 0033116551 scopus 로고    scopus 로고
    • Alan turing's forgotten ideas in computer science
    • Copeland, B.J. and Proudfoot, D. (1999), 'Alan Turing's Forgotten Ideas in Computer Science', Scientific American 280, pp. 99-103.
    • (1999) Scientific American , vol.280 , pp. 99-103
    • Copeland, B.J.1    Proudfoot, D.2
  • 5
    • 0021835689 scopus 로고
    • Neural computation of decisions in optimization problems
    • Hopfield, J.J. and Tank, D.W. (1985), 'Neural Computation of Decisions in Optimization Problems', Biological Cybernetics 52, pp. 141-152.
    • (1985) Biological Cybernetics , vol.52 , pp. 141-152
    • Hopfield, J.J.1    Tank, D.W.2
  • 6
    • 0000517449 scopus 로고
    • Turing machines that take advice
    • Karp, R.M. and Lipton, R. (1982), 'Turing Machines That Take Advice', Enseignment Mathematique 28, pp. 191-209.
    • (1982) Enseignment Mathematique , vol.28 , pp. 191-209
    • Karp, R.M.1    Lipton, R.2
  • 7
    • 0030226192 scopus 로고    scopus 로고
    • Reafference and attractors in the olfactory system during odor recognition
    • Kay, L.M., Lancaster, L.R. and Freeman, W.J. (1996), 'Reafference and Attractors in the Olfactory System During Odor Recognition', International Journal of Neural Systems 7(4), pp. 489-495.
    • (1996) International Journal of Neural Systems , vol.7 , Issue.4 , pp. 489-495
    • Kay, L.M.1    Lancaster, L.R.2    Freeman, W.J.3
  • 9
    • 0010716015 scopus 로고    scopus 로고
    • Networks of spiking neurons: The third generation of neural network models
    • Maass, W. (1996), 'Networks of Spiking Neurons: The Third Generation of Neural Network Models', Electronic Colloquium on Computational Complexity (ECCC) 3 (031).
    • (1996) Electronic Colloquium on Computational Complexity (ECCC) , vol.3 , Issue.31
    • Maass, W.1
  • 11
    • 0000416563 scopus 로고    scopus 로고
    • A survey of continuous-time computation theory
    • in D.-Z. Du and K.-I Ko, eds; Dordrecht: Kluwer Academic Publishers
    • Orponen, P. (1997), 'A Survey of Continuous-Time Computation Theory,' in D.-Z. Du and K.-I Ko, eds, Advances in Algorithms, Languages, and Complexity, Dordrecht: Kluwer Academic Publishers, pp. 209-224.
    • (1997) Advances in Algorithms, Languages, and Complexity , pp. 209-224
    • Orponen, P.1
  • 13
    • 84967792518 scopus 로고
    • Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers)
    • Pour-El, M.B. (1974), 'Abstract Computability and its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)', Transactions of the American Mathematical Society 199, pp. 1-29.
    • (1974) Transactions of the American Mathematical Society , vol.199 , pp. 1-29
    • Pour-El, M.B.1
  • 14
    • 0022471098 scopus 로고
    • Learning representations by back-propagating errors
    • Rumelhart, D.E., Hinton, G.E. and Williams, R.J. (1986), 'Learning Representations by Back-Propagating Errors', Nature 323, pp. 533-536.
    • (1986) Nature , vol.323 , pp. 533-536
    • Rumelhart, D.E.1    Hinton, G.E.2    Williams, R.J.3
  • 16
    • 0001547435 scopus 로고
    • Computation beyond the turing limit
    • Siegelmann, H.T. (1995), 'Computation Beyond the Turing Limit', Science 238(28), pp. 632-637.
    • (1995) Science , vol.238 , Issue.28 , pp. 632-637
    • Siegelmann, H.T.1
  • 18
    • 0001255172 scopus 로고    scopus 로고
    • Stochastic analog networks and computational complexity
    • Siegelmann, H.T. (1999), 'Stochastic Analog Networks and Computational Complexity', Journal of Complexity 15(4), pp. 451-475.
    • (1999) Journal of Complexity , vol.15 , Issue.4 , pp. 451-475
    • Siegelmann, H.T.1
  • 19
    • 0013060516 scopus 로고    scopus 로고
    • Neural automata and analog computational complexity
    • in M.A. Arbib, ed., 2nd edition; Cambridge, MA: MIT Press, in press
    • Siegelmann, H.T. (2002), 'Neural Automata and Analog Computational Complexity', in M.A. Arbib, ed., 2nd edition, The Handbook of Brain Theory and Neural Networks, Cambridge, MA: MIT Press, in press.
    • (2002) The Handbook of Brain Theory and Neural Networks
    • Siegelmann, H.T.1
  • 20
    • 0001548590 scopus 로고    scopus 로고
    • Computational complexity for continuous time dynamics
    • (Full version to appear in Journal of Complexity)
    • Siegelmann, H.T., Ben-Hur, A. and Fishman, S. (1999), 'Computational Complexity for continuous Time Dynamics,' Physical Review Letters 83(7), pp. 1463-1466 (Full version to appear in Journal of Complexity).
    • (1999) Physical Review Letters , vol.83 , Issue.7 , pp. 1463-1466
    • Siegelmann, H.T.1    Ben-Hur, A.2    Fishman, S.3
  • 21
    • 0032166225 scopus 로고    scopus 로고
    • Computation by dynamical systems
    • Siegelmann H.T. and Fishman S. (1998), 'Computation by Dynamical Systems,' Physica D 120, pp. 214-235
    • (1998) Physica D , vol.120 , pp. 214-235
    • Siegelmann, H.T.1    Fishman, S.2


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