Generic Muchnik reducibility and presentations of fields

DOI10.1007/s11856-016-1413-7zbMath1403.03068OpenAlexW2530254649MaRDI QIDQ503243

Noam Greenberg, Joseph S. Miller, Rodney G. Downey

Publication date: 11 January 2017

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11856-016-1413-7

Mathematics Subject Classification ID

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

Related Items (5)

EXPANDING THE REALS BY CONTINUOUS FUNCTIONS ADDS NO COMPUTATIONAL POWER ⋮ Complexity profiles and generic Muchnik reducibility ⋮ Degree spectra of real closed fields ⋮ COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS ⋮ Degree spectra of structures

Cites Work

• COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS
• COMPARING TWO VERSIONS OF THE REALS
• Degrees in Which the Recursive Sets are Uniformly Recursive
• COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS
• Unnamed Item
• Unnamed Item

This page was built for publication: Generic Muchnik reducibility and presentations of fields