Turing's Point: A Machine Expected to Be Infallible Cannot Also Be Intelligent
wavefnx · x · 2026-11-18
- The author highlights Turing's remark: "if a machine is expected to be infallible, it cannot also be intelligent," and notes "error" derives from Latin errare (to wander).
- Turing argued for fair play: rather than forcing machines to abstain, let them occasionally err — just as human mathematicians do when trying new techniques.
- The takeaway: strictly obedient systems can't be truly intelligent; "roam freely, but know when to stop" may be a prerequisite for intelligence.
Related event: Turing's 1947 Lecture Resurfaces: Error-Free Systems Cannot Be Intelligent(2 posts)→
More from AGI Musings
- FT: AI-tailored job applications create a lose-lose arms race for employers and applicants — paulnovosad · 2026-11-18
- MIRI President's Partner Runs Bay Area Kink Parties, Report Says — thedealdirector · 2026-11-18
- Pangram flags 99% of award-winning Peruvian novel as AI; publisher keeps prize — nabeelqu · 2026-11-18
- AI Now report "AI Comes for Nursing": nurses bear the cost of error-prone AI tools — AINowInstitute · 2026-11-18
- Ben Goertzel: hyperscalers' $730B 2026 capex is a massive bet on the Singularity — bengoertzel · 2026-11-18
- AI safety commentator warns against 'crying wolf' over rogue AI incidents — AndyMasley · 2026-11-18