How to overpower a machine? Strategy and tactics on the «playing field» of mentalism and mechanicism
https://doi.org/10.17726/philIT.2019.1.16.4
Abstract
This article deals with well-known debate between representatives of mentalism and mechanicism in the context of certain statements of the computational philosophy of mind. The article is structured in the form of a list of strong and weak arguments from both supporters and skeptics of computational models of mind. Classical arguments against machine functionalism prove to be weakened by the unclear nature of computation and the fuzzy volume of this notion. The question is formulated as to whether formal limitations of arithmetic procedures are sufficient condition for rejection of computer realization of human intellectual functions. For the computational philosophy of mind, the conditionality of the explanatory properties of computer models with the essential properties of machine and human types of computation is extremely important. The work justifies the thesis of contextual dependence of computational models on philosophical or engineering efficiency criteria.
References
1. Нагель Т., Ньюмен Д. Р. Теорема Гёделя. М.: Красанд, 2010. 120 c.
2. Пенроуз Р. Тени разума: в поисках науки о сознании. Москва- Ижевск: Институт компьютерных исследований, 2005. 688 c.
3. Church A. An Unsolvable Problem of Elementary Number Theory // American Journal of Mathematics. 1936. Т. 58. № 2. P. 345.
4. Copeland B. J., Bowen J. P., Sprevak M., Wilson R. J. The Turing guide. Oxford University Press, 2017. 546 c.
5. Ершов Ю. Л., Целищев В. В. Алгоритмы и вычислимость в человеческом познании. Новосибирск: Изд-во СО РАН, 2012. 504 c.
6. Sieg W. Step by Recursive Step: Church’s Analysis of Effective Calculability // Bulletin of Symbolic Logic, 1997. Vol. 3. P. 154-180.
7. Целищев В. В., Ершoв Ю. Л. Алгоритмизация знания и ее пределы (исследование представления мышления в логико-математических языках первого и второго порядков, вычислимости в свете тезиса Черча и сферы действия ограничительных теорем Геделя и Тарского). Проект № 125, 2005 (Основные научные результаты СО РАН) [Электронный ресурс]. URL: http://www.sbras.ru/win/sbras/rep/rep2005/ tom2/pdf/125.pdf.
8. Целищев В. В. Рационалистический оптимизм и философия Курта Геделя // Вопросы философии. 2013. № 8. C. 12-23.
9. Copeland B. J., Shagrir O. Physical Computation: How General are Gandy’s Principles for Mechanisms? // Minds and Machines. 2007. Т. 17. № 2. P. 217-231.
10. Юлина Н. С. Роджер Пенроуз: Поиски локуса ментальности в квантовом микромире // Вопросы философии. 2012. № 6. C. 116-130.
11. Schmidhuber J. Gödel Machines: Towards a Technical Justification of Consciousness // Adaptive agents and multi-agent systems III (ed. D. Kudenko, D. Каzakov, E. Alonso). Berlin, New York: Springer, 2008. P. 1-23.
Review
For citations:
Baryshnikov P.N. How to overpower a machine? Strategy and tactics on the «playing field» of mentalism and mechanicism. Philosophical Problems of IT & Cyberspace (PhilIT&C). 2019;(1):58-67. (In Russ.) https://doi.org/10.17726/philIT.2019.1.16.4
Views:
173
Email this article 