Functional Variant of Polynomial Analogue of Gandy's Fixed Point Theorem

【Author】 Nechesov, Andrey; Goncharov, Sergey

【Source】MATHEMATICS

【影响因子】2.592

【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.

【Keywords】polynomial computability; Gandy's fixed point theorem; artificial intelligence; smart cities

【发表时间】2024 NOV

【收录时间】2024-11-18

【文献类型】

【主题类别】

--