Relative complexity for computable presentations of the conventional linear order on the set of naturals
From MaRDI portal
Publication:1876412
zbMath1047.03035MaRDI QIDQ1876412
Publication date: 6 September 2004
Published in: Siberian Advances in Mathematics (Search for Journal in Brave)
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