Computable de~Finetti measures. Freer, C. E. and Roy, D. M. Annals of Pure and Applied Logic, 163(5):530–546, 2012. bibtex @article{Freer2012530,
title = "Computable de~{F}inetti measures",
sjournal = {Ann. Pure Appl. Logic},
journal = "Annals of Pure and Applied Logic",
volume = "163",
number = "5",
pages = "530--546",
year = "2012",
IGNOREissn = "0168-0072",
IGNOREdoi = "10.1016/j.apal.2011.06.011",
IGNOREurl = "http://www.sciencedirect.com/science/article/pii/S0168007211000868",
author = "Cameron E. Freer and Daniel M. Roy",
keywords = "The de Finetti theorem",
keywords = "Exchangeability",
keywords = "Computable probability theory",
keywords = "Probabilistic programming languages",
keywords = "Mutation",
}
Algorithmic randomness, reverse mathematics, and the dominated convergence theorem. Avigad, J.; Dean, E. T.; and Rute, J. Ann. Pure Appl. Logic, 163(12):1854–1864, 2012.
Paper doi bibtex @ARTICLE{ADR12,
author = {Avigad, Jeremy and Dean, Edward T. and Rute, Jason},
title = {Algorithmic randomness, reverse mathematics, and the dominated convergence
theorem},
journal = {Ann. Pure Appl. Logic},
year = {2012},
volume = {163},
pages = {1854--1864},
number = {12},
coden = {APALD7},
doi = {10.1016/j.apal.2012.05.010},
file = {ADR12.pdf:ADR12.pdf:PDF},
fjournal = {Annals of Pure and Applied Logic},
issn = {0168-0072},
keywords = {bib,cca},
mrclass = {03F35 (03B30 03D32 03F60 28A20)},
mrnumber = {2964874},
mrreviewer = {Denis R. Hirschfeldt},
url = {http://dx.doi.org/10.1016/j.apal.2012.05.010}
}
Computing conformal maps of finitely connected domains onto canonical slit domains. Andreev, V. V. and McNicholl, T. H. Theory Comput. Syst., 50(2):354–369, 2012.
Paper doi bibtex @ARTICLE{AM12,
author = {Andreev, Valentin V. and McNicholl, Timothy H.},
title = {Computing conformal maps of finitely connected domains onto canonical
slit domains},
journal = {Theory Comput. Syst.},
year = {2012},
volume = {50},
pages = {354--369},
number = {2},
coden = {TCSYFI},
doi = {10.1007/s00224-010-9305-4},
fjournal = {Theory of Computing Systems},
issn = {1432-4350},
keywords = {bib,cca},
mrclass = {03F60 (03D78 30C99)},
mrnumber = {2875303},
mrreviewer = {Klaus Weihrauch},
owner = {Vasco},
timestamp = {2013.12.01},
url = {http://dx.doi.org/10.1007/s00224-010-9305-4}
}
On the constructive notion of closure maps. Ardeshir, M. and Ramezanian, R. MLQ Math. Log. Q., 58(4-5):348–355, 2012.
Paper doi bibtex @ARTICLE{AR12,
author = {Ardeshir, Mohammad and Ramezanian, Rasoul},
title = {On the constructive notion of closure maps},
journal = {MLQ Math. Log. Q.},
year = {2012},
volume = {58},
pages = {348--355},
number = {4-5},
doi = {10.1002/malq.201110040},
fjournal = {MLQ. Mathematical Logic Quarterly},
issn = {0942-5616},
keywords = {bib,con},
mrclass = {03F60 (03B30)},
mrnumber = {2965422},
mrreviewer = {Hiroki Takamura},
owner = {Vasco},
timestamp = {2013.12.01},
url = {http://dx.doi.org/10.1002/malq.201110040}
}
Uncomputably noisy ergodic limits. Avigad, J. Notre Dame J. Form. Log., 53(3):347–350, 2012.
Paper doi bibtex @ARTICLE{Avi12a,
author = {Avigad, Jeremy},
title = {Uncomputably noisy ergodic limits},
journal = {Notre Dame J. Form. Log.},
year = {2012},
volume = {53},
pages = {347--350},
number = {3},
doi = {10.1215/00294527-1716757},
fjournal = {Notre Dame Journal of Formal Logic},
issn = {0029-4527},
keywords = {bib,cca},
mrclass = {03F60 (37A25)},
mrnumber = {2981012},
mrreviewer = {A. Ku{\v{c}}era},
owner = {Vasco},
timestamp = {2013.12.01},
url = {http://dx.doi.org/10.1215/00294527-1716757}
}
Inverting the Furstenberg correspondence. Avigad, J. Discrete Contin. Dyn. Syst., 32(10):3421–3431, 2012.
Paper doi bibtex @ARTICLE{Avi12,
author = {Avigad, Jeremy},
title = {Inverting the {F}urstenberg correspondence},
journal = {Discrete Contin. Dyn. Syst.},
year = {2012},
volume = {32},
pages = {3421--3431},
number = {10},
doi = {10.3934/dcds.2012.32.3421},
fjournal = {Discrete and Continuous Dynamical Systems. Series A},
issn = {1078-0947},
keywords = {bib,cca},
mrclass = {37A05 (03F60 37A15)},
mrnumber = {2945823},
mrreviewer = {Randall McCutcheon},
owner = {Vasco},
timestamp = {2013.12.01},
url = {http://dx.doi.org/10.3934/dcds.2012.32.3421}
}
The rate of convergence of the walk on spheres algorithm. Binder, I. and Braverman, M. Geom. Funct. Anal., 22(3):558–587, 2012.
Paper doi bibtex @ARTICLE{BB12,
author = {Binder, Ilia and Braverman, Mark},
title = {The rate of convergence of the walk on spheres algorithm},
journal = {Geom. Funct. Anal.},
year = {2012},
volume = {22},
pages = {558--587},
number = {3},
doi = {10.1007/s00039-012-0161-z},
file = {BB12.pdf:BB12.pdf:PDF},
fjournal = {Geometric and Functional Analysis},
issn = {1016-443X},
keywords = {bib, cca},
mrclass = {60J65 (31B05 31B25 60G42 65C20)},
mrnumber = {2972600},
mrreviewer = {Enrica Pirozzi},
url = {http://dx.doi.org/10.1007/s00039-012-0161-z}
}
Continuity, Computability, Constructivity: From Logic to Algorithms. Berger, U.; Brattka, V.; Morozov, A. S.; and Spreen, D., editors Volume 163Elsevier. Amsterdam, 2012.
Paper doi bibtex @PROCEEDINGS{BBMS12,
title = {Continuity, Computability, Constructivity: From Logic to Algorithms},
year = {2012},
editor = {Berger, Ulrich and Brattka, Vasco and Morozov, Andrei S. and Spreen,
Dieter},
volume = {163},
number = {8},
series = APAL,
address = {Amsterdam},
publisher = {Elsevier},
doi = {10.1016/j.apal.2011.12.019},
keywords = {bib,cca,facs,team},
url = {http://www.sciencedirect.com/science/journal/01680072/163/8}
}
Thurston equivalence to a rational map is decidable. Bonnot, S.; Braverman, M.; and Yampolsky, M. Mosc. Math. J., 12(4):747–763, 884, 2012. bibtex @ARTICLE{BBY12,
author = {Bonnot, Sylvain and Braverman, Mark and Yampolsky, Michael},
title = {Thurston equivalence to a rational map is decidable},
journal = {Mosc. Math. J.},
year = {2012},
volume = {12},
pages = {747--763, 884},
number = {4},
fjournal = {Moscow Mathematical Journal},
issn = {1609-3321},
keywords = {bib,cca},
mrclass = {37F20 (03B25 37E30)},
mrnumber = {3076853},
owner = {Vasco},
timestamp = {2013.12.01}
}