Type:

Other

Description:

A busy beaver is a Turing machine that, when provided with a blank tape, does a lot of work. Formally, it is an ... -state ... -color Turing machine started on an initially blank tape that writes a maximum number ... of 1s or moves the head a maximum number ... before halting. This Demonstration shows most of the known values of historical and current busy beaver champions as discovered by several people over the last four decades. There are known values up to four states for two-color machines and explicit constructions give exact or lower bounds for other state and color pairs.

Subjects:

    Education Levels:

      Keywords:

      EUN,LOM,LRE4,work-cmr-id:397146,http://demonstrations.wolfram.com:http://demonstrations.wolfram.com/BusyBeaver/,ilox,learning resource exchange,LRE metadata application profile,LRE

      Language:

      Access Privileges:

      Public - Available to anyone

      License Deed:

      Creative Commons Attribution 3.0

      Collections:

      None
      This resource has not yet been aligned.
      Curriki Rating
      'NR' - This resource has not been rated
      NR
      'NR' - This resource has not been rated

      This resource has not yet been reviewed.

      Not Rated Yet.

      Non-profit Tax ID # 203478467