메뉴 건너뛰기




Volumn 3394 LNAI, Issue , 2005, Pages 1-23

Gödel machines: Towards a technical justification of consciousness

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICALLY OPTIMAL; LOCAL MAXIMUM; OPTIMALITY; PROBLEM SOLVERS; PROOF SEARCH; SELF-REFERENCES; TECHNICAL JUSTIFICATION; UTILITY FUNCTIONS;

EID: 77649245309     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-32274-0_1     Document Type: Conference Paper
Times cited : (13)

References (57)
  • 3
    • 84926396434 scopus 로고
    • A machine-independent theory of the complexity of recursive functions
    • M. Blum. A machine-independent theory of the complexity of recursive functions. Journal of the ACM, 14(2):322-336, 1967.
    • (1967) Journal of the ACM , vol.14 , Issue.2 , pp. 322-336
    • Blum, M.1
  • 4
    • 0015038407 scopus 로고
    • Oneffective procedures for speeding up algorithms
    • M. Blum. Oneffective procedures for speeding up algorithms. Journal of theACM, 18(2):290-305, 1971.
    • (1971) Journal of theACM , vol.18 , Issue.2 , pp. 290-305
    • Blum, M.1
  • 5
    • 78649699122 scopus 로고
    • Über eine Eigenschaft des Inbegriffes aller reellen algebraischen Zahlen.
    • G. Cantor. Über eine Eigenschaft des Inbegriffes aller reellen algebraischen Zahlen. Crelle's Journal für Mathematik, 77:258-263, 1874.
    • (1874) Crelle's Journal für Mathematik , vol.77 , pp. 258-263
    • Cantor, G.1
  • 8
    • 0031915513 scopus 로고    scopus 로고
    • Consciousness and neuroscience
    • F. Crick and C. Koch. Consciousness and neuroscience. Cerebral Cortex, 8:97-107, 1998.
    • (1998) Cerebral Cortex , vol.8 , pp. 97-107
    • Crick, F.1    Koch, C.2
  • 9
    • 77649242231 scopus 로고    scopus 로고
    • M. C. Fitting. First-Order Logic and Automated Theorem Proving. Graduate Texts in Computer Science. Springer-Verlag, Berlin, 2nd edition, 1996.
    • M. C. Fitting. First-Order Logic and Automated Theorem Proving. Graduate Texts in Computer Science. Springer-Verlag, Berlin, 2nd edition, 1996.
  • 10
    • 34347193348 scopus 로고
    • Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I.
    • K. Gödel. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik, 38:173-198, 1931.
    • (1931) Monatshefte für Mathematik und Physik , vol.38 , pp. 173-198
    • Gödel, K.1
  • 11
    • 20844457712 scopus 로고
    • Über den anschaulichen Inhalt der quantentheoretischen Kinematik und Mechanik.
    • W. Heisenberg. Über den anschaulichen Inhalt der quantentheoretischen Kinematik und Mechanik. Zeitschrift für Physik, 33:879-893, 1925.
    • (1925) Zeitschrift für Physik , vol.33 , pp. 879-893
    • Heisenberg, W.1
  • 15
    • 84948126911 scopus 로고    scopus 로고
    • th European Conference on Machine Learning (ECML-2001), pages 226-238, 2001. (On J. Schmidhuber's SNF grant 20-61847).
    • th European Conference on Machine Learning (ECML-2001), pages 226-238, 2001. (On J. Schmidhuber's SNF grant 20-61847).
  • 16
    • 1642393842 scopus 로고    scopus 로고
    • The fastest and shortest algorithm for all well-defined problems
    • On J. Schmidhuber's SNF grant 20-61847
    • M. Hutter. The fastest and shortest algorithm for all well-defined problems. International Journal of Foundations of Computer Science, 13(3):431-443, 2002. (On J. Schmidhuber's SNF grant 20-61847).
    • (2002) International Journal of Foundations of Computer Science , vol.13 , Issue.3 , pp. 431-443
    • Hutter, M.1
  • 17
    • 84937417436 scopus 로고    scopus 로고
    • M. Hutter. Self-optimizing and Pareto-optimal policies in general environments based on Bayes-mixtures. In J. Kivinen and R. H. Sloan, editors, Proceedings of the 15th Annual Conference on Computational Learning Theory (COLT 2002), Lecture Notes in Artificial Intelligence, pages 364-379, Sydney, Australia, 2002. Springer. (On J. Schmidhuber's SNF grant 20-61847).
    • M. Hutter. Self-optimizing and Pareto-optimal policies in general environments based on Bayes-mixtures. In J. Kivinen and R. H. Sloan, editors, Proceedings of the 15th Annual Conference on Computational Learning Theory (COLT 2002), Lecture Notes in Artificial Intelligence, pages 364-379, Sydney, Australia, 2002. Springer. (On J. Schmidhuber's SNF grant 20-61847).
  • 18
    • 77649256311 scopus 로고    scopus 로고
    • M. Hutter. Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability. Springer, Berlin, 2004. (On J. Schmidhuber's SNF grant 20-61847).
    • M. Hutter. Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability. Springer, Berlin, 2004. (On J. Schmidhuber's SNF grant 20-61847).
  • 21
    • 0001902056 scopus 로고
    • Three approaches to the quantitative definition of information
    • A.N. Kolmogorov. Three approaches to the quantitative definition of information. Problems of Information Transmission, 1:1-11, 1965.
    • (1965) Problems of Information Transmission , vol.1 , pp. 1-11
    • Kolmogorov, A.N.1
  • 22
    • 0007915412 scopus 로고
    • Theory formation by heuristic search
    • D. Lenat. Theory formation by heuristic search. Machine Learning, 21, 1983.
    • (1983) Machine Learning , vol.21
    • Lenat, D.1
  • 23
    • 0000202647 scopus 로고
    • Universal sequential search problems
    • L. A. Levin. Universal sequential search problems. Problems of Information Transmission, 9(3):265-266, 1973.
    • (1973) Problems of Information Transmission , vol.9 , Issue.3 , pp. 265-266
    • Levin, L.A.1
  • 24
    • 0021404339 scopus 로고
    • Randomness conservation inequalities: Information and independence in mathematical theories
    • L. A. Levin. Randomness conservation inequalities: Information and independence in mathematical theories. Information and Control, 61:15-37, 1984.
    • (1984) Information and Control , vol.61 , pp. 15-37
    • Levin, L.A.1
  • 26
    • 0000507008 scopus 로고
    • Über Möglichkeiten im Relativkalkül.
    • L. Löwenheim. Über Möglichkeiten im Relativkalkül. Mathematische Annalen, 76:447-470, 1915.
    • (1915) Mathematische Annalen , vol.76 , pp. 447-470
    • Löwenheim, L.1
  • 30
    • 33749908081 scopus 로고
    • Classes of recursively enumerable sets and their decision problems
    • H. G. Rice. Classes of recursively enumerable sets and their decision problems. Trans. Amer. Math. Soc., 74:358-366, 1953.
    • (1953) Trans. Amer. Math. Soc , vol.74 , pp. 358-366
    • Rice, H.G.1
  • 31
    • 0001201756 scopus 로고
    • Some studies in machine learning using the game of checkers
    • A. L. Samuel. Some studies in machine learning using the game of checkers. IBM Journal on Research and Development, 3:210-229, 1959.
    • (1959) IBM Journal on Research and Development , vol.3 , pp. 210-229
    • Samuel, A.L.1
  • 33
    • 0000728324 scopus 로고
    • Reinforcement learning in Markovian and non-Markovian environments
    • D. S. Lippman, J. E. Moody, and D. S. Touretzky, editors, Morgan Kaufmann
    • J. Schmidhuber. Reinforcement learning in Markovian and non-Markovian environments. In D. S. Lippman, J. E. Moody, and D. S. Touretzky, editors, Advances in Neural Information Processing Systems 3 (NIPS 3), pages 500-506. Morgan Kaufmann, 1991.
    • (1991) Advances in Neural Information Processing Systems 3 (NIPS 3) , pp. 500-506
    • Schmidhuber, J.1
  • 35
    • 0345161979 scopus 로고
    • On learning how to learn learning strategies. Technical Report FKI-198-94, Fakultät für Informatik, Technische Universität München
    • See [49, 47
    • J. Schmidhuber. On learning how to learn learning strategies. Technical Report FKI-198-94, Fakultät für Informatik, Technische Universität München, 1994. See [49, 47].
    • (1994)
    • Schmidhuber, J.1
  • 36
    • 85152633484 scopus 로고
    • Discovering solutions with low Kolmogorov complexity and high generalization capability
    • A. Prieditis and S. Russell, editors, Morgan Kaufmann Publishers, San Francisco, CA
    • J. Schmidhuber. Discovering solutions with low Kolmogorov complexity and high generalization capability. In A. Prieditis and S. Russell, editors, Machine Learning: Proceedings of the Twelfth International Conference, pages 488-496. Morgan Kaufmann Publishers, San Francisco, CA, 1995.
    • (1995) Machine Learning: Proceedings of the Twelfth International Conference , pp. 488-496
    • Schmidhuber, J.1
  • 37
    • 0041644968 scopus 로고    scopus 로고
    • Acomputer scientist's viewof life, the universe, and everything
    • C. Freksa, M. Jantzen, and R. Valk, editors, Foundations of Computer Science: Potential, Theory, Cognition, Springer, Berlin
    • J. Schmidhuber.Acomputer scientist's viewof life, the universe, and everything. In C. Freksa, M. Jantzen, and R. Valk, editors, Foundations of Computer Science: Potential - Theory - Cognition, volume 1337, pages 201-208. Lecture Notes in Computer Science, Springer, Berlin, 1997.
    • (1997) Lecture Notes in Computer Science , vol.1337 , pp. 201-208
    • Schmidhuber, J.1
  • 38
    • 0031194381 scopus 로고    scopus 로고
    • Discovering neural nets with low Kolmogorov complexity and high generalization capability
    • J. Schmidhuber. Discovering neural nets with low Kolmogorov complexity and high generalization capability. Neural Networks, 10(5):857-873, 1997.
    • (1997) Neural Networks , vol.10 , Issue.5 , pp. 857-873
    • Schmidhuber, J.1
  • 39
    • 77649253560 scopus 로고    scopus 로고
    • J. Schmidhuber. Algorithmic theories of everything. Technical Report IDSIA-20-00, quantph/ 0011122, IDSIA, Manno (Lugano), Switzerland, 2000. Sections 1-5: see [40]; Section 6: see [41].
    • J. Schmidhuber. Algorithmic theories of everything. Technical Report IDSIA-20-00, quantph/ 0011122, IDSIA, Manno (Lugano), Switzerland, 2000. Sections 1-5: see [40]; Section 6: see [41].
  • 40
    • 1642358077 scopus 로고    scopus 로고
    • Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit
    • J. Schmidhuber. Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit. International Journal of Foundations of Computer Science, 13(4):587-612, 2002.
    • (2002) International Journal of Foundations of Computer Science , vol.13 , Issue.4 , pp. 587-612
    • Schmidhuber, J.1
  • 41
    • 84937439050 scopus 로고    scopus 로고
    • The Speed Prior: A newsimplicity measure yielding near-optimal computable predictions
    • J. Kivinen and R. H. Sloan, editors, Proceedings of the 15th Annual Conference on Computational Learning Theory COLT 2002, Springer, Sydney, Australia
    • J. Schmidhuber. The Speed Prior: a newsimplicity measure yielding near-optimal computable predictions. In J. Kivinen and R. H. Sloan, editors, Proceedings of the 15th Annual Conference on Computational Learning Theory (COLT 2002), Lecture Notes in Artificial Intelligence, pages 216-228. Springer, Sydney, Australia, 2002.
    • (2002) Lecture Notes in Artificial Intelligence , pp. 216-228
    • Schmidhuber, J.1
  • 42
    • 84898985714 scopus 로고    scopus 로고
    • Bias-optimal incremental problem solving
    • S. Becker, S. Thrun, and K. Obermayer, editors, Cambridge, MA, MIT Press
    • J. Schmidhuber. Bias-optimal incremental problem solving. In S. Becker, S. Thrun, and K. Obermayer, editors, Advances in Neural Information Processing Systems 15 (NIPS 15), pages 1571-1578, Cambridge, MA, 2003. MIT Press.
    • (2003) Advances in Neural Information Processing Systems 15 (NIPS 15) , pp. 1571-1578
    • Schmidhuber, J.1
  • 43
    • 77649256699 scopus 로고    scopus 로고
    • J. Schmidhuber. Gödel machines: self-referential universal problem solvers making provably optimal self-improvements. Technical Report IDSIA-19-03, arXiv:cs.LO/0309048, IDSIA, Manno-Lugano, Switzerland, 2003.
    • J. Schmidhuber. Gödel machines: self-referential universal problem solvers making provably optimal self-improvements. Technical Report IDSIA-19-03, arXiv:cs.LO/0309048, IDSIA, Manno-Lugano, Switzerland, 2003.
  • 45
    • 77649248869 scopus 로고    scopus 로고
    • Gödel machines: Fully self-referential optimal universal self-improvers
    • B. Goertzel and C. Pennachin, editors, Springer, in press
    • J. Schmidhuber. Gödel machines: Fully self-referential optimal universal self-improvers. In B. Goertzel and C. Pennachin, editors, Real AI: New Approaches to Artificial General Intelligence. Springer, in press, 2004.
    • (2004) Real AI: New Approaches to Artificial General Intelligence
    • Schmidhuber, J.1
  • 46
    • 1642328943 scopus 로고    scopus 로고
    • Optimal ordered problem solver
    • J. Schmidhuber. Optimal ordered problem solver. Machine Learning, 54:211-254, 2004.
    • (2004) Machine Learning , vol.54 , pp. 211-254
    • Schmidhuber, J.1
  • 47
    • 0000156236 scopus 로고    scopus 로고
    • Reinforcement learning with self-modifying policies
    • S. Thrun and L. Pratt, editors, Kluwer
    • J. Schmidhuber, J. Zhao, and N. Schraudolph. Reinforcement learning with self-modifying policies. In S. Thrun and L. Pratt, editors, Learning to learn, pages 293-309. Kluwer, 1997.
    • (1997) Learning to learn , pp. 293-309
    • Schmidhuber, J.1    Zhao, J.2    Schraudolph, N.3
  • 48
    • 0008010287 scopus 로고    scopus 로고
    • Simple principles of metalearning
    • Technical Report IDSIA-69-96, IDSIA, 1996. See [49, 47
    • J. Schmidhuber, J. Zhao, and M. Wiering. Simple principles of metalearning. Technical Report IDSIA-69-96, IDSIA, 1996. See [49, 47].
    • Schmidhuber, J.1    Zhao, J.2    Wiering, M.3
  • 49
    • 0031186687 scopus 로고    scopus 로고
    • Shifting inductive bias with success-story algorithm, adaptive Levin search, and incremental self-improvement
    • J. Schmidhuber, J. Zhao, and M.Wiering. Shifting inductive bias with success-story algorithm, adaptive Levin search, and incremental self-improvement. Machine Learning, 28:105-130, 1997.
    • (1997) Machine Learning , vol.28 , pp. 105-130
    • Schmidhuber, J.1    Zhao, J.2    Wiering, M.3
  • 50
    • 0004070712 scopus 로고
    • Logisch-kombinatorische Untersuchungen über Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theorem über dichte Mengen
    • T. Skolem. Logisch-kombinatorische Untersuchungen über Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theorem über dichte Mengen. Skrifter utgit av Videnskapsselskapet in Kristiania, I, Mat.-Nat. Kl., N4:1-36, 1919.
    • (1919) Skrifter utgit av Videnskapsselskapet in Kristiania, I, Mat.-Nat. Kl , Issue.N4 , pp. 1-36
    • Skolem, T.1
  • 51
    • 4544279425 scopus 로고
    • A formal theory of inductive inference. Part I
    • R.J. Solomonoff. A formal theory of inductive inference. Part I. Information and Control, 7:1-22, 1964.
    • (1964) Information and Control , vol.7 , pp. 1-22
    • Solomonoff, R.J.1
  • 55
    • 84960561455 scopus 로고    scopus 로고
    • On computable numbers, with an application to the Entscheidungsproblem
    • Series 2
    • A. M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Series 2, 41:230-267, 1936.
    • Proceedings of the London Mathematical Society , vol.41 , Issue.230-267 , pp. 1936
    • Turing, A.M.1


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