A fundamental goal of computability theory is to understand the way that objects relate to each other in terms of their information content. We wish to understand the relative information content between sets of natural numbers, how one subset of the natural numbers Y can be used to specify another one X. This specification can be computational, or arithmetic, or even by the application of a countable sequence of Borel operations. Each notion in the spectrum gives rise to a different model of relative computability. Which of these models best reflects the real world computation is under question. © 2013 Springer-Verlag.
CITATION STYLE
Soskova, M. I. (2013). The Turing universe in the context of enumeration reducibility. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7921 LNCS, pp. 371–382). https://doi.org/10.1007/978-3-642-39053-1_44
Mendeley helps you to discover research relevant for your work.