递归有界DNR函数的图灵度和Muchnik度

{"title":"递归有界DNR函数的图灵度和Muchnik度","authors":"S. G. Simpson","doi":"10.1007/978-3-319-50062-1_40","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions\",\"authors\":\"S. G. Simpson\",\"doi\":\"10.1007/978-3-319-50062-1_40\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":309016,\"journal\":{\"name\":\"Computability and Complexity\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computability and Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-319-50062-1_40\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computability and Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-319-50062-1_40","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}