On the Simplicity of Busy Beaver Sets

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 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

Links

PhilArchive



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

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

On the Simplicity of Busy Beaver Sets.Robert P. Daley - 1978 - Mathematical Logic Quarterly 24 (13‐14):207-224.
Busy Beaver sets and the degrees of unsolvability.Robert P. Daley - 1981 - Journal of Symbolic Logic 46 (3):460-474.
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.
Castor quadruplorum.Arnold Oberschelp, Karsten Schmidt-Göttsch & Günter Todt - 1988 - Archive for Mathematical Logic 27 (1):35-44.
Cuppability of Simple and Hypersimple Sets.Martin Kummer & Marcus Schaefer - 2007 - Notre Dame Journal of Formal Logic 48 (3):349-369.
Fast-Growing Functions and the P vs. NP Question.Francisco Doria - 2007 - Logic Journal of the IGPL 15 (5-6):445-455.
What is the problem of simplicity?Elliott Sober - 2001 - In Arnold Zellner, Hugo A. Keuzenkamp & Michael McAleer (eds.), Simplicity, Inference and Modelling: Keeping It Sophisticatedly Simple. New York: Cambridge University Press. pp. 13-32.
The Politics of Influence: Bruce Beaver's Letters to Live Poets.Robert Savage - 2002 - Colloquy 6.
Simply Impossible: A Case Against Divine Simplicity.R. T. Mullins - 2013 - Journal of Reformed Theology 7 (2):181-203.
Simplicity in the Best Systems Account of Laws of Nature.James Woodward - 2014 - British Journal for the Philosophy of Science 65 (1):91-123.
Simplicity, Truth, and Probability.Kevin T. Kelly - unknown
Simplicity and Ontologies The trade-off between simplicity of theories and sophistication of ontologies.Aaron Sloman - unknown
Simplicity of recursively enumerable sets.Robert W. Robinson - 1967 - Journal of Symbolic Logic 32 (2):162-172.
Classes bounded by incomplete sets.Kejia Ho & Frank Stephan - 2002 - Annals of Pure and Applied Logic 116 (1-3):273-295.

Analytics

Added to PP
2016-02-04

Downloads
33 (#480,801)

6 months
3 (#967,057)

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.
On complexity properties of recursively enumerable sets.M. Blum & I. Marques - 1973 - Journal of Symbolic Logic 38 (4):579-593.
On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.

View all 8 references / Add more references