Busy beaver
id:
busy-beaver-162-5275051
title:
Busy beaver
text:
In theoretical computer science, the busy beaver game aims at finding a terminating program of a given size that either produces the most output possible, or runs for the longest number of steps. Since an endlessly looping program producing infinite output or running for infinite time is easily conceived, such programs are excluded from the game. Rather than traditional programming languages, the programs used in the game are n-state Turing machines, one of the first mathematical models of compu
brand slug:
wiki
category slug:
encyclopedia
description:
Longest-running Turing machine of a given size
original url:
https://en.wikipedia.org/wiki/Busy_beaver
date created:
2002-08-05T07:42:54Z
date modified:
2024-08-28T06:43:14Z
main entity:
{"identifier":"Q1427965","url":"https://www.wikidata.org/entity/Q1427965"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/1/18/Busy_Beaver_5_State_2_Color.png","width":720,"height":864}
fields total:
13
integrity:
16