Randomness and reducibility
type: Item
instance of: scholarly article
title: Randomness and reducibility
zbMATH Open document ID: 1072.03024
author: Denis R. Hirschfeldt
author: Geoff LaForte
author: Rodney G. Downey
published in: Journal of Computer and System Sciences
publication date: 2004-09-08T00:00:00Z
Mathematics Subject Classification ID: 03D80
Mathematics Subject Classification ID: 03D30
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 2099264
zbMATH Keywords: domination
zbMATH Keywords: Solovay reducibility
MaRDI profile type: Publication
full work available at URL: j.jcss.2003.07.004
OpenAlex ID: W2019259942
cites work: Q4513960
cites work: Weakly computable real numbers
cites work: Q5588648
cites work: A characterization of c. e. random reals
cites work: Q4326782
cites work: Q4941163
cites work: Q4938551
cites work: Q4381402
cites work: Q4520520
cites work: Q5626633
cites work: A Theory of Program Size Formally Identical to Information Theory
cites work: Algorithmic Information Theory
cites work: Incompleteness theorems for random reals
cites work: Q3995518
cites work: Algorithmic Randomness and Complexity
cites work: Randomness, computability, and density
cites work: Trivial Reals
cites work: Presentations of computably enumerable reals.
cites work: Kolmogorov complexity
cites work: Q4074808
cites work: Relatively recursive reals and real functions
cites work: On the definitions of some complexity classes of real numbers
cites work: On the continued fraction representation of computable real numbers
cites work: Q3214803
cites work: Three approaches to the quantitative definition of information*
cites work: Q5617439
cites work: Randomness and recursive enumerability
cites work: Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
cites work: Recursive real numbers
cites work: Q4070738
cites work: Q4070739
cites work: Q4117381
cites work: Q4337021
cites work: Q2754206
cites work: The definition of random sequences
cites work: A Kolmogorov complexity characterization of constructive Hausdorff dimension.
cites work: The fractal nature of Riem/Diff. I.
cites work: Q5494235
cites work: Recursive Real Numbers
cites work: Process complexity and effective random tests
cites work: Cohesive sets and recursively enumerable Dedekind cuts
cites work: Recursion Theory and Dedekind Cuts
cites work: Q3819052
cites work: Computability Theory and Differential Geometry
cites work: A formal theory of inductive inference. Part I
cites work: A formal theory of inductive inference. Part II
cites work: Q4140968
cites work: Constructive dimension equals Kolmogorov complexity
cites work: Von Mises' definition of random sequences reconsidered
cites work: There is no SW-complete c.e. real
cites work: THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
DOI: 10.1016/J.JCSS.2003.07.004
description: scientific article; zbMATH DE number 2099264