The Turing universe in the context of enumeration reducibility Mariya I. Soskova Sofia University and University of California, Berkeley A fundamental goal of computability theory is to understand the way that - Enumeration - Document - PDFSEARCH.IO

First Page	Meta Content
	The Turing universe in the context of enumeration reducibility Mariya I. Soskova Sofia University and University of California, Berkeley A fundamental goal of computability theory is to understand the way that Add to Reading List Document Date: 2013-11-11 20:32:42 Open Document File Size: 288,53 KB Share Result on Facebook Company G. For / / Facility University of California / Mariya I. Soskova Sofia University / Sofia University / / IndustryTerm e-degrees / e-degree / / Organization Sofia University / c.e. / University of California / Berkeley / Science Fund / Mariya I. Soskova Sofia University / DSe / / Person Cooper / Mariya I. Soskova / / ProvinceOrState California / / SocialTag Mathematics Turing degree Turing reduction Turing jump Enumeration Low Recursively enumerable set Arithmetical hierarchy Halting problem Computability theory

The Turing universe in the context of enumeration reducibility Mariya I. Soskova Sofia University and University of California, Berkeley A fundamental goal of computability theory is to understand the way thatAdd to Reading List