On the Simplicity of Busy Beaver Sets


Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
DOI 10.1002/malq.19780241303
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 47,350
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Noncomplex Sequences: Characterizations and Examples.Robert P. Daley - 1976 - Journal of Symbolic Logic 41 (3):626-638.
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 & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669-677.

View all 8 references / Add more references

Citations of this work BETA

Busy Beaver Sets and the Degrees of Unsolvability.Robert P. Daley - 1981 - Journal of Symbolic Logic 46 (3):460-474.

Add more citations

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.
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 - 2002 - In Arnold Zellner, Hugo A. Keuzenkamp & Michael McAleer (eds.), Simplicity, Inference, and Modelling. Cambridge: Cambridge University Press. pp. 13-32.
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.J. Woodward - 2014 - British Journal for the Philosophy of Science 65 (1):91-123.
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 index
2016-02-04

Total views
25 ( #378,772 of 2,291,129 )

Recent downloads (6 months)
3 ( #399,576 of 2,291,129 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature