Live briefing
Everything about Busy beaver
Concept in theoretical computer science
In theoretical computer science, a busy beaver is a Turing program that generates the longest finite output among all programs with the same number of states. A program that generated a longer output must necessarily continue generating forever, i.e. cannot terminate. It is generally undecidable whether a given program is a busy beaver; hence examples are known only for the first few state counts. The busy beaver game aims to find new busy beaver examples. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Busy beaverA 5-minute orientation
- Skim a recent paper: Function-Based Conceptual Engineering and the Authority ProblemInfluential work since 2022
- Pick up a classic book: PrecalculusThe most-reprinted book on the subject
- Read the landmark paper: New Method for Calculating the One-Particle Green's Function with Application to the Electron-Gas ProblemCited 5,275 times
- Go sideways: ComputabilityA closely related topic
- Go sideways: Halting problemA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
New Method for Calculating the One-Particle Green's Function with Application to the Electron-Gas Problem
Green's Function for Lamb's Problem
Green's function of the cosmological thermalization problem
Sex Differences in Problem-Solving as a Function of Problem Context
The Problem with Function Points
The function of FUNCTION in LISP or why the FUNARG problem should be called the environment problem
Riemann’s zeta-function and the divisor problem
The Crossing Hazard Function Problem
🆕 Influential since 2022
Function-Based Conceptual Engineering and the Authority Problem
A fuzzy Gaussian process regression function approach for forecasting problem
Correlation function and the inverse problem in the BD interaction*
Half-space albedo problem for the Anlı-Güngör scattering function
$\theta$-metric function in the problem of minimization of functionals
đź“š Books worth reading
PrecalculusRon Larson, Roland E. Larson · 1900
CalculusRon Larson · 1988
Problems and theorems in analysisGeorge Pólya, Gábor Szegő · 1925
CalculusBruce H. Edwards, Ron Larson · 1900
CalculusJames Stewart · 1986
PrecalculusSheldon Jay Axler · 2007
Precalculus Functions And GraphsRon Larson · 1996
Single Variable CalculusJames Stewart · 1987
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Computability Computability is the ability to solve a problem by an effective procedure. It is a key topic of the field of computability theory within mathematical logic…
- Halting problem In computability theory, the halting problem is the decision problem of, given an arbitrary computer program and an input, determining whether said program…
- Turing machine examples The following are examples to supplement the article Turing machine. The following table is Turing's very first example (Turing 1937): "1. A machine can…
- Post–Turing machine A Post machine or Post–Turing machine is a "program formulation" of a type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model…
- Computable function Computable functions are the basic objects of study in computability theory. Informally, a function is computable if there is an algorithm that computes…
- Semi-Thue system In theoretical computer science and mathematical logic a string rewriting system (SRS), historically called a semi-Thue system, is a rewriting system over…
- Post's theorem In computability theory, Post's theorem, named after Emil Post, describes the connection between the arithmetical hierarchy and the Turing degrees. The…
- Turing machine A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table…