Results 221 to 230 of about 21,627 (255)

Algorithmic anxiety: AI, work, and the evolving psychological contract in digital discourse. [PDF]

Front Psychol
Shekhar A, Saurombe MD.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

ALGORITHMIC INFORMATION THEORY

1987
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by ...
exaly   +2 more sources

Algorithmic Information Theory and Undecidability

Synthese, 2000
Chaitin has proven that the halting probability \(\Omega=\sum\{2^{-|p|}\mid p\text{\;halts}\}\) of a universal Turing machine is not computable, and, moreover, that any recursively axiomatizable theory enables us to determine only finitely many digits of \(\Omega\).
openaire   +2 more sources

On the algorithmic foundation of information theory

IEEE Transactions on Information Theory, 1979
The information content of binary sequences is defined by minimal program complexity measures and is related to computable martingales. The equivalence of the complexity approach and the martingale approach after restriction to effective random tests is used to establish generalized source coding theorems and converses.
openaire   +2 more sources

Algorithmic Information Theory

1993
Algorithmic information theory uses the notion of algorithm to measure the amount of information in a finite object. The corresponding definition was suggested in 1960s by Ray Solomonoff, Andrei Kolmogorov, Gregory Chaitin and others: the amount of information in a finite object, or its complexity, was defined as the minimal length of a program that ...
openaire   +1 more source

Analytic algorithmics, combinatorics, and information theory

IEEE Information Theory Workshop, 2005., 2005
Analytic information theory aims at studying problems of information theory using analytic techniques of computer science and combinatorics. Following Hadamard's and Knuth's precept, we tackle these problems by complex analysis methods such as generating functions, Mellin transform, Fourier series, saddle point method, analytic poissonization and de ...
openaire   +1 more source

Algorithmic Information Theory

2019
In this chapter, we review the basic framework of algorithmic information theory to the extent necessary to read the rest of the book.
openaire   +1 more source

A consistency algorithm based on information theory

Mathematical Population Studies, 1994
"This paper provides a geometric-mean solution to the consistency problem of multidimensional demographic projection models, based on the constrained minimization of an entropy function. A comparison with the existing harmonic-mean solution yields many similarities and almost no differences....However, one major advantage of the geometric mean is that
openaire   +2 more sources

Algorithmic Information Theory and Computational Complexity

2013
We present examples where theorems on complexity of computation are proved using methods in algorithmic information theory. The first example is a non-effective construction of a language for which the size of any deterministic finite automaton exceeds the size of a probabilistic finite automaton with a bounded error exponentially.
openaire   +1 more source