Can Ai Be Intelligent?
References
- Aaronson, S. (2005, March). NP-complete problems and physical reality. ACM SIGACT News 36(1), 30-52. Retrieved from www.scottaaronson.com/papers/npcomplete.pdf (viewed October 31, 2016).
- Aaronson, S.(2006). Quantum computing since Democritus. Retrieved from http://www.scottaaronson.com/democritus/ (viewed October 31, 2016) (Lecture notes, Fall 2006).
- Barr, C. P., A. & Feigenbaum, E. (Eds.). (1981-84). Handbook of artificial intelligence (Vols. 1-4). Los Altos, CA: William Kaufmann.
- Baum, E. B. (2006). What is thought? (Revised edition ed.). Cambridge MA: MIT Press.
- Bostrom, N. (2014). Superintelligence: Paths, dangers, strategies. Oxford: Oxford University Press.
- Bozulich, R. (2015). Chess and go: A comparison. Chigasaki, Japan: Kiseido Publishing Company.
- Chaitin, G. J.(2010). Metabiology: Life as evolving software. Retrieved from https://www.cs.auckland.ac.nz/~chaitin/metabiology.pdf
- Cobham, A. (1965). The intrinsic computational difficulty of functions In Proceedings of the Third International Congress for Logic, Methodology, and the Philosophy of Science (pp. 24-30). Amsterdam: North Holland.
- Cook, S.(1971). The complexity of theorem proving procedures. Proceedings of the Third Annual ACM Symposium on Theory of Computing, 151-158.
- Cook, S. (2006). The P versus NP problem. In J. A. James A. Carlson, A. Jaffe, & A. Wiles (Eds.), The millennium prize problems (pp. 87-106). Cambridge Mass.; Providence Rhode Island: Clay Mathematics Institute, American Mathematical Society. Retrieved from www.claymath.org/sites/default/files/pvsnp.pdf (viewed October 31, 2016)
- Copeland, J. B. (1998). Turing’s O-machines, Penrose, Searle, and the brain. Analysis, 58, 128-138.
- Copeland, J. B. (1999). Alan Turing’s forgotten ideas in computer science. Scientific American, 253(4).
- Copeland, J. B. (2015). The Church-Turing thesis. In E. N. Zalta (Ed.), The Stanford encyclopedia of philosophy Summer 2015 (ed.). http://plato.stanford.edu/archives/sum2015/entries/church-turing/ (viewed October 31, 2016).
- Davis, E. & Marcus, G. (2015). Commonsense reasoning and commonsense knowledge in artificial intelligence. Communications of the ACM, 58(9), 92-103. doi: 10.1145/2701413
- Davis, M. (Ed). (1965). The undecidable: Basic papers on undecidable propositions, unsolvable problems, and computable functions (1965, 2004 ed.). Hewlett, N.Y.: Raven Press. (An anthology of fundamental papers on undecidability and unsolvability, this classic reference opens with Gödel’s landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by Gödel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. 1965 edition.)
- Davis, M. (1982). Why Gödel didn’t have Church’ Thesis. Information and Control, 54, 3-24.
- Davis, M. (2001). Engines of logic. Mathematicians and the origin of the computer. New York: W. W. Norton & Company.
- Davis, M. (2004). The myth of hypercomputation. In C. Teuscher (Ed.), Alan Turing: Life and legacy of a great thinker. Turing Festschrift. Berlin, Heidelberg: Springer-Verlag. Retrieved from https://www.researchgate.net/publication/243784599 doi: 10.1007/978-3-662-05642-4 8
- Davis, M. (2006). Why there is no such discipline as hypercomputation Applied Mathematics and Computation, 178, 4-7.
- Dean,W. (2016). Computational complexity theory. In E. N. Zalta (Ed.), The Stanford encyclopedia of philosophy (Winter 2016 ed.). http://plato.stanford.edu/archives/win2016/entries/computational-complexity/ (viewed October 31, 2016).
- Eddington, A. S. (1948). The nature of the physical world (Electronic edition 2007 ed.; R. C. Henry, Ed.). Cambridge: Cambridge at the university press. Retrieved from henry.pha.jhu.edu/Eddington.2008.pdf (viewed October 31, 2016).
- Edmonds, J. (1965a). Minimum partition of a matroid into independent subsets. Journal of Reaserch of the National Bureau of Standards-B. Mathematics and Mathematical Physics, 69, 67-72.
- Edmonds, J. (1965b). Paths, trees, and flowers. Canadian Journal of Mathematics, 17(3), 449-467.
- Feinstein, C. (2003). Evidence that P is not equal to NP (Tech. Rep. No. cs.CC/03 10060).
- Gandy, R. (1982). Church’s thesis and principles for mechanisms. In J. Barwise (Ed.), The Klenee symposium. Amsterdam: North-Holland.
- Garey, M. R. & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman.
- Gelertner, D. (2016, 24. November). Ein Geist aus Software. Frankfurter Allgemeine Zeitung. Retrieved from http://www.faz.net/aktuell/feuilleton/debatten/digitales-denken/kuenstliche-intelligenz-ein-geist-aus-software-1607431.html
- Hartmanis, J. (1981). Observations about the development of theoretical computer science. Ann. Hist. Comp., 3, 42-51.
- Hartmanis, J. (1989). G¨odel, von Neumann, and the P =?NP problem. Bulletin of the European Association for Theoretical Computer Science, 38, 101-107.Retrieved from https://ecommons.cornell.edu/handle/1813/6910 (viewed October 31, 2016).
- Hartmanis, J., & Stearns, R. (1965). On the computational complexity of algorithms. Transactions of the American Mathematical Society, 117(5), 285-306.
- Hodges, A. (1983). Alan Turing: the Enigma. London: Burnett (Polish translation (Hodges, 2002)).
- Hodges, A. (2002). Enigma. Życie i śmierć Alana Turinga. Warszawa: Wydawnictwo Proszyński i S-ka (translation of (Hodges, 1983) by W. Bartol).
- Impagliazzo, R. & Wigderson, A. (1997). P = BPP if E requires exponential circuits: derandomizing the XOR lemma. In Stoc ’97 proceedings of the twentyninth annual acm symposium on theory of computing (pp. 220-229). New York: ACM. doi: 10.1145/258533.258590
- Krajewski, S. (2003). Twierdzenie G¨odla i jego interpretacje filozoficzne. Od mechanicyzmu do postmodernizmu. Warszawa: Instytut Filozofii i Socjologii PAN.
- Litt, A., Eliasmith, C., Kroon, F. W., Weinstein, S. & Thagard, P. (2006). Is the brain a quantum computer? Cognitive Science, 30, 593-603.
- Lucas, J. R. (1961). Minds, machines and Gödel. Philosophy, 36, 112-127. http://users.ox.ac.uk/~jrlucas/Godel/mmg.html (viewed October 31, 2016).
- Marciszewski, W. (2003). A comment on Hayek’s ideas of free market and civilization. Studies in Logic, Grammar and Rhetoric, 19(6), 107.
- Marciszewski, W. (2004). Challenges for the logic of social research: To grasp rationality, to deal with complexity. Studies in Logic, Grammar and Rhetoric, 20(7), 17.
- McCarthy, J. (1980). Circumscription-a form of non-monotonic reasoning. Artificial Intelligence, 1-2(13), 27-39.
- McCarthy, J., & Hayes, P. J. (1969). Some philosophical problems from the standpoint of artificial intelligence (Tech. Rep.). Stanford, CA 94305: Computer Science Department, Stanford University.
- McCulloch, W., & Pitts, W. (1943). A logical calculus of the ideas immanent in nervous activity. Bulletin of Mathematical Biophysics (5), 115-133.
- Mole, C. (2016). The unexplained intellect: Complexity, time, and the metaphysics of embodied thought. New York: Routledge.
- Moravec, H. (1988). Mind children: The future of robot and human intelligence. Harvard University Press.
- Park, R. (2000). Voodoo science. The road from foolishness to fraud. Oxford, U.K. & New York: Oxford University Press.
- Penrose, R. (1989). The emperor’s new mind. Oxford: Oxford University Press. (Polish translatation (Penrose, 1995)).
- Penrose, R. (1994). Shadows of the mind. Oxford: Oxford University Press. (Polish translatation (Penrose, 2000)).
- Penrose, R. (1995). Nowy umysł cesarza: o komputerach, umyśle i prawach fizyki. Warszawa: PWN. (translated by Stefan Amsterdamski).
- Penrose, R.(1996). Beyond the doubting of a shadow. Psyche. Retrieved from http://psyche.csse.monash.edu.au/v2/psyche-2-23-penrose.html (electronic journal).
- Penrose, R. (2000). Cienie umysłu. poszukiwanie naukowej teorii świadomości. Poznań: Zysk i S-ka. (translated by Stefan Amsterdamski).
- Piccinini, G. (2007). Computationalism, the Church-Turing thesis, and the Church-Turing fallacy. Synthese (154), 97-120.
- Post, E. (1965). Absolute unsolvable problems and relatively undecidable propositions - Account of an anticipation. In M. Davis (Ed.), The undecidable: Basic papers on undecidable propositions, unsolvable problems, and computable functions (pp. 338-433). Hewlett, N.Y.: Raven Press. (submitted to the American Journal of Mathematics in 1941, but published only in (M. Davis, 1965, pp. 338-433)).
- Rotman, B. (2003, August). Will the digital computer transform classical mathematics? Philosophical Transactions of the Royal Society. Matehmatical, Physical and Engineering Sciences, 361(1809), 1675-1690. doi: 10.1098/rsta.2003.1230
- Siegelmann, H. T. (1995). Computation beyond the Turing limit. Science, 268, 545-5498.
- Siegelmann, H. T. (1999). Neural networks and analog computation: Beyond the Turing limit. Boston: Birkhäuser.
- Sipser, M. (1992). The history and status of the P versus NP question. In STOC ’92: Proceedings of the twenty-fourth annual ACM symposium on theory of computing (pp. 603-618). New York: ACM.
- Slot, C. F., & van Emde, P. (1984). On tape versus core: an application of space efficient perfect hash functions to the invariance of space. In ACM (Ed.), STOC ’84 Proceedings of the sixteenth annual ACM symposium on theory of computing (pp. 391-400). New York.
- Thagard, P. (2000). Coherence in thought and action. Bradford Book.
- Trzęsicki, K. (2006). From the idea of decidability to the number . Studies in Grammar, Logic and Rethoric, 9(22), 73-142.
- Turing, A. M. (1936-37). On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42(Series 2), 230-265. Retrieved from http://www.abelard.org/turpap2/tp2-ie.asp
- Turing, A.M. (1937). On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathemactical Society, 2(1), 230.
- Turing, A. M. (1948, July). Intelligent machinery (Tech. Rep.) National Physical Laboratory. Retrieved from http://www.AlanTuring.net/intelligentmachinery
- Turing, A. M. (1950). Computing machinery and intelligence. Mind, 49, 433-460. (Available on-line: http://cogprints.org/499/00/turing.html. Reprinted in (Turing, 1992a)).
- Turing, A. M. (1952). Can automatic calculating machines be said to think? (Typescript of broadcast discussion in BBC Third Programme, 14 and 23 January 1952, between M.H.A. Newman, A.M. Turing, Sir Geoffrey Jefferson, R.B. Braithwaite).
- Turing, A. M. (1954). Solvable and unsolvable problems. Science News (31), 7-23.
- Turing, A. M. (1969). Intelligent machinery. National Physical Laboratory Report, 1948. In B. Meltzer & D. Michie (Eds.), Machine intelligence 5 (pp. 3-23). Edinburgh: Edinburgh University Press. (Digital facsimile viewable at http://www.AlanTuring.net/intelligentmachinery)
- Turing, A. M. (1992a). Collected works of A. M. Turing: Mechanical intelligence (D. C. Ince, Ed.). Amsterdam: North Holland.
- Turing, A. M. (1992b). Solvable and unsolvable problems. In D. Ince (Ed.), Collected works of alan mathison turing (Vol. III, pp. 187-203).
- van Emde, B. P. (1988, Aug.). Machine models and simulations (Revised version) (Tech. Rep. No. CT-88-05). University of Amsterdam: Institute for Language, Logic and Information. Retrieved from http://www.illc.uva.nl/Research/Reports/CT-1988-05.text.pdf (viewed October 31, 2016).
- van Emde, B. P. (1990). Machine models and simulations. In J. van Leeuwen (Ed.), Handbook of theoretical computer science (Vol. A: Algorithms and Complexity, pp. 1-66). Cambridge: MIT Press/Elsevier.
- van Rooij, I. (2008). The tractable cognition thesis. Cognitive Science. A multidyscyplinary journal 32(6), 939-984. Retrieved from http://onlinelibrary.wiley.com/doi/10.1080/03640210801897856/full (viewed October 31, 2016).
- Wiener, N. (1948). Cybernetics: Control and communication in the animal and the machine (rev. ed. 1961 ed.). Cambridge Mass.: MIT Press.
Language: English
Page range: 103 - 131
Published on: Mar 16, 2017
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Publication frequency: 4 times per year
Keywords:
Related subjects:
© 2017 Kazimierz Trzęsicki, published by University of Białystok
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.