Polynomial Analogue of Gandy’s Fixed Point Theorem

The paper suggests a general method for proving the fact whether a certain set is p-computable or not. The method is based on a polynomial analogue of the classical Gandy’s fixed point theorem. Classical Gandy’s theorem deals with the extension of a predicate through a special operator ΓΦ(x)Ω∗ and s...

Celý popis

Podrobná bibliografia

Vydané v:	Mathematics (Basel) Ročník 9; číslo 17; s. 2102
Hlavní autori:	Goncharov, Sergey, Nechesov, Andrey
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Basel MDPI AG 01.09.2021
Predmet:	Fixed points (mathematics) Gandy’s fixed point theorem Mathematics Operators (mathematics) p-computability polynomial computability polynomial operators Polynomials semantic programming Theorems Δ0p
ISSN:	2227-7390, 2227-7390
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!