Universality and Almost Decidability

@article{Calude2015UniversalityAA,
  title={Universality and Almost Decidability},
  author={Cristian S. Calude and Damien Desfontaines},
  journal={CoRR},
  year={2015},
  volume={abs/1505.01340}
}
We present and study new definitions of universal and program m ble universal unary functions and consider a new simplicity criterion: almost decidability o f the halting set. A set of positive integers S is almost decidable if there exists a decidable and generic (i.e. a set of natural density one) set whose intersection with S is decidable. Every decidable set is almost decidable, but the converse implication is false. We prove the existence of infinitely many universal functions whose… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Cooper.Computability Theory

  • S B.
  • Chapman & Hall/CRC London,
  • 2004
Highly Influential
4 Excerpts

Size and structure of universal Turing machines using Tag systems , in Recursive Function Theory

  • M. Minsky.
  • Proc . Symp . Pure Mathematics
  • 2012

Stay . Most programs stop quickly or never halt

  • M. A. C. S. Calude
  • Advances in Applied Mathematics
  • 2011

Similar Papers

Loading similar papers…