1999American Journal of PhysicsRequires access

Entropy, information, and computation

Jonathan Machta

Open publisher page 74 citations

Abstract

The relation between entropy, information, and randomness is discussed. Algorithmic information theory is introduced and used to provide a fundamental definition of entropy. The relation between algorithmic entropy and the usual Shannon–Gibbs entropy is discussed.

About this research paper

What this paper is about

The relation between entropy, information, and randomness is discussed. Algorithmic information theory is introduced and used to provide a fundamental definition of entropy. The relation between algorithmic entropy and the usual Shannon–Gibbs entropy is discussed.

Why it matters

OpenAlex reports 74 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The relation between entropy, information, and randomness is discussed. Algorithmic information theory is introduced and used to provide a fundamental definition of entropy. The relation between algorithmic entropy and the usual Shannon–Gibbs entropy is discussed.

Key concepts: Randomness, Information diagram, Maximum entropy thermodynamics, Statistical physics, Entropy (arrow of time), Joint entropy, Physics, Rényi entropy

Related papers

Back to paper searchBrowse research topicsOriginal source
Entropy, information, and computation — Research Paper | ScholarLens