/
LATENT REFERENCES / TAG1

Busy Beaver Function

Archive curator and editor: Keigo Yoshida

This reference note belongs to Tag1 in Latent References, an archive curated by Keigo Yoshida. Its archive region is Alan Turing. The note preserves its source text and links so that readers can trace the material behind the 3D map.

Collection
Tag1
Archive region
Alan Turing

Archived reference note

English translation of the archived note. JP shows the original text. Source links and literal code are retained; the translation does not update or independently verify the source claims.

A busy beaver is a type of Turing machine studied in computability theory. The name derives from an English idiom meaning “workaholic.” A busy beaver starts processing with a blank tape and runs as long as possible, but ultimately halts. This gives an upper bound on the time and space (tape) length that a class of halting Turing machines can consume. The busy beaver function quantifies this upper bound and is an example of a noncomputable function. It can be proved that this function grows faster than any computable function. The concept was first introduced under the name “busy beaver game” in Tibor Radó’s (English-language article) 1962 paper “On Non-Computable Functions.” #list

Source updated 2026-09-11 · Snapshot 2026-10-08

Source links and calculated neighbors

Cosine values measure shared lexical features, not truth, agreement or identical meaning. Original reference links are labeled separately.

  • Turing MachineComputed lexical cosine similarity 0.108 · shared title, text, tags and references