Functional Variant of Polynomial Analogue of Gandy’s Fixed Point Theorem | Sciact - Система учета научной деятельности ИМ СО РАН

Functional Variant of Polynomial Analogue of Gandy’s Fixed Point Theorem Научная публикация

Журнал

Mathematics
, E-ISSN: 2227-7390

Вых. Данные

Год: 2024, Том: 12, Номер: 21, Номер статьи : 3429, Страниц : 14 DOI: 10.3390/math12213429

Ключевые слова

polynomial computability; Gandy’s fixed point theorem; artificial intelligence; smart cities

Авторы

Nechesov Andrey ¹ , Goncharov Sergey ¹

Организации

1	Department of Discrete Mathematics and Computer Science, The Artificial Intelligence Research Center of Novosibirsk State University, Novosibirsk 630090, Russia

In this work, a functional variant of the polynomial analogue of Gandy’s fixed point theorem is obtained. Sufficient conditions have been found to ensure that the complexity of recursive functions does not exceed polynomial bounds. This opens up opportunities to enhance the expressivity of p-complete languages by incorporating recursively defined constructs. This approach is particularly relevant in the following areas: AI-driven digital twins of smart cities and complex systems, trustworthy AI, blockchains and smart contracts, transportation, logistics, and aerospace. In these domains, ensuring the reliability of inductively definable processes is crucial for maintaining human safety and well-being.

Nechesov A. , Goncharov S.
Functional Variant of Polynomial Analogue of Gandy’s Fixed Point Theorem
Mathematics. 2024. V.12. N21. 3429 :1-14. DOI: 10.3390/math12213429 WOS Scopus РИНЦ OpenAlex

Поступила в редакцию:	20 сент. 2024 г.
Опубликована в печати:	31 окт. 2024 г.
Опубликована online:	31 окт. 2024 г.

Web of science:	WOS:001351732900001
Scopus:	2-s2.0-85208579601
РИНЦ:	79075715
OpenAlex:	W4403965099

БД	Цитирований
Scopus	1
Web of science	1