On Some Complexity Characteristics of Immune Sets

Mathematical Logic Quarterly 41 (3):307-313 (1995)
  Copy   BIBTEX

Abstract

We suggest some new ways to effectivize the definitions of several classes of simple sets. On this basis, new completeness criterions for simple sets are obtained. In particular, we give descriptions of the class of complete maximal sets

Categories

Keywords

Reprint years

DOI

10.1002/malq.19950410303

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,654

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

Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity.B. Bauwens & A. Shen - 2014 - Journal of Symbolic Logic 79 (2):620-632.
Cuppability of Simple and Hypersimple Sets.Martin Kummer & Marcus Schaefer - 2007 - Notre Dame Journal of Formal Logic 48 (3):349-369.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
The K -Degrees, Low for K Degrees,and Weakly Low for K Sets.Joseph S. Miller - 2009 - Notre Dame Journal of Formal Logic 50 (4):381-391.
On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin.Keng Meng Ng - 2009 - Notre Dame Journal of Formal Logic 50 (4):469-493.
Hypersimplicity and semicomputability in the weak truth table degrees.George Barmpalias - 2005 - Archive for Mathematical Logic 44 (8):1045-1065.
Kolmogorov complexity estimates for detection of viruses in biologically inspired security systems: A comparison with traditional approaches.Sanjay Goel & Stephen F. Bush - 2003 - Complexity 9 (2):54-73.
Some New Lattice Constructions in High R. E. Degrees.Heinrich Rolletschek - 1995 - Mathematical Logic Quarterly 41 (3):395-430.
About Segment Complexity of Turing Reductions.Valeriy K. Bulitko - 1999 - Mathematical Logic Quarterly 45 (4):561-571.
Effective bounds for convergence, descriptive complexity, and natural examples of simple and hypersimple sets.Andrej Muchnik & Alexei Semenov - 2006 - Annals of Pure and Applied Logic 141 (3):437-441.
Immunity and Hyperimmunity for Sets of Minimal Indices.Frank Stephan & Jason Teutsch - 2008 - Notre Dame Journal of Formal Logic 49 (2):107-125.
Kolmogorov Complexity and Noncomputability.George Davie - 2002 - Mathematical Logic Quarterly 48 (4):574-581.
Invariant Constructions of Simple and Maximal Sets.Frank P. Weber - 1995 - Mathematical Logic Quarterly 41 (2):143-160.
Introduction to Complexity and Complex Systems.Robert B. Northrop - 2010 - Taylor & Francis.

Analytics

Added to PP
2013-12-01

Downloads
6 (#1,475,089)

6 months
1 (#1,498,899)

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