Complexity profiles and generic Muchnik reducibility

DOI10.1016/j.aim.2023.109397MaRDI QIDQ6182774

Joseph S. Miller, Mariya Ivanova Soskova, Uri Andrews, Noah Schweber

Publication date: 21 December 2023

Published in: Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

uncountable structureswadge determinacygeneric Muchnik reducibilitycomplexity profiles

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Computable structure theory, computable model theory (03C57) Other aspects of forcing and Boolean-valued models (03E40)

Cites Work

• Generic Muchnik reducibility and presentations of fields
• Generic copies of countable structures
• Computability on computable metric spaces
• COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS
• COMPARING TWO VERSIONS OF THE REALS
• Degrees coded in jumps of orderings
• COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS
• Effective model theory vs. recursive model theory
• EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity profiles and generic Muchnik reducibility