Heiner Marxen and Jürgen Buntrock. Attacking the busy beaver 5. Bulletin of the European Association for Theoretical Computer Science, no. 40 , pp. 247–251. - Pascal Michel. Busy beaver competition and Collatz-like problems. Archive for mathematical logic, vol. 32 , pp. 351–367 [Book Review]

Journal of Symbolic Logic 63 (1):331-332 (1998)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2586607

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Busy beaver competition and Collatz-like problems.Pascal Michel - 1993 - Archive for Mathematical Logic 32 (5):351-367.
Review: Pascal Michel, Busy Beaver Competition and Collatz-Like Problems. [REVIEW]Allen H. Brady - 1998 - Journal of Symbolic Logic 63 (1):331-332.
On the Simplicity of Busy Beaver Sets.Robert P. Daley - 1978 - Mathematical Logic Quarterly 24 (13‐14):207-224.
The Busy Beaver Game and the Meaning of Life.Arnold Oberschelp & Allen H. Brady - 1991 - Journal of Symbolic Logic 56 (3):1091.
Castor quadruplorum.Arnold Oberschelp, Karsten Schmidt-Göttsch & Günter Todt - 1988 - Archive for Mathematical Logic 27 (1):35-44.
Busy Beaver sets and the degrees of unsolvability.Robert P. Daley - 1981 - Journal of Symbolic Logic 46 (3):460-474.
Proceedings Symposium on Logic in Computer Science, Ithaca, New York, June 22-25, 1987 ; Sponsored by the Computer Society of the Ieee Technical Committee on Mathematical Foundations of Computing in Cooperation with Acm Sigact, Association for Symbolic Logic, European Association for Theoretical Computer Science.Association for Computing Machinery, Association for Symbolic Logic, European Association for Theoretical Computer Science, Ieee Computer Society & Special Interest Group for Automata and Computability Theory - 1987
On the Simplicity of Busy Beaver Sets.Robert P. Daley - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (13-14):207-224.
Fast-Growing Functions and the P vs. NP Question.Francisco Doria - 2007 - Logic Journal of the IGPL 15 (5-6):445-455.
Temporal Logic of Programs.Fred Kröger - 1987 - Springer.
Proceedings: June 4-7, 1990, Philadelphia, PA.. 5.Association for Symbolic Logic, Acm Special Interest Group for Automata and Computability Theory, European Association for Theoretical Computer Science & Ieee Computer Society - 1990
Proceedings: New Brunswick, New Jersey. July 27-30, 1996. 11 (1996).Association for Symbolic Logic, Acm Special Interest Group for Automata and Computability Theory, European Association for Theoretical Computer Science & Ieee Computer Society - 1996
Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science: July 15-18, 1991 Amsterdam, The Netherlands.Association for Symbolic Logic, Acm Special Interest Group for Automata and Computability Theory, European Association for Theoretical Computer Science & Ieee Computer Society - 1991
Computer Science Logic 9th International Workshop, Csl '95, Annual Conference of the Eacsl, Paderborn, Germany, September 22-29, 1995 : Selected Papers'.H. Kleine Büning & European Association for Computer Science Logic - 1996 - Springer Verlag.
Walking Cautiously Into the Collatz Wilderness: Algorithmically, Number Theoretically, Randomly.Edward G. Belaga & Maurice Mignotte - 2006 - Discrete Mathematics and Theoretical Computer Science.

Analytics

Added to PP
2014-03-29

Downloads
54 (#289,891)

6 months
11 (#225,837)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references