Cototal enumeration degrees and their applications to effective mathematics

DOI10.1090/proc/13783OpenAlexW2607834980MaRDI QIDQ4563667

Ethan McCarthy

Publication date: 4 June 2018

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/proc/13783

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Applications of computability and recursion theory (03D80) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (5)

A STRUCTURAL DICHOTOMY IN THE ENUMERATION DEGREES ⋮ PA RELATIVE TO AN ENUMERATION ORACLE ⋮ Density of the cototal enumeration degrees ⋮ The relationship between word complexity and computational complexity in subshifts ⋮ Comparing the degrees of enumerability and the closed Medvedev degrees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turing degrees of multidimensional SFTs
• Computability of countable subshifts in one dimension
• Density of the cototal enumeration degrees
• Computable linearizations of well-partial-orderings
• Turing degree spectra of minimal subshifts
• Abelian complexity of minimal subshifts
• Complex tilings
• Computable symbolic dynamics
• Computability of Countable Subshifts
• Degrees of Structures
• On cototality and the skip operator in the enumeration degrees
• Omitting quantifier-free types in generic structures
• Degrees of unsolvability of continuous functions
• Medvedev degrees of two-dimensional subshifts of finite type
• Arithmetical Reducibilities I
• The strong homogeneity conjecture
• Point Degree Spectra of Represented Spaces
• Logical Approaches to Computational Barriers

This page was built for publication: Cototal enumeration degrees and their applications to effective mathematics