Functional Variant of Polynomial Analogue of Gandy’s Fixed Point Theorem Full article
| Journal |
Mathematics
, E-ISSN: 2227-7390 |
||
|---|---|---|---|
| Output data | Year: 2024, Volume: 12, Number: 21, Article number : 3429, Pages count : 14 DOI: 10.3390/math12213429 | ||
| Tags | polynomial computability; Gandy’s fixed point theorem; artificial intelligence; smart cities | ||
| Authors |
|
||
| Affiliations |
|
Abstract:
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.
Cite:
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
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
Dates:
| Submitted: | Sep 20, 2024 |
| Published print: | Oct 31, 2024 |
| Published online: | Oct 31, 2024 |
Identifiers:
| Web of science: | WOS:001351732900001 |
| Scopus: | 2-s2.0-85208579601 |
| Elibrary: | 79075715 |
| OpenAlex: | W4403965099 |