<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">cyberspace</journal-id><journal-title-group><journal-title xml:lang="ru">Философские проблемы информационных технологий и киберпространства</journal-title><trans-title-group xml:lang="en"><trans-title>Philosophical Problems of IT &amp; Cyberspace (PhilIT&amp;C)</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">2305-3763</issn><publisher><publisher-name>Пятигорский государственный университет</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.17726/philIT.2024.1.4</article-id><article-id custom-type="elpub" pub-id-type="custom">cyberspace-309</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Статьи</subject></subj-group></article-categories><title-group><article-title>Концепция рекурсии в когнитивных исследованиях. Часть I: от математики к познанию</article-title><trans-title-group xml:lang="en"><trans-title>The Concept of Recursion in Cognitive Studies. Part I: From Mathematics to Cognition</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Михайлов</surname><given-names>И. Ф.</given-names></name><name name-style="western" xml:lang="en"><surname>Mikhailov</surname><given-names>I. F.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Михайлов Игорь Феликсович - доктор философских наук, ведущий научный сотрудник.</p><p>Москва</p></bio><bio xml:lang="en"><p>Igor F. Mikhailov - Doctor of Philosophy, Leading researcher, Institute of Philosophy of the Russian Academy of Sciences.</p><p>Moscow</p></bio><email xlink:type="simple">ifmikhailov@iph.ras.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Институт философии РАН</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Institute of Philosophy of the Russian Academy of Sciences</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2024</year></pub-date><pub-date pub-type="epub"><day>11</day><month>07</month><year>2024</year></pub-date><volume>0</volume><issue>1</issue><fpage>58</fpage><lpage>76</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Михайлов И.Ф., 2024</copyright-statement><copyright-year>2024</copyright-year><copyright-holder xml:lang="ru">Михайлов И.Ф.</copyright-holder><copyright-holder xml:lang="en">Mikhailov I.F.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://cyberspace.pgu.ru/jour/article/view/309">https://cyberspace.pgu.ru/jour/article/view/309</self-uri><abstract><p>В статье обсуждаются различные подходы к понятию рекурсии и его эволюция от математики к когнитивным исследованиям. Рассматриваются такие подходы как: самовстраиваемые структуры, многоуровневые иерархии с использованием одного и того же правила и встраивание структур в структуры. Предлагается концепция мета‑рекурсии. Исследование мета‑рекурсии может объяснить возможность применения рекурсивных процессов к многоуровневым иерархиям, при этом рекурсивные процедуры действуют как генераторы. Эти типы рекурсивных процессов могут быть фундаментальными элементами общих когнитивных способностей. Автор также кратко обсуждает роль вероятностных подходов в современных рекурсивных когнитивных теориях. Предполагается, что иерархический механизм познания демонстрирует своего рода мета‑рекурсию в том смысле, что рекурсивные нейронные петли могут поддерживать некоторые примитивные рекурсивные когнитивные процессы, которые, в свою очередь, объясняют рекурсивность языковых грамматик, пространственной ориентации, социального познания и т. д. Исследование показывает, что использование нескольких подходов к пониманию феномена рекурсии может обеспечить более полное понимание сложности рекурсии, поскольку она играет важную роль в таких областях, как язык, математика и когнитивная наука.</p></abstract><trans-abstract xml:lang="en"><p>The paper discusses different approaches to the concept of recursion and its evolution from mathematics to cognitive studies. Such approaches are observed as: self‑embedded structures, multiple hierarchical levels using the same rule, and embedding structures within structures. The paper also discusses the concept of meta‑recursion. Examining meta‑recursion may enable understanding of the ability to apply recursive processes to multilayered hierarchies, with recursive procedures acting as generators. These types of recursive processes could be the fundamental elements of general cognition. The paper also briefly discusses the role of probability in current recursive approaches to cognition. It is conjenctured that the hierarchical mechanism of cognition demonstrates a kind of meta‑recursion in the sense that recursive neural loops may support some primitive recursive cognitive processes, which in turn account for recursiveness of language grammars, space orientation, social cognition, etc. The study indicates that using multiple approaches to understand the phenomenon of recursion can provide a more complete understanding of the complexity of recursion, as it plays a significant role in fields like language, mathematics, and cognitive science.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>рекурсия</kwd><kwd>когнитивные исследования</kwd><kwd>самовстраиваемые структуры</kwd><kwd>иерархические структуры</kwd><kwd>мета-рекурсия</kwd></kwd-group><kwd-group xml:lang="en"><kwd>recursion</kwd><kwd>cognitive studies</kwd><kwd>self‑embedded structures</kwd><kwd>hierarchical structures</kwd><kwd>meta‑recursion</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Soare R. I. Computability and Recursion // Bulletin of Symbolic Logic. 1996. Vol. 2, № 3. P. 284‑321.</mixed-citation><mixed-citation xml:lang="en">Soare R. I. Computability and Recursion // Bulletin of Symbolic Logic. 1996. Vol. 2, № 3. P. 284‑321.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Prokopenko M. et al. Self‑referential basis of undecidable dynamics: From the Liar paradox and the halting problem to the edge of chaos // Phys Life Rev. 2019. Vol. 31. P. 134‑156.</mixed-citation><mixed-citation xml:lang="en">Prokopenko M. et al. Self‑referential basis of undecidable dynamics: From the Liar paradox and the halting problem to the edge of chaos // Phys Life Rev. 2019. Vol. 31. P. 134‑156.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Kleene S. C. Recursive functionals and quantifiers of finite types revisited i // Studies in Logic and the Foundations of Mathematics. 1978. Vol. 94, № C. P. 185‑222.</mixed-citation><mixed-citation xml:lang="en">Kleene S. C. Recursive functionals and quantifiers of finite types revisited i // Studies in Logic and the Foundations of Mathematics. 1978. Vol. 94, № C. P. 185‑222.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Mota S. The never‑ending recursion // Journal of Applied Logic. Elsevier Ltd, 2017. Vol. 25. P. 89‑108.</mixed-citation><mixed-citation xml:lang="en">Mota S. The never‑ending recursion // Journal of Applied Logic. Elsevier Ltd, 2017. Vol. 25. P. 89‑108.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Kiefer A., Hohwy J. Content and misrepresentation in hierarchical generative models // Synthese. 2018. Vol. 195, № 6. P. 2387‑2415.</mixed-citation><mixed-citation xml:lang="en">Kiefer A., Hohwy J. Content and misrepresentation in hierarchical generative models // Synthese. 2018. Vol. 195, № 6. P. 2387‑2415.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Sacks G. E. Metarecursion theory // Studies in Logic and the Foundations of Mathematics. Elsevier, 1967. Vol. 46, № C. P. 243‑263.</mixed-citation><mixed-citation xml:lang="en">Sacks G. E. Metarecursion theory // Studies in Logic and the Foundations of Mathematics. Elsevier, 1967. Vol. 46, № C. P. 243‑263.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Chomsky N. Minimal Recursion: Exploring the Prospects // Studies in Theoretical Psycholinguistics. 2014. Vol. 43. P. 1‑15.</mixed-citation><mixed-citation xml:lang="en">Chomsky N. Minimal Recursion: Exploring the Prospects // Studies in Theoretical Psycholinguistics. 2014. Vol. 43. P. 1‑15.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Tomalin M. Reconsidering recursion in syntactic theory // Lingua. 2007. Vol. 117, № 10. P. 1784‑1800.</mixed-citation><mixed-citation xml:lang="en">Tomalin M. Reconsidering recursion in syntactic theory // Lingua. 2007. Vol. 117, № 10. P. 1784‑1800.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Corballis M. C. Recursive Cognition as a Prelude to Language // Language and Recursion. New York, NY: Springer New York, 2014. Vol. 9781461494. P. 27‑36.</mixed-citation><mixed-citation xml:lang="en">Corballis M. C. Recursive Cognition as a Prelude to Language // Language and Recursion. New York, NY: Springer New York, 2014. Vol. 9781461494. P. 27‑36.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Baryshnikov P. N. Language, brain and computation: from semiotic asymmetry to recursive rules // RUDN Journal of Philosophy. 2018. Vol. 22, № 2. P. 168‑182.</mixed-citation><mixed-citation xml:lang="en">Baryshnikov P. N. Language, brain and computation: from semiotic asymmetry to recursive rules // RUDN Journal of Philosophy. 2018. Vol. 22, № 2. P. 168‑182.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Christiansen M. H., Chater N. Toward a connectionist model of recursion in human linguistic performance // Cogn Sci. 1999. Vol. 23, № 2. P. 157‑205.</mixed-citation><mixed-citation xml:lang="en">Christiansen M. H., Chater N. Toward a connectionist model of recursion in human linguistic performance // Cogn Sci. 1999. Vol. 23, № 2. P. 157‑205.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Piccinini G., Bahar S. Neural Computation and the Computational Theory of Cognition // Cogn Sci. 2013. Vol. 37, № 3. P. 453‑488.</mixed-citation><mixed-citation xml:lang="en">Piccinini G., Bahar S. Neural Computation and the Computational Theory of Cognition // Cogn Sci. 2013. Vol. 37, № 3. P. 453‑488.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Kolodny O., Lotem A., Edelman S. Learning a Generative Probabilistic Grammar of Experience: A Process‑Level Model of Language Acquisition // Cogn Sci. 2015. Vol. 39, № 2. P. 227‑267.</mixed-citation><mixed-citation xml:lang="en">Kolodny O., Lotem A., Edelman S. Learning a Generative Probabilistic Grammar of Experience: A Process‑Level Model of Language Acquisition // Cogn Sci. 2015. Vol. 39, № 2. P. 227‑267.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Zhang Y.,Amin N. Reasoning about reasoning about reasoningz semantics and contextual equivalence for probabilistic programs with nested queries and recursion // Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2022. Vol. 6, № POPL.</mixed-citation><mixed-citation xml:lang="en">Zhang Y.,Amin N. Reasoning about reasoning about reasoningz semantics and contextual equivalence for probabilistic programs with nested queries and recursion // Proceedings of the ACM on Programming Languages. Association for Computing Machinery, 2022. Vol. 6, № POPL.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Wittgenstein L. Tractatus logico‑philosophicus // Tractatus Logico-Philosophicus. Anthem Press, 2021. P. 56‑250.</mixed-citation><mixed-citation xml:lang="en">Wittgenstein L. Tractatus logico‑philosophicus // Tractatus Logico-Philosophicus. Anthem Press, 2021. P. 56‑250.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">MacLennan B. J. Transcending Turing computability // Minds Mach (Dordr). Springer Netherlands, 2003. Vol. 13, № 1.</mixed-citation><mixed-citation xml:lang="en">MacLennan B. J. Transcending Turing computability // Minds Mach (Dordr). Springer Netherlands, 2003. Vol. 13, № 1.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">MacLennan B. J. Natural computation and non‑Turing models of computation // Theor Comput Sci. 2004. Vol. 317, № 1. P. 115‑145.</mixed-citation><mixed-citation xml:lang="en">MacLennan B. J. Natural computation and non‑Turing models of computation // Theor Comput Sci. 2004. Vol. 317, № 1. P. 115‑145.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
