{"title":"Solutions to Selected Exercises","authors":"J. Stillwell","doi":"10.23943/princeton/9780691197296.003.0006","DOIUrl":"https://doi.org/10.23943/princeton/9780691197296.003.0006","url":null,"abstract":"This chapter develops the basic results of computability theory, many of which are about noncomputable sequences and sets, with the goal of revealing the limits of computable analysis. Two of the key examples are a bounded computable sequence of rational numbers whose limit is not computable, and a computable tree with no computable infinite path. Computability is an unusual mathematical concept, because it is most easily used in an informal way. One often talks about it in terms of human activities, such as making lists, rather than by applying a precise definition. Nevertheless, there is a precise definition of computability, so this informal description of computations can be formalized.","PeriodicalId":119327,"journal":{"name":"Statistical Inference via Convex Optimization","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121115182","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Signal Recovery Beyond Linear Estimates","authors":"J. Stillwell","doi":"10.2307/j.ctvqsdxqd.13","DOIUrl":"https://doi.org/10.2307/j.ctvqsdxqd.13","url":null,"abstract":"This chapter explains why Σ0\u0000 1 formulas of Peano arithmetic (PA) capture all computably enumerable sets, as claimed by Alonzo Church's thesis from the previous chapter. This allows us to capture “computable analysis” in the language of PA, since computable sets and functions are definable in terms of computable enumerability. To justify the claim that Σ0\u0000 1 = “computably enumerable,” this chapter makes a thorough analysis of the concept of computation. It takes a precise, but intuitively natural, concept of computation and translates it into the language of PA. The chapter demonstrates that the translation is indeed Σ0\u0000 1, but with a slightly different (though equivalent) definition of Σ0\u0000 1.","PeriodicalId":119327,"journal":{"name":"Statistical Inference via Convex Optimization","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128304971","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}