Identifying randomness given by high descriptive complexity
type: Item
instance of: scholarly article
title: Identifying randomness given by high descriptive complexity
zbMATH Open document ID: 0805.68065
DOI: 10.1007/BF00998683
published in: Acta Applicandae Mathematicae
publication date: 1995-01-26T00:00:00Z
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 60A99
Mathematics Subject Classification ID: 03D80
zbMATH DE Number: 572242
zbMATH Keywords: Kolmogorov-Chaitin complexity
zbMATH Keywords: random series
zbMATH Keywords: random combinatorial configurations
author: Willem Louw Fouché
MaRDI profile type: Publication
cites work: On the Length of Programs for Computing Finite Binary Sequences
cites work: Algorithmic Information Theory
cites work: Probabilities over rich languages, testing and randomness
cites work: Q3205333
cites work: Q4146722
cites work: Q3687398
cites work: Q3214803
cites work: The definition of random sequences
cites work: Process complexity and effective random tests
cites work: Von Mises' definition of random sequences reconsidered
cites work: The Law of the Iterated Logarithm for Random Kolmogorov, or Chaotic, Sequences
full work available at URL: https://doi.org/10.1007/bf00998683
OpenAlex ID: W2165105466
description: scientific article; zbMATH DE number 572242