Relative complexity for computable presentations of the conventional linear order on the set of naturals

zbMath1047.03035MaRDI QIDQ1876412

S. Yu. Podzorov

Publication date: 6 September 2004

Published in: Siberian Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

reducibilitylinear orderdegrees of unsolvabilitycomputable presentationcomputable function

Mathematics Subject Classification ID

Partial orders, general (06A06) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

This page was built for publication: Relative complexity for computable presentations of the conventional linear order on the set of naturals