{"title":"廉价非标准分析和可计算性:一些应用","authors":"Olivier Bournez, S. Ouazzani","doi":"10.1109/SYNASC.2018.00034","DOIUrl":null,"url":null,"abstract":"Non standard Analysis is an area of Mathematics dealing with notions of infinitesimal and infinitely large numbers, in which many statements from classical Analysis can be expressed very naturally. Cheap non-standard analysis introduced by Terence Tao in 2012 is based on the idea that considering that a property holds eventually is sufficient to give the essence of many of its statements. Cheap non-standard analysis provides constructivity but at some (acceptable) price. Computable Analysis is a very natural tool for discussing computations over the reals, and more general constructivity in Mathematics. In a recent article, we considered computability in cheap non-standard analysis. We proved that many concepts from computable analysis as well as several concepts from computability can be very elegantly and alternatively presented in this framework. We discuss in the current article several applications of this framework: We provide alternative proofs based on this approach of several statements from computable analysis. This includes intermediate value theorem, and computability of zeros, of maximum points and of a theorem from Rice.","PeriodicalId":273805,"journal":{"name":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"13 5","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Cheap Non-Standard Analysis and Computability: Some Applications\",\"authors\":\"Olivier Bournez, S. Ouazzani\",\"doi\":\"10.1109/SYNASC.2018.00034\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Non standard Analysis is an area of Mathematics dealing with notions of infinitesimal and infinitely large numbers, in which many statements from classical Analysis can be expressed very naturally. Cheap non-standard analysis introduced by Terence Tao in 2012 is based on the idea that considering that a property holds eventually is sufficient to give the essence of many of its statements. Cheap non-standard analysis provides constructivity but at some (acceptable) price. Computable Analysis is a very natural tool for discussing computations over the reals, and more general constructivity in Mathematics. In a recent article, we considered computability in cheap non-standard analysis. We proved that many concepts from computable analysis as well as several concepts from computability can be very elegantly and alternatively presented in this framework. We discuss in the current article several applications of this framework: We provide alternative proofs based on this approach of several statements from computable analysis. This includes intermediate value theorem, and computability of zeros, of maximum points and of a theorem from Rice.\",\"PeriodicalId\":273805,\"journal\":{\"name\":\"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"13 5\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC.2018.00034\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC.2018.00034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cheap Non-Standard Analysis and Computability: Some Applications
Non standard Analysis is an area of Mathematics dealing with notions of infinitesimal and infinitely large numbers, in which many statements from classical Analysis can be expressed very naturally. Cheap non-standard analysis introduced by Terence Tao in 2012 is based on the idea that considering that a property holds eventually is sufficient to give the essence of many of its statements. Cheap non-standard analysis provides constructivity but at some (acceptable) price. Computable Analysis is a very natural tool for discussing computations over the reals, and more general constructivity in Mathematics. In a recent article, we considered computability in cheap non-standard analysis. We proved that many concepts from computable analysis as well as several concepts from computability can be very elegantly and alternatively presented in this framework. We discuss in the current article several applications of this framework: We provide alternative proofs based on this approach of several statements from computable analysis. This includes intermediate value theorem, and computability of zeros, of maximum points and of a theorem from Rice.