The Extent and Density of Sequences within the Minimal-Program Complexity Hierarchies

@article{Daley1974TheEA,
  title={The Extent and Density of Sequences within the Minimal-Program Complexity Hierarchies},
  author={Robert P. Daley},
  journal={J. Comput. Syst. Sci.},
  year={1974},
  volume={9},
  pages={151-163}
}
In this paper we examine the minimal-program complexity (i.e., the length of a shortest program for computing the initial segments) of recursively enumerable and A S sequences. We determine bounds on the upper and lower extent of these sequences within the complexity hierarchy. Many of these bounds are the best which can be effectively specified. Also the density of these sequences within the hierarchies is investigated. Of particular interest is the construction of nonrecursive sequences which… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
18 Extracted Citations
8 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-8 of 8 references

On the complexity of Boolean function minimization

  • M. KANOVI
  • Soviet Math. Dokl
  • 1971
1 Excerpt

On the decision complexity of algorithms

  • M. KANOVI
  • Soviet Math. Dokl
  • 1969
1 Excerpt

Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set

  • J. BARZDIN
  • Soviet Math. Dokl
  • 1968
2 Excerpts

Classes of R.E. sets of degrees of unsoivability

  • D. MARTIN
  • Z. Math. Logik Grundlagen Math
  • 1966
1 Excerpt

Three approaches for defining the concept of information quantity, Information Transmission

  • A. KOLMOGOROV
  • SEQUENCES IN COMPLEXITY
  • 1965
2 Excerpts

Similar Papers

Loading similar papers…