2003/02/26 by G. J. Chaitin, Chaitin, G. J.
Mathematics · #68Q30 #FOS: Mathematics #History and Overview (math.HO) #math.HO #msc:68Q30
paper · pdf · doi:10.48550/arxiv.math/0302333
Written for DMTCS'03, Dijon, July 2003, 12 pages
arxiv created 2003/02/27 · arxiv updated 2009/11/30
Two philosophical applications of the concept of program-size complexity are discussed. First, we consider the light program-size complexity sheds on whether mathematics is invented or discovered, i.e., is empirical or is a priori. Second, we propose that the notion of algorithmic independence sheds light on the question of being and how the world of our experience can be partitioned into separate entities.