The Busy Beaver Game consists of designing a halting, binary-alphabet Turing Machine which writes the most 1s on the tape, using only a limited setâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2009

2009

- Norbert BÃ¡tfai
- ArXiv
- 2009

Many programmers belive that Turing-based machines cannot think. We also believe in this, however it is interesting to note thatâ€¦Â (More)

Is this relevant?

2006

2006

- James Harland
- CATS
- 2006

The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and isâ€¦Â (More)

Is this relevant?

2004

2004

- Pascal Michel
- Theor. Comput. Sci.
- 2004

Let TM(k, l) be the set of one-tape Turing machines with k states and l symbols. It is known that the halting problem isâ€¦Â (More)

Is this relevant?

2004

2004

- Alex Holkner
- 2004

ABSTRACT: A busy beaver is a Turing machine of N states which, given a blank tape, halts with an equal or higher number ofâ€¦Â (More)

Is this relevant?

1999

1999

The Busy Beaver is an interesting theoretical problem proposed by Rado in 1962, in the context of the existence of non computableâ€¦Â (More)

Is this relevant?

1999

1999

The Busy Beaver is an interesting theoretical problem proposed by Tibor Rado in 1962. Since then, it has attracted the attentionâ€¦Â (More)

Is this relevant?

1999

1999

The success of the application of evolutionary approaches depends, to a large extent, on problem representation and on the usedâ€¦Â (More)

Is this relevant?

1993

1993

- Terry Jones, Gregory J. E. Rawlins
- ICGA
- 1993

This paper introduces a new analysis tool called reverse hillclimbing, and demonstrates how it can be used to evaluate theâ€¦Â (More)

Is this relevant?

1990

1990

- Heiner Marxen, JÃ¼rgen Buntrock
- Bulletin of the EATCS
- 1990

Since T. Rado in 1962 defined the busy beaver game several approaches have used computer technology to search busy beavers orâ€¦Â (More)

Is this relevant?

1982

1982

- Robert P. Daley
- Information and Control
- 1982

Busy beaver sets have proved themselves useful as examples for certain interesting properties in recursive function theory andâ€¦Â (More)

Is this relevant?