{"title":"不连续级别、极限可计算性和跳转操作符","authors":"Matthew de Brecht","doi":"10.1515/9781614518044.79","DOIUrl":null,"url":null,"abstract":"We develop a general theory of jump operators, which is intended to provide an abstraction of the notion of \"limit-computability\" on represented spaces. Jump operators also provide a framework with a strong categorical flavor for investigating degrees of discontinuity of functions and hierarchies of sets on represented spaces. We will provide a thorough investigation within this framework of a hierarchy of $\\Delta^0_2$-measurable functions between arbitrary countably based $T_0$-spaces, which captures the notion of computing with ordinal mind-change bounds. Our abstract approach not only raises new questions but also sheds new light on previous results. For example, we introduce a notion of \"higher order\" descriptive set theoretical objects, we generalize a recent characterization of the computability theoretic notion of \"lowness\" in terms of adjoint functors, and we show that our framework encompasses ordinal quantifications of the non-constructiveness of Hilbert's finite basis theorem.","PeriodicalId":359337,"journal":{"name":"Logic, Computation, Hierarchies","volume":"175 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":"{\"title\":\"Levels of discontinuity, limit-computability, and jump operators\",\"authors\":\"Matthew de Brecht\",\"doi\":\"10.1515/9781614518044.79\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We develop a general theory of jump operators, which is intended to provide an abstraction of the notion of \\\"limit-computability\\\" on represented spaces. Jump operators also provide a framework with a strong categorical flavor for investigating degrees of discontinuity of functions and hierarchies of sets on represented spaces. We will provide a thorough investigation within this framework of a hierarchy of $\\\\Delta^0_2$-measurable functions between arbitrary countably based $T_0$-spaces, which captures the notion of computing with ordinal mind-change bounds. Our abstract approach not only raises new questions but also sheds new light on previous results. For example, we introduce a notion of \\\"higher order\\\" descriptive set theoretical objects, we generalize a recent characterization of the computability theoretic notion of \\\"lowness\\\" in terms of adjoint functors, and we show that our framework encompasses ordinal quantifications of the non-constructiveness of Hilbert's finite basis theorem.\",\"PeriodicalId\":359337,\"journal\":{\"name\":\"Logic, Computation, Hierarchies\",\"volume\":\"175 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"30\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Logic, Computation, Hierarchies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/9781614518044.79\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logic, Computation, Hierarchies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/9781614518044.79","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Levels of discontinuity, limit-computability, and jump operators
We develop a general theory of jump operators, which is intended to provide an abstraction of the notion of "limit-computability" on represented spaces. Jump operators also provide a framework with a strong categorical flavor for investigating degrees of discontinuity of functions and hierarchies of sets on represented spaces. We will provide a thorough investigation within this framework of a hierarchy of $\Delta^0_2$-measurable functions between arbitrary countably based $T_0$-spaces, which captures the notion of computing with ordinal mind-change bounds. Our abstract approach not only raises new questions but also sheds new light on previous results. For example, we introduce a notion of "higher order" descriptive set theoretical objects, we generalize a recent characterization of the computability theoretic notion of "lowness" in terms of adjoint functors, and we show that our framework encompasses ordinal quantifications of the non-constructiveness of Hilbert's finite basis theorem.