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

Full description

Saved in:

Bibliographic Details
Published in:	Mathematics (Basel) Vol. 9; no. 17; p. 2102
Main Authors:	Goncharov, Sergey, Nechesov, Andrey
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.09.2021
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!