SavedAdd your journal

Journals / FLSF Felsefe ve Sosyal Bilimler Dergisi / 2026 / Sayı: 37

A PHILOSOPHICAL INVESTIGATION ON THE LIMITS OF THE TURING TEST

TURİNG TESTİNİN SINIRLARI ÜZERİNE FELSEFİ BİR İNCELEME

Ümit Taştan(AKSARAY ÜNİVERSİTESİ, FEN-EDEBİYAT FAKÜLTESİ, FELSEFE BÖLÜMÜ, FELSEFE PR.)0000-0002-5121-0943
Pages
325–344
Publication Date
2024-05-07
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

Our paper concludes that the Turing test is impassable as long as these two obstacles exist.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:There is no consensus on the necessary and sufficient conditions for attributing intelligence to a machine.
📊
Key Findings & Data:However, the Turing test remains a crucial milestone and benchmark for assessing the capabilities of machine intelligence.
💡
Conclusion & Impact:Our paper concludes that the Turing test is impassable as long as these two obstacles exist.
🔬Design:Araştırma Makalesi
📍Scope:Comprehensive Sample
⚙️Variables:Alan Turing · Turing testi · yapay zekâ

Abstract

There is no consensus on the necessary and sufficient conditions for attributing intelligence to a machine. However, the Turing test remains a crucial milestone and benchmark for assessing the capabilities of machine intelligence. In this paper, we examine two of what we see as possible obstacles to passing the Turing test. The first is in the area of logical inference, which is at the core of programming. The second is the lack of effective solutions to some problems in the area of computational complexity. In presenting these two obstacles, we try to combine the literature on the discipline of logic and theoretical computer science in a philosophical way. Our paper concludes that the Turing test is impassable as long as these two obstacles exist.

Özet

Bir makineye zekâ atfetmenin gerek ve yeter koşulları konusunda herkesçe uzlaşılan bir zemin yoktur. Ancak Turing testi, makine zekâsının yeteneklerini değerlendirmek için çok önemli bir kilometre taşı ve ölçüt olarak durmaya devam etmektedir. Bu makalede, Turing testinin geçilmesinin önündeki bizce muhtemel engellerden ikisini inceliyoruz. Birincisi, programlamanın temelinde yer alan mantıksal çıkarıma dayalı engellerdir. İkincisi ise hesap karmaşıklığı alanındaki bazı problemlerle ilgili etkili çözümler bulunamamasından kaynaklanan engeldir. Bu iki engeli ortaya koyarken mantık disiplinine ve teorik bilgisayar bilimine dair literatürü felsefi bir yöntemle sentezlemeye çalışıyoruz. Çalışmamız, yukarıda sözü edilen iki engelden hareketle ve bu engeller var olduğu sürece Turing testinin geçilemez olduğu sonucuna varmaktadır.

🔖

Cite This Article

Taştan, Ü. (2024). A PHILOSOPHICAL INVESTIGATION ON THE LIMITS OF THE TURING TEST. FLSF Felsefe ve Sosyal Bilimler Dergisi, Sayı: 37, 325–344. https://doi.org/10.53844/flsf.1437990

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (27)

  1. Aaronson, Scott. “Why Philosophers Should Care About Computational Complexity.” In Computability. Edited by B. J. Copeland, Carl J. Posy and Oron Shagrir, 261–328. The MIT Press, 2013.
  2. Aliseda, A. Abductive Reasoning: Logical Investigations into Discovery and Explanation / by Atocha Aliseda. Synthese library 330. Dordrecht, London: Springer, 2006.
  3. Applegate, David L. The Traveling Salesman Problem: A Computational Study / David L. Applegate … [Et Al.]. Princeton series in applied mathematics. Princeton, Oxford: Princeton University Press, 2006.
  4. Copeland, B. J., Carl J. Posy, and Oron Shagrir, eds. Computability. The MIT Press, 2013.
  5. De Mol, Liesbeth. Turing Machines, (2018), The Stanford Encyclopedia of Philosophy, https://plato.stanford.edu/entries/turing-machine/ (Erişim Tarihi: 2 Şubat, 2023).
  6. Gabbay, Dov M., John Woods, and Akihiro Kanamori. Handbook of the History of Logic. 1st ed. Amsterdam, Boston: Elsevier, 2004-2012.
  7. Han, Simon J., Keith J. Ransom, Andrew Perfors, and Charles Kemp. “Inductive Reasoning in Humans and Large Language Models.” Cognitive Systems Research 83 (2024): 101155.
  8. Holyoak, Keith J., and Robert G. Morrison. The Oxford Handbook of Thinking and Reasoning. Oxford library of psychology. Oxford: Oxford University Press, 2012.
  9. Hromkovic, J. Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation and Heuristics. Berlin: Springer-Verlag Berlin and Heidelberg GmbH & Co., 2001.
  10. John McCarthy. “Programs with Common Sense.” (1960).
  11. Kleinberg, Jon, and Éva Tardos. Algorithm Design. Boston, Mass., London: Pearson/Addison-Wesley, 2006.
  12. Kosaraju, Rao, Mike Fellows, Avi Wigderson, and John Ellis, eds. Theory of Computing: Twenty-Fourth Annual ACM Symposium: Proceedings. New York: Association for Computing Machinery, 1992.
  13. Laplante, Phillip A. Dictionary of Computer Science, Engineering, and Technology. Boca Raton, FL: CRC Press, 2001.
  14. Marion, Bill. “Turing Machines and Computational Complexity.” The American Mathematical Monthly 101, no. 1 (1994): 61.
  15. McCarthy, J., and P. J. Hayes. “Some Philosophical Problems from the Standpoint of Artificial Intelligence.” In Readings in Artificial Intelligence. Elsevier, 1981.
  16. Michael Sipser. “Beyond Computation: The P Vs NP Problem”, https://www.youtube.com/watch?v=msp2y_Y5MLE (Erişim Tarihi: Eylül 25, 2023).
  17. Oppy, Graham and David Dowe, The Turing Test, (2021), The Stanford Encyclopedia of Philosophy, https://plato.stanford.edu/archives/win2021/entries/turing-test/>/ (Erişim Tarihi: 25 Nisan, 2024).
  18. Piccinini, Gualtiero. “Alan Turing and the Mathematical Objection.” Minds and Machines 13, no. 1 (2003): 23–48.
  19. Proudfoot, Diane. “Rethinking Turing’s Test and the Philosophical Implications.” Minds and Machines 30, no. 4 (2020): 487–512.
  20. Readings in Artificial Intelligence. Elsevier, 1981.
  21. Sipser, Michael. “The History and Status of the P Versus NP Question.” içinde Theory of Computing: Twenty-Fourth Annual ACM Symposium: Proceedings. Edited by Rao Kosaraju et al. New York: Association for Computing Machinery, 1992.
  22. . Introduction to the Theory of Computation. Florence: Cengage Learning, Inc, 2012.
  23. Soto, Ricardo, Broderick Crawford, Cristian Galleguillos, Eric Monfroy, and Fernando Paredes. “A Prefiltered Cuckoo Search Algorithm with Geometric Operators for Solving Sudoku Problems.” TheScientificWorldJournal (2014): 465359.
  24. Taştan, Ümit. “Gödel’in Tamamlanamazlık Teoremleri Bakımından Biçimsel Dillerde İspatlanabilirlik-Doğruluk İlişkisi.” MetaZihin: Yapay Zeka ve Zihin Felsefesi Dergisi (2022).
  25. Turing, Alan. “Computing Machinery and Intelligence.” Mind LIX, no. 236 (1950): 433–460.
  26. Turing, Alan M., and B. J. Copeland, eds. The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life Plus the Secrets of Enigma. Oxford: Clarendon Press, 2010.
  27. . Introduction to the Theory of Computation. Florence: Cengage Learning, Inc, 2012.