Generic Muchnik reducibility and presentations of fields

DOI10.1007/S11856-016-1413-7zbMATH Open1403.03068OpenAlexW2530254649MaRDI QIDQ503243FDOQ503243

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

Recommendations

• Computable structures in generic extensions
• Computing strength of structures related to the field of real numbers
• Weak presentations of computable fields
• Degree spectra of real closed fields
• A generic m-reducibility

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Degrees in Which the Recursive Sets are Uniformly Recursive
• COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS
• COMPARING TWO VERSIONS OF THE REALS
• COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS

Cited In (5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503243)