Computable fields and weak truth-table reducibility

DOI10.1007/978-3-642-13962-8_44MaRDI QIDQ3576228zbMATH OpenOpenAlexFDO

Authors Rebecca M. Steiner

Publication date 29 July 2010

Published in Programs, Proofs, Processes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13962-8_44

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Recommendations

• Computable fields and the bounded Turing reduction
• Is it harder to factor a polynomial or to find a root?
• Categoricity properties for computable algebraic fields
• scientific article; zbMATH DE number 1285742
• Algebraic and Turing separability of rings

Cited in

(5)

• Hypersimplicity and semicomputability in the weak truth table degrees
• Is it harder to factor a polynomial or to find a root?
• Adapting Rabin's theorem for differential fields
• Computing constraint sets for differential fields
• Computable fields and the bounded Turing reduction

This page was built for publication: Computable fields and weak truth-table reducibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3576228)