{"title":"谁问我们?计算理论如何回答有关分析的问题","authors":"J. H. Lutz, Neil Lutz","doi":"10.1007/978-3-030-41672-0_4","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":283980,"journal":{"name":"Complexity and Approximation","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Who Asked Us? How the Theory of Computing Answers Questions about Analysis\",\"authors\":\"J. H. Lutz, Neil Lutz\",\"doi\":\"10.1007/978-3-030-41672-0_4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":283980,\"journal\":{\"name\":\"Complexity and Approximation\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Complexity and Approximation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-41672-0_4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complexity and Approximation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-41672-0_4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}