Strong reductions in effective randomness
type: Item
instance of: scholarly article
title: Strong reductions in effective randomness
zbMATH Open document ID: 1283.68170
author: Laurent Bienvenu
author: Christopher P. Porter
published in: Theoretical Computer Science
publication date: 2012-11-08T00:00:00Z
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 03D32
zbMATH DE Number: 6103622
zbMATH Keywords: algorithmic randomness
zbMATH Keywords: Demuth's theorem
zbMATH Keywords: computable analysis
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.06.031
OpenAlex ID: W2066889014
cites work: Constructive equivalence relations on computable probability measures
cites work: Q3789545
cites work: Algorithmic Randomness and Complexity
cites work: Hyperimmune-free degrees and Schnorr triviality
cites work: Kolmogorov complexity and the Recursion Theorem
cites work: Comparing notions of randomness
cites work: Q3758821
cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
cites work: Kolmogorov-Loveland randomness and stochasticity
cites work: Mathematical metaphysics of randomness
cites work: Computability and Randomness
cites work: Randomness, relativization and Turing degrees
cites work: Measures and their random reals
cites work: Computable randomness and betting for computable probability spaces
cites work: General random sequences and learnable sequences
cites work: Q4040892
DOI: 10.1016/J.TCS.2012.06.031
description: scientific article; zbMATH DE number 6103622