Pointwise complexity of the derivative of a computable function

DOI10.1007/s00153-021-00769-4OpenAlexW3156148984MaRDI QIDQ2238149

Ethan McCarthy

Publication date: 29 October 2021

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-021-00769-4

zbMATH Keywords

differentiationcomputability theorycomputable analysisalgorithmic randomnesslayerwise computabilityhalting set

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of Kurtz randomness by a differentiation theorem
• Schnorr randomness and the Lebesgue differentiation theorem
• Computability of the Radon-Nikodym Derivative
• Algorithmic Randomness and Complexity
• Randomness and differentiability
• An Application of Martin-Löf Randomness to Effective Probability Theory
• Applications of Effective Probability Theory to Martin-Löf Randomness
• On the Computability of Conditional Probability
• Computability and Randomness
• A property of derivatives

This page was built for publication: Pointwise complexity of the derivative of a computable function