Non-coding enumeration operators

DOI10.1007/978-3-030-51466-2_10OpenAlexW3037016679MaRDI QIDQ2106596

Russell G. Miller

Publication date: 16 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-51466-2_10

zbMATH Keywords

computabilityHilbert's tenth problemcomputable structure theoryenumeration operatorsessential lowness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Hilbert's-tenth-problem operator
• An introduction to computable model theory on groups and fields
• Baire Category Theory and Hilbert’s Tenth Problem Inside $$\mathbb {Q}$$ Q
• d-computable categoricity for algebraic fields
• Decidability of the “almost all” theory of degrees
• HTP-COMPLETE RINGS OF RATIONAL NUMBERS
• MEASURE THEORY AND HILBERT’S TENTH PROBLEM INSIDE ℚ
• Isomorphism and classification for countable structures
• Categoricity properties for computable algebraic fields
• As easy as $\mathbb {Q}$: Hilbert’s Tenth Problem for subrings of the rationals and number fields

This page was built for publication: Non-coding enumeration operators