关于Kolmogorov复杂度函数的近似不可计算性

{"title":"关于Kolmogorov复杂度函数的近似不可计算性","authors":"Ruslan Ishkuvatov, D. Musatov","doi":"10.1007/978-3-030-22996-2_20","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":436783,"journal":{"name":"Conference on Computability in Europe","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Approximate Uncomputability of the Kolmogorov Complexity Function\",\"authors\":\"Ruslan Ishkuvatov, D. Musatov\",\"doi\":\"10.1007/978-3-030-22996-2_20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":436783,\"journal\":{\"name\":\"Conference on Computability in Europe\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference on Computability in Europe\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-22996-2_20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference on Computability in Europe","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-22996-2_20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}