algorithmic probability theory

Current License: CC BY-SA 3.0

9 events

when toggle format	what		by	license	comment
Sep 16, 2013 at 10:03	comment	added	Bas Spitters		Is your question related to this one? mathoverflow.net/questions/141764/…
May 2, 2012 at 12:51	history	edited	Ed Dean		edited tags
May 2, 2012 at 12:51	comment	added	Ed Dean		@James: I took the liberty of adding the lo.logic tag as Jason suggested, since that might get you some feedback beyond my somewhat deflationary answer.
Apr 10, 2012 at 18:56	comment	added	Jason Rute		I forgot to add proof mining to the above list. It is an application of proof theory which can be used to extract numerical bounded from (apparently) noneffective proofs.
Apr 10, 2012 at 18:53	comment	added	Jason Rute		There are a lot of similar efforts in this regard: algorithmic randomness, computable analysis, constructive math, and reverse mathematics. As Ed Dean pointed out, the theory of computation for analytic objects is fairly well-understood. What is left is to work out the details for each theorem. For example, if a theorem asserts the existence of an object, when is it computable? Is there a specific application/theorem you had in mind? (I work in these fields and I am very interested in what the computational concerns are of analysts, probabilists, and ergodic-theorists.)
Apr 10, 2012 at 18:22	comment	added	Jason Rute		It might be helpful to add a lo.logic tag, since I think this is where much of this work is being done in.
Apr 3, 2012 at 5:10	answer	added	Ed Dean		timeline score: 4
Apr 3, 2012 at 3:32	history	edited	Ori Gurel-Gurevich		retag
Apr 3, 2012 at 2:11	history	asked	James Propp	CC BY-SA 3.0