Mathematics > Logic
[Submitted on 30 Apr 2014 (v1), last revised 27 Feb 2015 (this version, v2)]
Title:Asymptotic density, immunity, and randomness
View PDFAbstract:In 2012, inspired by developments in group theory and complexity, Jockusch and Schupp introduced generic computability, capturing the idea that an algorithm might work correctly except for a vanishing fraction of cases. However, we observe that their definition of a negligible set is not computably invariant (and thus not well-defined on the 1-degrees), resulting in some failures of intuition and a break with standard expectations in computability theory.
To strengthen their approach, we introduce a new notion of intrinsic asymptotic density, with rich relations to both randomness and classical computability theory. We then apply these ideas to propose alternative foundations for further development in (intrinsic) generic computability.
Toward these goals, we classify intrinsic density 0 as a new immunity property, specifying its position in the standard hierarchy from immune to cohesive for both general and $\Delta^0_2$ sets, and identify intrinsic density $\frac{1}{2}$ as the stochasticity corresponding to permutation randomness. We also prove that Rice's Theorem extends to all intrinsic variations of generic computability, demonstrating in particular that no such notion considers $\emptyset'$ to be "computable".
Submission history
From: Eric Astor [view email][v1] Wed, 30 Apr 2014 20:23:38 UTC (23 KB)
[v2] Fri, 27 Feb 2015 19:52:17 UTC (60 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.