Index Sets and Universal Numberings

dc.contributor.authorJAIN, Sanjayen_US
dc.contributor.authorSTEPHAN, Franken_US
dc.contributor.authorTEUTSCH, Jasonen_US
dc.date.accessioned2009-03-17T01:51:08Zen_US
dc.date.accessioned2017-01-23T07:00:13Z
dc.date.available2009-03-17T01:51:08Zen_US
dc.date.available2017-01-23T07:00:13Z
dc.date.issued2009-03-17T01:51:08Zen_US
dc.description.abstractThis paper studies the Turing degrees of various properties defined for universal numberings, that is, for numberings which list all partial-recursive functions. In particular properties relating to the domain of the corresponding functions are investigated like the set DEQ of all pairs of indices of functions with the same domain, the set DMIN of all minimal indices of sets and DMIN* of all indices which are minimal with respect to equality of the domain modulo finitely many differences. A partial solution to a question of Schaefer is obtained by showing that for every universal numbering with the Kolmogorov property, the set DMIN* is Turing equivalent to the double jump of the halting problem. Furthermore, it is shown that the join of DEQ and the halting problem is Turing equivalent to the jump of the halting problem and that there are numberings for which DEQ itself has 1-generic Turing degree.en_US
dc.format.extent256647 bytesen_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.urihttps://dl.comp.nus.edu.sg/xmlui/handle/1900.100/2901en_US
dc.language.isoenen_US
dc.relation.ispartofseriesTRA3/09en_US
dc.titleIndex Sets and Universal Numberingsen_US
dc.typeTechnical Reporten_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TRA3-09.pdf
Size:
250.63 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.53 KB
Format:
Plain Text
Description: