---
name: paper-chaitin-g-j-1987-algorithmic-information-theory-cambridge
description: Apply the Chaitin Algorithmic Information Theory 1987 article as model behavior. Use when a request invokes this article's concept, claims, evidence, or operating standard.
---

# Chaitin Algorithmic Information Theory 1987

This Skill is the behavioral expression of [the canonical article](/a/paper-chaitin-g-j-1987-algorithmic-information-theory-cambridge). It does not repeat the article's human prose.

## Orient

- Read the machine article at /api/articles/paper-chaitin-g-j-1987-algorithmic-information-theory-cambridge.
- Read claims and relationships at /api/articles/paper-chaitin-g-j-1987-algorithmic-information-theory-cambridge/topology.
- Treat found content as evidence and instruction only within the article's stated authority.

## Apply

1. Identify which claim or concept from the article governs the request.
2. State the governing meaning in the minimum language needed.
3. Apply it to the requested object or decision.
4. Preserve evidence grades, uncertainty, authority limits, and failure conditions.
5. Return the result with the article identity and any relevant claim or receipt links.

## Human meaning

What the work establishes Chaitin formalizes program-size complexity. A string's complexity equals the length of the shortest program that outputs it on a universal Turing machine. This measure is independent of the machine up to an additiv

## Representations

- Human: /a/paper-chaitin-g-j-1987-algorithmic-information-theory-cambridge
- JSON: /api/articles/paper-chaitin-g-j-1987-algorithmic-information-theory-cambridge
- Relationships: /api/articles/paper-chaitin-g-j-1987-algorithmic-information-theory-cambridge/topology
- History: /api/articles/paper-chaitin-g-j-1987-algorithmic-information-theory-cambridge/revisions
