On the Simplicity of Busy Beaver Sets

Mathematical Logic Quarterly 24 (13‐14):207-224 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19780241303

Other Versions

reprint Daley, Robert P. (1978) "On the Simplicity of Busy Beaver Sets". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24(13-14):207-224

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,297

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 sets and the degrees of unsolvability.Robert P. Daley - 1981 - Journal of Symbolic Logic 46 (3):460-474.
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. [REVIEW]Allen H. Brady - 1998 - Journal of Symbolic Logic 63 (1):331-332.
Busy beaver competition and Collatz-like problems.Pascal Michel - 1993 - Archive for Mathematical Logic 32 (5):351-367.
The Busy Beaver Game and the Meaning of Life.Arnold Oberschelp & Allen H. Brady - 1991 - Journal of Symbolic Logic 56 (3):1091.
A Tukey decomposition of ~k~a~p~p~aLambda and the tree property for directed sets.Masayuki Karato - 2005 - Mathematical Logic Quarterly 51 (3):305.
Fast-Growing Functions and the P vs. NP Question.Francisco Doria - 2007 - Logic Journal of the IGPL 15 (5-6):445-455.
Robert W. Robinson. Simplicity of recursively enumerable sets.The journal of symbolic logic, vol. 32 , pp. 162–172. - Robert W. Robinson. Two theorems on hyperhypersimple sets. Transactions of the American Mathematical Society, vol. 128 , pp. 531–538. - A. H. Lachlan. On the lattice of recursively enumerable sets.Transactions of the American Mathematical Society, vol. 130 , pp. 1–37. - A. H. Lachlan. The elementary theory of recursively enumerable sets. Duke mathematical journal, vol. 35 , pp. 123–146. [REVIEW]James C. Owings - 1970 - Journal of Symbolic Logic 35 (1):153-155.
Castor quadruplorum.Arnold Oberschelp, Karsten Schmidt-Göttsch & Günter Todt - 1988 - Archive for Mathematical Logic 27 (1):35-44.

Analytics

Added to PP
2013-11-24

Downloads
18 (#1,119,623)

6 months
3 (#1,480,774)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Busy Beaver sets and the degrees of unsolvability.Robert P. Daley - 1981 - Journal of Symbolic Logic 46 (3):460-474.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references