Inversion in P-Computable Fields | Sciact

Inversion in P-Computable Fields Full article

Conference

Twenty Years of Theoretical and Practical Synergies : 20th Conference on Computability in Europe
08-12 Jul 2024 , Amsterdam

Source

Twenty Years of Theoretical and Practical Synergies : 20th Conference on Computability in Europe, CiE 2024, Amsterdam, The Netherlands, July 8–12, 2024: Proceedings
Compilation, Springer Cham. 2024. 462 c. ISBN 978-3-031-64309-5.

Journal

Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349

Output data

Year: 2024, Volume: 14773, Pages: 100-109 Pages count : 10 DOI: 10.1007/978-3-031-64309-5_9

Funding (1)

Russian Science Foundation

23-11-00170

We consider fields computable in polynomial time (P-computable). We prove that under some assumptions about a P-computable field (A,+,·) of characteristic 0, there exists a P-computable field (formula presented) is not a primitive recursive function. In particular, this holds for the field Q of rational numbers.

Alaev P.
Inversion in P-Computable Fields
In compilation Twenty Years of Theoretical and Practical Synergies : 20th Conference on Computability in Europe, CiE 2024, Amsterdam, The Netherlands, July 8–12, 2024: Proceedings. – Springer Cham., 2024. – C.100-109. – ISBN 978-3-031-64309-5. DOI: 10.1007/978-3-031-64309-5_9 WOS Scopus OpenAlex

Published print:	Jul 2, 2024
Published online:	Jul 2, 2024

Web of science:	WOS:001315672500019
Scopus:	2-s2.0-85200372746
OpenAlex:	W4400179168

Пока нет цитирований