Computable procedures for fields

DOI10.1007/978-3-030-80049-9_31OpenAlexW3184339260MaRDI QIDQ2117796

Russell G. Miller

Publication date: 22 March 2022

Full work available at URL: https://academicworks.cuny.edu/qc_pubs/483

zbMATH Keywords

polynomialsfactorizationirreducibilitycomputabilityfieldsplitting setHilbert's tenth problemcomputable structure theoryroot setRabin's theorem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computable fields and the bounded Turing reduction
• The decision problem for exponential diophantine equations
• Degree spectra and computable dimensions in algebraic structures
• Degree spectra for transcendence in fields
• Degrees of categoricity of computable structures
• Computably Categorical Fields via Fermat’s Last Theorem
• Is it harder to factor a polynomial or to find a root?
• Effective procedures in field theory
• d-computable categoricity for algebraic fields
• Degrees coded in jumps of orderings
• Effective content of field theory
• Theorie Der Numerierungen III
• A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
• Isomorphism and classification for countable structures
• Computable Algebra, General Theory and Theory of Computable Fields
• DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS
• Definability and decision problems in arithmetic
• Defining \(\mathbb Z\) in \(\mathbb Q\)

This page was built for publication: Computable procedures for fields