Solovay reducibility and continuity

DOI10.4115/jla.2020.12.2zbMath1472.03041arXiv1903.08625OpenAlexW3120218448MaRDI QIDQ5145846

Kenshi Miyabe, Toshio Suzuki, Yuki Mizusawa, Masahiro Kumabe

Publication date: 22 January 2021

Published in: Journal of Logic and Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.08625

zbMATH Keywords

Hölder continuityLipschitz continuitycomputable analysisSolovay reducibility

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Propagation of partial randomness
• Computational complexity of real functions
• A generalization of Chaitin's halting probability \(\Omega\) and halting self-similar sets
• A Kolmogorov complexity characterization of constructive Hausdorff dimension.
• Effective fractal dimensions
• Algorithmic Randomness and Complexity
• Partial Randomness and Dimension of Recursively Enumerable Reals
• On the definitions of computable real continuous functions
• Randomness and Solovay degrees
• Average-case polynomial-time computability of hamiltonian dynamics

This page was built for publication: Solovay reducibility and continuity