
The mathematical objection to artificial (machine) intelligence
Keywords
Summary
190 words
Critical Evaluation
Value of the Information & Strength of the Argument
The talk offers valuable insights into Turing’s philosophy of AI, challenging common interpretations. Shagrir’s argument is well-structured, moving from the formulation of the mathematical objection to Turing’s reply and its implications. He provides a nuanced reading of Turing’s texts, distinguishing between Turing’s own views and later attributions by Gödel and others. The argumentation is solid, though it remains interpretive and does not provide empirical evidence. The discussion of enhanced machines and the multi-machine theory of mind is thought-provoking and adds depth to the understanding of Turing’s vision.
Scientific Rigor, Source Quality, Title Accuracy
Shagrir demonstrates rigorous scholarship by grounding his analysis in primary sources, including Turing’s 1947 lecture, 1948 report, 1950 Mind paper, and letters. He also engages with secondary literature, such as Piccinini’s work. The title accurately reflects the content, which focuses on the mathematical objection and Turing’s response. The talk is well-organized and the historical context is carefully presented.
160 words
Title / Content Match
The title accurately reflects the content, which focuses on Turing's treatment of the mathematical objection to machine intelligence.
Quality & Reliability
8/10
Talk by a leading philosopher of computation, based on joint work with a student, drawing on primary sources (Turing's papers and letters). The argument is well-structured and historically grounded, though it presents an interpretive thesis rather than empirical evidence.
Key Moments
Markers derived by PSI from the transcript: the creator did not define chapters.
- Introduction and overview of the talk's structure.
- Explanation of the mathematical objection and the human over machine premise.
- Discussion of why Turing took the objection seriously, introducing the dilemma.
- Turing's reply: enhanced machines and the role of learning and intuition.
- Assessment of the reply and tentative refinement.
Cited Sources
- Turing, A. (1950). Computing Machinery and Intelligence. Mind, 59(236), 433-460. — Turing's seminal paper introducing the Turing test and discussing the mathematical objection.
- Turing, A. (1948). Intelligent Machinery. Report, National Physical Laboratory. — Turing's report outlining his ideas on machine intelligence, including the concept of enhanced machines.
- Turing, A. (1936). On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42(1), 230-265. — Turing's foundational paper on computability, where he discusses non-computable sequences.
- Turing, A. (1939). Systems of Logic Based on Ordinals. Proceedings of the London Mathematical Society, 45(1), 161-228. — Turing's PhD thesis, where he discusses the role of intuition in mathematical proofs.
- Piccinini, G. (2003). Turing's Rules for the Imitation Game. Minds and Machines, 13(4), 481-510. — Paper proposing that Turing's reply to the mathematical objection involves machines that can learn and discover new rules.
Concurring Sources
- Copeland, B. J. (2004). The Essential Turing. Oxford University Press. — Collection of Turing's writings, providing context for his views on machine intelligence.
- Proudfoot, D. (2013). Turing and the First Robot. In The Turing Test (pp. 185-204). Springer. — Interpretation of Turing's test that aligns with the idea of intelligence supervening on behavior.
Dissenting Sources
Contribution & Novelties
The talk offers a fresh interpretation of Turing’s response to the mathematical objection, arguing that Turing did not deny human superiority but instead proposed that machines could be enhanced to overcome limitations. This challenges common readings and highlights Turing’s nuanced view of machine intelligence. The concept of ’enhanced machines’ and the multi-machine theory of mind provide a framework for understanding Turing’s vision.
Pour aller plus loin :
- Turing test — Overview of the Turing test and its interpretations.
- Church–Turing thesis — Foundational thesis linking computability and effective methods.
- Gödel’s incompleteness theorems — Theorems central to the mathematical objection.
98 words
Radar Profile
The radar profile shows high scores in quality of information and reliability, reflecting the speaker's expertise and use of primary sources. The quantity of information is moderate, as the talk is focused and not exhaustive. The technical level is high, suitable for an academic audience.
💬 No comments were provided for analysis.