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

Celý popis

Podrobná bibliografie

Hlavní autoři:	Sergey Goncharov, Andrey Nechesov
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	MDPI AG 2021-08-01
Edice:	Mathematics
Témata:	polynomial computability p-computability Gandy’s fixed point theorem semantic programming polynomial operators <inline-formula><math display="inline"><semantics><msubsup><mo>Δ</mo><mn>0</mn><mi>p</mi></msubsup></semantics></math></inline-formula>
On-line přístup:	https://www.mdpi.com/2227-7390/9/17/2102
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!