Concepedia

Busy Beaver Function

The Busy Beaver Function is a non-computable function in theoretical computer science that assigns to each positive integer n the maximum number of steps a halting Turing machine with n states and a two-symbol alphabet can perform when started on a blank tape.

18

Publications

569

Citations

42

Authors

23

Institutions

Publications per year

2017–2026

0

Parents

Publications

18

1Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines

Fernando Soler Toscano, Héctor Zenil, Jean-Paul Delahaye et al. · 2014 · 167 citations · Full text

, , +16

Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM

Sarah Cannon, Erik D. Demaine, Martin L. Demaine et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2013 · 51 citations · Full text

, , +10

Attacking the Busy Beaver 5.

Heiner Marxen, Jürgen Buntrock · 1990 · 46 citations

, , +2

Beaver Management and Ecology in Wyoming

Reed W. Fautin, James E. Grasse, Euvern F. Putnam · Journal of Wildlife Management · 1950 · 37 citations · Full text

, , +12

Graph based crossover – a case study with the Busy Beaver problem

Francisco B. Pereira, Penousal Machado, Ernesto Costa et al. · 1999 · 31 citations

, , +11

1–5 of 18

Authors

42

  1. HZ
    Héctor Zenil

    Karolinska Institutet, Sweden

    3 publications · 209 citations

    3

    h-index

  2. MP
    Michel Pascal

    Centre National de la Recherche Scientifique, France

    3 publications · 75 citations

    3

    h-index

  3. FS
    Fernando Soler Toscano

    Universidad de Sevilla, Spain

    2 publications · 187 citations

    2

    h-index

  4. JD
    Jean-Paul Delahaye

    Laboratoire d'Informatique Fondamentale de Lille, France

    2 publications · 187 citations

    2

    h-index

  5. NG
    Nicolas Gauvrit

    École Pratique des Hautes Études, France

    2 publications · 187 citations

    2

    h-index

1–5 of 42

Institutions

23

  1. Laboratoire de Recherche Scientifique

    Paris, France

    2 h-index

    5 publications

    688 citations

  2. Karolinska Institutet

    Stockholm, Sweden

    2 h-index

    2 publications

    187 citations

  3. Universidad de Sevilla

    Seville, Spain

    2 h-index

    2 publications

    187 citations

  4. École Pratique des Hautes Études

    Paris, France

    2 h-index

    2 publications

    187 citations

  5. Rensselaer Polytechnic Institute

    Troy, United States

    1 h-index

    8 publications

    120 citations

  6. Université de Lille

    Lille, France

    1 h-index

    1 publications

    167 citations

  7. University of Notre Dame

    Notre Dame, United States

    1 h-index

    1 publications

    12 citations

  8. Académie de Versailles

    Versailles, France

    1 h-index

    1 publications

    29 citations

1–8 of 23

Venues

  1. IEEE Transactions on Electronic Computers

    2 publications · 36 citations

    2

    h-index

  2. Complex Systems

    1 publications · 22 citations

    1

    h-index

  3. Theoretical Computer Science

    1 publications · 29 citations

    1

    h-index

  4. Contemporary Hypnosis

    1 publications · 18 citations

    1

    h-index

  5. Applied Mathematics and Computation

    1 publications · 15 citations

    1

    h-index

1–5