L1-Computability, Layerwise Computability and Solovay Reducibility

DOI10.3233/COM-13015zbMath1315.03073OpenAlexW2168573173MaRDI QIDQ2851186

Kenshi Miyabe

Publication date: 10 October 2013

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-13015

zbMATH Keywords

computable analysisalgorithmic randomnessSolovay reducibilitylayerwise computability\(L^1\)-computability

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78)

Related Items (9)

Randomness extraction in computability theory ⋮ Reducibilities relating to Schnorr randomness ⋮ When does randomness come from randomness? ⋮ Schnorr randomness for noncomputable measures ⋮ Computability on measurable functions ⋮ A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS ⋮ Algorithmic randomness and Fourier analysis ⋮ Decomposing Borel functions using the Shore–Slaman join theorem ⋮ Computable Measure Theory and Algorithmic Randomness

This page was built for publication: L1-Computability, Layerwise Computability and Solovay Reducibility