Fixed-point selection functions
type: Item
instance of: scholarly article
title: Fixed-point selection functions
zbMATH Open document ID: 1491.03030
DOI: 10.1134/S1995080221040041
published in: Lobachevskii Journal of Mathematics
publication date: 2021-06-07T00:00:00Z
Mathematics Subject Classification ID: 03D25
Mathematics Subject Classification ID: 03D30
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 7355599
zbMATH Keywords: arithmetical hierarchy
zbMATH Keywords: recursion theorem
zbMATH Keywords: fixed-point free function
zbMATH Keywords: reducibility
zbMATH Keywords: Kolmogorov complexity
zbMATH Keywords: precomplete numbering
author: M. M. Arslanov
MaRDI profile type: Publication
cites work: Completeness in the arithmetical hierarchy and fixed points
cites work: Q3425600
cites work: Fixed point theorems for precomplete numberings
cites work: Quasi-completeness and functions without fixed-points
cites work: \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets
cites work: Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
cites work: Q4946099
cites work: Kolmogorov complexity and the Recursion Theorem
cites work: Q4723720
cites work: A fixed-point-free minimal degree
cites work: Π10 classes, strong minimal covers and hyperimmune-free degrees
cites work: Q4040892
cites work: GENERALIZATIONS OF THE RECURSION THEOREM
cites work: The noneffectivity of Arslanov's completeness criterion and related theorems
full work available at URL: s1995080221040041
OpenAlex ID: W3165963906
description: scientific article; zbMATH DE number 7355599