Keyword: cca
2018 (1)
Martin-Löf random generalized Poisson processes. Axon, L. Annals of Pure and Applied Logic, 169(4):261–276, 2018.
![Martin-Löf random generalized Poisson processes [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi bibtex
Paper doi bibtex @ARTICLE{Axo18,
author = {Axon, Logan},
title = {{M}artin-{L}{\"o}f random generalized {P}oisson processes},
journal = {Annals of Pure and Applied Logic},
year = {2018},
volume = {169},
pages = {261--276},
number = {4},
doi = {10.1016/j.apal.2017.12.003},
file = {Axo18.pdf:Axo18.pdf:PDF},
issn = {0168-0072},
keywords = {bib, cca},
url = {http://www.sciencedirect.com/science/article/pii/S0168007217301446}
}2017 (3)
On computability and disintegration. Ackerman, N. L.; Freer, C. E.; and Roy, D. M. Mathematical Structures in Computer Science, 27(8):1287–1314, Cambridge University Press, 2017.
doi bibtex
doi bibtex
@ARTICLE{AFR17,
author = {Ackerman, Nathanael L. and Freer, Cameron E. and Roy, Daniel M.},
title = {On computability and disintegration},
journal = {Mathematical Structures in Computer Science},
year = {2017},
volume = {27},
pages = {1287--1314},
number = {8},
doi = {10.1017/S0960129516000098},
file = {AFR17.pdf:AFR17.pdf:PDF},
keywords = {bib, cca, wei},
publisher = {Cambridge University Press}
}Five Stages of Accepting Constructive Mathematics. Bauer, A. Bulletin of Symbolic Logic, 54(3):481–498, 2017.
Paper doi bibtex
Paper doi bibtex @ARTICLE{Bau17,
author = {Bauer, Andrej},
title = {Five Stages of Accepting Constructive Mathematics},
journal = {Bulletin of Symbolic Logic},
year = {2017},
volume = {54},
pages = {481--498},
number = {3},
doi = {10.1090/bull/1556},
file = {Bau17.pdf:Bau17.pdf:PDF},
keywords = {bib, cca, con},
url = {http://dx.doi.org/10.1090/bull/1556}
}Normal Numbers and Limit Computable Cantor Series. Beros, A. and Beros, K. Notre Dame Journal of Formal Logic, 58(2):215–220, March, 2017.
Paper doi bibtex
Paper doi bibtex @ARTICLE{BB17,
author = {Beros, Achilles and Beros, Konstantinos},
title = {Normal Numbers and Limit Computable {C}antor Series},
journal = {Notre Dame Journal of Formal Logic},
year = {2017},
volume = {58},
pages = {215--220},
number = {2},
month = {March},
doi = {10.1215/00294527-2017-0004},
keywords = {bib, cca},
url = {http://projecteuclid.org/euclid.ndjfl/1490148081}
}2016 (1)
Report on COST E37 Round Robin Tests – Comparison of results from laboratory and field tests. Westin, M.; Conti, E.; Creemers, J.; Flæte, P. O.; Gellerich, A.; Irbe, I.; Klamer, M.; Mazela, B.; Melcher, E.; Möller, R.; Nunes, L.; Palanti, S.; Reinprecht, L.; Suttie, E.; and Viitanen, H. In June, 2016.
doi abstract bibtex
doi abstract bibtex
A round robin involving 15 European participants was set up in 2006. The round robin consists of both a field test according to the double layer test method and a laboratory test with two different preconditioning methods. When comparing EN 84 preconditioning (two weeks water leaching) with natural preconditioning (1 year in field, above ground) according to CEN/TS 15397, no significant difference could be noted for untreated controls, thermally modified wood or CCA impregnated wood. However, for wood treated with a metal-free organic preservative, a clear difference could be seen where much of the efficacy seen after EN 84 preconditioning is lost when natural preconditioning is used instead. In the field tests, the control pine performs similar in all fields whereas both thermally modified and preservative treated wood performs much better in the Nordic fields than in the Mid- and Southern European fields. The thermally modified wood performs almost as poor as the controls in the Southern European fields, whereas the organic preservative treated wood performs well in these fields. In the six Mid-European fields, the organic preservative treated and thermally modified wood performs equally poor but much better than the controls. The best compliance between field performance and laboratory test results is obtained when comparing the average results from the field tests with results from EN 113 tests with Postia placenta after natural preconditioning according to CEN/TS 15397.
@inproceedings{westin_report_2016,
title = {Report on {COST} {E}37 {Round} {Robin} {Tests} – {Comparison} of results from laboratory and field tests},
doi = {IRG/WP 13-20535},
abstract = {A round robin involving 15 European participants was set up in 2006. The round robin consists of both a field test according to the double layer test method and a laboratory test with two different preconditioning methods. When comparing EN 84 preconditioning (two weeks water leaching) with natural preconditioning (1 year in field, above ground) according to CEN/TS 15397, no significant difference could be noted for untreated controls, thermally modified wood or CCA impregnated wood. However, for wood treated with a metal-free organic preservative, a clear difference could be seen where much of the efficacy seen after EN 84 preconditioning is lost when natural preconditioning is used instead. In the field tests, the control pine performs similar in all fields whereas both thermally modified and preservative treated wood performs much better in the Nordic fields than in the Mid- and Southern European fields. The thermally modified wood performs almost as poor as the controls in the Southern European fields, whereas the organic preservative treated wood performs well in these fields. In the six Mid-European fields, the organic preservative treated and thermally modified wood performs equally poor but much better than the controls. The best compliance between field performance and laboratory test results is obtained when comparing the average results from the field tests with results from EN 113 tests with Postia placenta after natural preconditioning according to CEN/TS 15397.},
author = {Westin, M. and Conti, E. and Creemers, J. and Flæte, P. O. and Gellerich, A. and Irbe, I. and Klamer, M. and Mazela, B. and Melcher, E. and Möller, R. and Nunes, L. and Palanti, S. and Reinprecht, L. and Suttie, E. and Viitanen, H.},
month = jun,
year = {2016},
keywords = {CCA, CEN/TS 15397, double layer test, EN 113, EN 84, organic preservative, Thermally modified wood},
file = {IRG 13-20535:C\:\\Users\\Eva\\Zotero\\storage\\ETN6PSFI\\IRG 13-20535.pdf:application/pdf}
}2015 (3)
Martin-Löf Randomness in Spaces of Closed Sets. Axon, L. M. 80(2):359–383, 2015.
doi bibtex
doi bibtex
@ARTICLE{Axo15,
author = {Axon, Logan M.},
title = {Martin-{L}{\"o}f Randomness in Spaces of Closed Sets},
journal = JSL,
year = {2015},
volume = {80},
pages = {359--383},
number = {2},
doi = {10.1017/jsl.2014.76},
file = {Axo15.pdf:Axo15.pdf:PDF},
keywords = {bib, cca},
timestamp = {2015.07.17}
}Computing with Infinite Data: Topological and Logical Foundations Part 2. Berger, U.; Brattka, V.; Selivanov, V.; Spreen, D.; and Tsuiki, H., editors Volume 25Cambridge University Press. Cambridge, 2015.
Paper bibtex
Paper bibtex @PROCEEDINGS{BBS+15a,
title = {Computing with Infinite Data: Topological and Logical Foundations
Part 2},
year = {2015},
editor = {Berger, Ulrich and Brattka, Vasco and Selivanov, Victor and Spreen,
Dieter and Tsuiki, Hideki},
volume = {25},
number = {8},
series = MSCS,
address = {Cambridge},
publisher = {Cambridge University Press},
keywords = {cca, bib, team},
url = {http://journals.cambridge.org/action/displayIssue?jid=MSC&volumeId=25&seriesId=0&issueId=08}
}Computing with Infinite Data: Topological and Logical Foundations Part 1. Berger, U.; Brattka, V.; Selivanov, V.; Spreen, D.; and Tsuiki, H., editors Volume 25Cambridge University Press. Cambridge, 2015.
Paper bibtex
Paper bibtex @PROCEEDINGS{BBS+15,
title = {Computing with Infinite Data: Topological and Logical Foundations
Part 1},
year = {2015},
editor = {Berger, Ulrich and Brattka, Vasco and Selivanov, Victor and Spreen,
Dieter and Tsuiki, Hideki},
volume = {25},
number = {7},
series = MSCS,
address = {Cambridge},
publisher = {Cambridge University Press},
keywords = {cca, bib, team},
url = {http://journals.cambridge.org/action/displayIssue?jid=MSC&volumeId=25&seriesId=0&issueId=07}
}2014 (2)
Computability and analysis: the legacy of Alan Turing. Avigad, J. and Brattka, V. In Turing's Legacy: Developments from Turing's Ideas in Logic, volume 42, pages 1–47. Cambridge University Press, Cambridge, UK, 2014.
Paper doi bibtex
Paper doi bibtex @INCOLLECTION{AB14,
author = {Avigad, Jeremy and Brattka, Vasco},
title = {Computability and analysis: the legacy of {A}lan {T}uring},
booktitle = {Turing's Legacy: Developments from Turing's Ideas in Logic},
publisher = {Cambridge University Press},
year = {2014},
editor = {Downey, Rod},
volume = {42},
series = LNL,
pages = {1--47},
address = {Cambridge, UK},
doi = {10.1017/CBO9781107338579.002},
file = {AB14.pdf:AB14.pdf:PDF},
isbn = {9781107043480},
keywords = {bib, cca, team},
owner = {Vasco},
timestamp = {2013.12.01},
url = {http://dx.doi.org/10.1017/CBO9781107338579.002}
}On zeros of Martin-Löf random Brownian motion. Allen, K.; Bienvenu, L.; and Slaman, T. A. Journal of Logic and Analysis, 6:Paper 9, 34, 2014.
Paper doi bibtex
Paper doi bibtex @ARTICLE{ABS14,
author = {Allen, Kelty and Bienvenu, Laurent and Slaman, Theodore A.},
title = {On zeros of {M}artin-{L}\"of random {B}rownian motion},
journal = {Journal of Logic and Analysis},
year = {2014},
volume = {6},
pages = {Paper 9, 34},
doi = {10.4115/jla.2014.6.9},
file = {ABS14.pdf:ABS14.pdf:PDF},
issn = {1759-9008},
keywords = {bib, cca},
mrclass = {03D32 (60J65)},
mrnumber = {3311552},
url = {http://dx.doi.org/10.4115/jla.2014.6.9}
}2013 (4)
Base invariance of feasible dimension. Hitchcock, J. M. and Mayordomo, E. Inform. Process. Lett., 113(14-16):546–551, 2013.
Paper doi bibtex
Paper doi bibtex @ARTICLE{HM13,
author = {Hitchcock, John M. and Mayordomo, Elvira},
title = {Base invariance of feasible dimension},
journal = {Inform. Process. Lett.},
year = {2013},
volume = {113},
pages = {546--551},
number = {14-16},
coden = {IFPLAT},
doi = {10.1016/j.ipl.2013.04.004},
fjournal = {Information Processing Letters},
issn = {0020-0190},
keywords = {bib,cca},
mrclass = {68Q15 (03D15 68Q30)},
mrnumber = {3056675},
owner = {Vasco},
timestamp = {2013.12.03},
url = {http://dx.doi.org/10.1016/j.ipl.2013.04.004}
}Special Issue for the Conference Computability and Complexity in Analysis (CCA 2011). Archibald, M.; Brattka, V.; Escardó, M.; and Hertling, P., editors Volume 2013. Cape Town, South Africa, January 31-February 4, 2011
Paper doi bibtex
Paper doi bibtex @PROCEEDINGS{ABEH13,
title = {Special Issue for the Conference Computability and Complexity in
Analysis ({CCA} 2011)},
year = {2013},
editor = {Archibald, Margaret and Brattka, Vasco and Escard{\'o}, Mart{\'\i}n
and Hertling, Peter},
series = LMCS,
note = {Cape Town, South Africa, January 31-February 4, 2011},
doi = {10.2168/LMCS-CCA:2011},
keywords = {bib,cca,team},
owner = {Vasco},
timestamp = {2013.12.01},
url = {http://www.lmcs-online.org/ojs/specialIssues.php?id=39}
}First-order universality for real programs. Anberrée, T. J. Logic Comput., 23(4):729–751, 2013.
Paper doi bibtex
Paper doi bibtex @ARTICLE{Anb13,
author = {Anberr{\'e}e, Thomas},
title = {First-order universality for real programs},
journal = {J. Logic Comput.},
year = {2013},
volume = {23},
pages = {729--751},
number = {4},
doi = {10.1093/logcom/exr044},
file = {Anb13.pdf:Anb13.pdf:PDF},
fjournal = {Journal of Logic and Computation},
issn = {0955-792X},
keywords = {bib,cca},
mrclass = {68N18 (03B40 06E30 68Q55)},
mrnumber = {3082524},
owner = {Vasco},
timestamp = {2014.10.18},
url = {http://dx.doi.org/10.1093/logcom/exr044}
}Rate of convergence under weak contractiveness conditions. Ariza-Ruiz, D.; Martol Briseid, E.; Jiménez-Melado, A.; and López-Acedo, G. Fixed Point Theory, 14(1):11–27, 2013.
bibtex
bibtex
@ARTICLE{AMBJL13,
author = {Ariza-Ruiz, David and Martol Briseid, Eyvind and Jim{\'e}nez-Melado,
Antonio and L{\'o}pez-Acedo, Genaro},
title = {Rate of convergence under weak contractiveness conditions},
journal = {Fixed Point Theory},
year = {2013},
volume = {14},
pages = {11--27},
number = {1},
fjournal = {Fixed Point Theory. An International Journal on Fixed Point Theory,
Computation and Applications},
issn = {1583-5022},
keywords = {bib,cca},
mrclass = {47J25 (47H09 47H10)},
mrnumber = {3088668},
owner = {Vasco},
timestamp = {2013.12.03}
}2012 (10)
Computable de~Finetti measures. Freer, C. E. and Roy, D. M. Annals of Pure and Applied Logic, 163(5):530–546, 2012.
bibtex
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",
}A metastable dominated convergence theorem. Avigad, J.; Dean, E. T.; and Rute, J. J. Log. Anal., 4:Paper 3, 19, 2012.
Paper doi bibtex
Paper doi bibtex @ARTICLE{ADR12a,
author = {Avigad, Jeremy and Dean, Edward T. and Rute, Jason},
title = {A metastable dominated convergence theorem},
journal = {J. Log. Anal.},
year = {2012},
volume = {4},
pages = {Paper 3, 19},
doi = {10.4115/jla.2012.4.3},
fjournal = {Journal of Logic and Analysis},
issn = {1759-9008},
keywords = {bib,cca},
mrclass = {28A20 (03F60)},
mrnumber = {2889823},
mrreviewer = {Donald L. Cohn},
owner = {Vasco},
timestamp = {2013.12.01},
url = {http://dx.doi.org/10.4115/jla.2012.4.3}
}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
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
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}
}Uncomputably noisy ergodic limits. Avigad, J. Notre Dame J. Form. Log., 53(3):347–350, 2012.
Paper doi bibtex
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
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
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}
}Closed Choice and a Uniform Low Basis Theorem. Brattka, V.; de Brecht, M.; and Pauly, A. 163:986–1008, 2012.
Paper doi bibtex
Paper doi bibtex @ARTICLE{BBP12,
author = {Brattka, Vasco and de Brecht, Matthew and Pauly, Arno},
title = {Closed Choice and a Uniform Low Basis Theorem},
journal = APAL,
year = {2012},
volume = {163},
pages = {986--1008},
doi = {10.1016/j.apal.2011.12.020},
eprint = {1002.2800},
file = {BBP12.pdf:BBP12.pdf:PDF;BBP12.pdf:files\\BBP12.pdf:PDF},
issue = {8},
keywords = {bib,cca,facs,wei},
url = {http://dx.doi.org/10.1016/j.apal.2011.12.020}
}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
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
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}
}2011 (4)
Noncomputable conditional distributions. Ackerman, N. L.; Freer, C. E.; and Roy, D. M. In LICS, 2011.
bibtex
bibtex
@inproceedings{AFR2011,
title= {Noncomputable conditional distributions},
author={Nathanael L. Ackerman and Cameron E. Freer and Daniel M. Roy},
year={2011},
booktitle = "LICS"
}
%2~citationsEstimating the error in the Koebe construction. Andreev, V. V. and McNicholl, T. H. Comput. Methods Funct. Theory, 11(2):707–724, 2011.
Paper doi bibtex
Paper doi bibtex @ARTICLE{AM11,
author = {Andreev, Valentin V. and McNicholl, Timothy H.},
title = {Estimating the error in the {K}oebe construction},
journal = {Comput. Methods Funct. Theory},
year = {2011},
volume = {11},
pages = {707--724},
number = {2},
doi = {10.1007/BF03321883},
fjournal = {Computational Methods and Function Theory},
issn = {1617-9447},
keywords = {bib,cca},
mrclass = {30C20 (30C30 30C85)},
mrnumber = {2858968},
mrreviewer = {Konstantin Yu. Fedorovski{\u\i}},
owner = {Vasco},
timestamp = {2013.12.01},
url = {http://dx.doi.org/10.1007/BF03321883}
}Computational Models of Certain Hyperspaces of Quasi-metric Spaces. Ali-Akbari, M. and Pourmahdian, M. 7:4:1, 25, 2011.
doi bibtex
doi bibtex
@ARTICLE{AP11,
author = {Ali-Akbari, Mahdi and Pourmahdian, Massoud},
title = {Computational Models of Certain Hyperspaces of Quasi-metric Spaces},
journal = LMCS,
year = {2011},
volume = {7},
pages = {4:1, 25},
doi = {10.2168/LMCS-7(4:1)2011},
file = {AP11.pdf:AP11.pdf:PDF},
issue = {4},
keywords = {bib,cca},
owner = {Vasco},
timestamp = {2013.12.04}
}Computability of Brolin-Lyubich measure. Binder, I.; Braverman, M.; Rojas, C.; and Yampolsky, M. Comm. Math. Phys., 308(3):743–771, 2011.
Paper doi bibtex
Paper doi bibtex @ARTICLE{BBRY11,
author = {Binder, Ilia and Braverman, Mark and Rojas, Cristobal and Yampolsky,
Michael},
title = {Computability of {B}rolin-{L}yubich measure},
journal = {Comm. Math. Phys.},
year = {2011},
volume = {308},
pages = {743--771},
number = {3},
coden = {CMPHAY},
doi = {10.1007/s00220-011-1363-1},
fjournal = {Communications in Mathematical Physics},
issn = {0010-3616},
keywords = {bib,cca},
mrclass = {37F50 (03D60 37F10)},
mrnumber = {2855539 (2012m:37087)},
mrreviewer = {Suzanne Hruska Boyd},
owner = {Vasco},
timestamp = {2013.12.01},
url = {http://dx.doi.org/10.1007/s00220-011-1363-1}
}2010 (3)
Complexity theory for operators in analysis. Kawamura, A. and Cook, S. In Proceedings of the 42nd ACM symposium on Theory of computing, of STOC '10, pages 495–502, New York, 2010. ACM.
Paper doi bibtex
Paper doi bibtex @INPROCEEDINGS{KC10,
author = {Kawamura, Akitoshi and Cook, Stephen},
title = {Complexity theory for operators in analysis},
booktitle = {Proceedings of the 42nd ACM symposium on Theory of computing},
year = {2010},
series = {STOC '10},
pages = {495--502},
address = {New York},
publisher = {ACM},
doi = {10.1145/1806689.1806758},
keywords = {bib,cca,wei},
location = {Cambridge, Massachusetts, USA},
url = {http://doi.acm.org/10.1145/1806689.1806758}
}Computing Interpolating Sequences. Andreev, V. V. and McNicholl, T. H. 46(2):340–350, 2010.
Paper doi bibtex
Paper doi bibtex @ARTICLE{AM10,
author = {Andreev, Valentin V. and McNicholl, Timothy H.},
title = {Computing Interpolating Sequences},
journal = TOCS,
year = {2010},
volume = {46},
pages = {340--350},
number = {2},
doi = {10.1007/s00224-008-9140-z},
file = {AM10.pdf:AM10.pdf:PDF;AM10.pdf:files\\AM10.pdf:PDF},
keywords = {bib,cca},
url = {http://dx.doi.org/10.1007/s00224-008-9140-z}
}Semantical proofs of correctness for programs performing non-deterministic tests on real numbers. Anberrée, T. Math. Structures Comput. Sci., 20(5):723–751, 2010.
Paper doi bibtex
Paper doi bibtex @ARTICLE{Anb10,
author = {Anberr{\'e}e, Thomas},
title = {Semantical proofs of correctness for programs performing non-deterministic
tests on real numbers},
journal = {Math. Structures Comput. Sci.},
year = {2010},
volume = {20},
pages = {723--751},
number = {5},
doi = {10.1017/S0960129510000186},
file = {Anb10.pdf:Anb10.pdf:PDF},
fjournal = {Mathematical Structures in Computer Science. A Journal in the Applications
of Categorical, Algebraic and Geometric Methods in Computer Science},
issn = {0960-1295},
keywords = {bib,cca},
mrclass = {68N18 (68Q55)},
mrnumber = {2735840 (2012a:68041)},
owner = {Vasco},
timestamp = {2014.10.18},
url = {http://dx.doi.org/10.1017/S0960129510000186}
}2009 (6)
A divergence formula for randomness and dimension. Lutz, J. H. In Mathematical theory and computational practice, volume 5635, of Lecture Notes in Comput. Sci., pages 342–351. Springer, Berlin, 2009.
Paper doi bibtex
Paper doi bibtex @INCOLLECTION{Lut09,
author = {Lutz, Jack H.},
title = {A divergence formula for randomness and dimension},
booktitle = {Mathematical theory and computational practice},
publisher = {Springer},
year = {2009},
volume = {5635},
series = {Lecture Notes in Comput. Sci.},
pages = {342--351},
address = {Berlin},
doi = {10.1007/978-3-642-03073-4_35},
keywords = {bib,cca},
mrclass = {03D32},
mrnumber = {2545908 (2011h:03082)},
owner = {Vasco},
timestamp = {2013.12.03},
url = {http://dx.doi.org/10.1007/978-3-642-03073-4_35}
}Computable exchangeable sequences have computable de Finetti measures. Freer, C. E. and Roy, D. M. In Mathematical theory and computational practice, volume 5635, of Lecture Notes in Comput. Sci., pages 218–231, Berlin, 2009. Springer.
Paper doi bibtex
Paper doi bibtex @INPROCEEDINGS{FR09,
author = {Freer, Cameron E. and Roy, Daniel M.},
title = {Computable exchangeable sequences have computable de {F}inetti measures},
booktitle = {Mathematical theory and computational practice},
year = {2009},
volume = {5635},
series = {Lecture Notes in Comput. Sci.},
pages = {218--231},
address = {Berlin},
publisher = {Springer},
doi = {10.1007/978-3-642-03073-4_23},
keywords = {bib,cca},
mrclass = {60G09 (68N18 68W20)},
mrnumber = {2545896 (2011h:60078)},
owner = {Vasco},
timestamp = {2013.11.24},
url = {http://dx.doi.org/10.1007/978-3-642-03073-4_23}
}The metamathematics of ergodic theory. Avigad, J. Ann. Pure Appl. Logic, 157(2-3):64–76, 2009.
Paper doi bibtex
Paper doi bibtex @ARTICLE{Avi09,
author = {Avigad, Jeremy},
title = {The metamathematics of ergodic theory},
journal = {Ann. Pure Appl. Logic},
year = {2009},
volume = {157},
pages = {64--76},
number = {2-3},
coden = {APALD7},
doi = {10.1016/j.apal.2008.09.001},
fjournal = {Annals of Pure and Applied Logic},
issn = {0168-0072},
keywords = {bib,cca},
mrclass = {03F03 (03F60 26E40 37A30)},
mrnumber = {2499698 (2010d:03101)},
mrreviewer = {Hajime Ishihara},
owner = {Vasco},
timestamp = {2013.12.01},
url = {http://dx.doi.org/10.1016/j.apal.2008.09.001}
}The Complexity of Simulating Brownian Motion. Binder, I. and Braverman, M. In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, of SODA '09, pages 58–67, Philadelphia, PA, USA, 2009. Society for Industrial and Applied Mathematics.
Paper bibtex
Paper bibtex @INPROCEEDINGS{BB09a,
author = {Binder, Ilia and Braverman, Mark},
title = {The Complexity of Simulating {B}rownian Motion},
booktitle = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete
Algorithms},
year = {2009},
series = {SODA '09},
pages = {58--67},
address = {Philadelphia, PA, USA},
publisher = {Society for Industrial and Applied Mathematics},
acmid = {1496777},
file = {BB09a.pdf:BB09a.pdf:PDF},
keywords = {bib, cca},
location = {New York, New York},
numpages = {10},
url = {http://dl.acm.org/citation.cfm?id=1496770.1496777}
}K-Triviality of Closed Sets and Continuous Functions. Barmpalias, G.; Cenzer, D.; Remmel, J. B.; and Weber, R. Journal of Logic and Computation, 19(1):3–16, 2009.
Paper bibtex
Paper bibtex @ARTICLE{BCRW09,
author = {Barmpalias, George and Cenzer, Douglas and Remmel, Jeffrey B. and
Weber, Rebecca},
title = {K-Triviality of Closed Sets and Continuous Functions},
journal = {Journal of Logic and Computation},
year = {2009},
volume = {19},
pages = {3--16},
number = {1},
keywords = {bib,cca},
url = {http://dx.doi.org/10.1093/logcom/exn021}
}Computability and Complexity in Analysis. Brattka, V.; Collins, P.; and Rettinger, R., editors Volume 15Graz University of Technology. Graz, 2009. Selected Papers of the Fifth International Conference on Computability and Complexity in Analysis, August 21-24, 2008, Hagen, Germany
Paper doi bibtex
Paper doi bibtex @PROCEEDINGS{BCR09,
title = {Computability and Complexity in Analysis},
year = {2009},
editor = {Brattka, Vasco and Collins, Pieter and Rettinger, Robert},
volume = {15},
number = {6},
series = JUCS,
address = {Graz},
publisher = {Graz University of Technology},
note = {Selected Papers of the Fifth International Conference on Computability
and Complexity in Analysis, August 21-24, 2008, Hagen, Germany},
doi = {10.3217/jucs-015-06},
keywords = {bib,cca,facs},
url = {http://www.jucs.org/doi?doi=10.3217/jucs-015-06}
}2008 (9)
Connectivity Properties of Dimension Level Sets. Lutz, J. and Weihrauch, K. In Dillhage, R.; Grubba, T.; Sorbi, A.; Weihrauch, K.; and Zhong, N., editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202, pages 295–304, 2008. Elsevier. CCA 2007, Siena, Italy, June 16–18, 2007
bibtex
bibtex
@INPROCEEDINGS{LW08b,
author = {Lutz, Jack and Weihrauch, Klaus},
title = {Connectivity Properties of Dimension Level Sets},
booktitle = {Proceedings of the Fourth International Conference on Computability
and Complexity in Analysis ({CCA} 2007)},
year = {2008},
editor = {Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch,
Klaus and Zhong, Ning},
volume = {202},
series = ENTCS,
pages = {295--304},
publisher = {Elsevier},
note = {CCA 2007, Siena, Italy, June 16--18, 2007},
keywords = {bib,cca,thi1}
}Effective dimensions and relative frequencies. Gu, X. and Lutz, J. H. In Logic and theory of algorithms, volume 5028, of Lecture Notes in Comput. Sci., pages 231–240, Berlin, 2008. Springer.
Paper doi bibtex
Paper doi bibtex @INPROCEEDINGS{GL08,
author = {Gu, Xiaoyang and Lutz, Jack H.},
title = {Effective dimensions and relative frequencies},
booktitle = {Logic and theory of algorithms},
year = {2008},
volume = {5028},
series = {Lecture Notes in Comput. Sci.},
pages = {231--240},
address = {Berlin},
publisher = {Springer},
doi = {10.1007/978-3-540-69407-6_27},
keywords = {bib,cca},
mrclass = {94A55 (28A78 28A80 68Q30)},
mrnumber = {2507022 (2010h:94164)},
owner = {Vasco},
timestamp = {2013.12.03},
url = {http://dx.doi.org/10.1007/978-3-540-69407-6_27}
}Dimensions of points in self-similar fractals. Lutz, J. H. and Mayordomo, E. SIAM J. Comput., 38(3):1080–1112, 2008.
Paper doi bibtex
Paper doi bibtex @ARTICLE{LM08,
author = {Lutz, Jack H. and Mayordomo, Elvira},
title = {Dimensions of points in self-similar fractals},
journal = {SIAM J. Comput.},
year = {2008},
volume = {38},
pages = {1080--1112},
number = {3},
doi = {10.1137/070684689},
file = {LM08.pdf:LM08.pdf:PDF},
fjournal = {SIAM Journal on Computing},
issn = {0097-5397},
keywords = {bib,cca},
mrclass = {68Q15 (11K55 28A78 28A80 68Q30)},
mrnumber = {2421079 (2010b:68052a)},
mrreviewer = {Peter W. Day},
owner = {Vasco},
timestamp = {2013.12.03},
url = {http://dx.doi.org/10.1137/070684689}
}Stability for Effective Algebras. Blanck, J.; Stoltenberg-Hansen, V.; and Tucker, J. V. In Brattka, V.; Dillhage, R.; Grubba, T.; and Klutsch, A., editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221, pages 3–15, 2008. Elsevier. CCA 2008, Fifth International Conference, Hagen, Germany, August 21–24, 2008
Paper bibtex
Paper bibtex @INPROCEEDINGS{BST08,
author = {Blanck, Jens and Stoltenberg-Hansen, Viggo and Tucker, John V.},
title = {Stability for Effective Algebras},
booktitle = {{CCA} 2008, Fifth International Conference on Computability and Complexity
in Analysis},
year = {2008},
editor = {Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch,
Angela},
volume = {221},
series = ENTCS,
pages = {3--15},
publisher = {Elsevier},
note = {CCA 2008, Fifth International Conference, Hagen, Germany, August
21--24, 2008},
keywords = {bib,cca},
url = {http://dx.doi.org/10.1016/j.entcs.2008.12.002}
}Randomness with respect to the Signed-Digit Representation. Archibald, M.; Brattka, V.; and Heuberger, C. 83(1–2):1–19, 2008.
Paper bibtex
Paper bibtex @ARTICLE{ABH08,
author = {Archibald, Margaret and Brattka, Vasco and Heuberger, Clemens},
title = {Randomness with respect to the Signed-Digit Representation},
journal = FI,
year = {2008},
volume = {83},
pages = {1--19},
number = {1--2},
file = {ABH08.pdf:ABH08.pdf:PDF;ABH08.pdf:files\\ABH08.pdf:PDF},
keywords = {bib,cca,facs,new},
url = {http://fi.mimuw.edu.pl/abs83.html\#1}
}Technical Report: Computation on the Extended Complex Plane and Conformal Mapping of Multiply-connected Domains. Andreev, V. V.; Daniel, D.; and McNicholl, T. H. In Brattka, V.; Dillhage, R.; Grubba, T.; and Klutsch, A., editors, CCA 2008, Fifth International Conference on Computability and Complexity in Analysis, volume 221, pages 127–139, 2008. Elsevier. CCA 2008, Fifth International Conference, Hagen, Germany, August 21–24, 2008
Paper bibtex
Paper bibtex @INPROCEEDINGS{ADM08,
author = {Andreev, Valentin V. and Daniel, Dale and McNicholl, Timothy H.},
title = {Technical Report: Computation on the Extended Complex Plane and Conformal
Mapping of Multiply-connected Domains},
booktitle = {{CCA} 2008, Fifth International Conference on Computability and Complexity
in Analysis},
year = {2008},
editor = {Brattka, Vasco and Dillhage, Ruth and Grubba, Tanja and Klutsch,
Angela},
volume = {221},
series = ENTCS,
pages = {127--139},
publisher = {Elsevier},
note = {CCA 2008, Fifth International Conference, Hagen, Germany, August
21--24, 2008},
keywords = {bib,cca},
url = {http://dx.doi.org/10.1016/j.entcs.2008.12.012}
}Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra. Batra, P. In Dillhage, R.; Grubba, T.; Sorbi, A.; Weihrauch, K.; and Zhong, N., editors, Proceedings of the Fourth International Conference on Computability and Complexity in Analysis (CCA 2007), volume 202, pages 201–218, 2008. Elsevier. CCA 2007, Siena, Italy, June 16–18, 2007
bibtex
bibtex
@INPROCEEDINGS{Bat08,
author = {Batra, Prashant},
title = {Newton's method and the Computational Complexity of the Fundamental
Theorem of Algebra},
booktitle = {Proceedings of the Fourth International Conference on Computability
and Complexity in Analysis ({CCA} 2007)},
year = {2008},
editor = {Dillhage, Ruth and Grubba, Tanja and Sorbi, Andrea and Weihrauch,
Klaus and Zhong, Ning},
volume = {202},
series = ENTCS,
pages = {201--218},
publisher = {Elsevier},
note = {CCA 2007, Siena, Italy, June 16--18, 2007},
keywords = {bib,cca}
}Algorithmic randomness of continuous functions. Barmpalias, G.; Brodhead, P.; Cenzer, D.; Remmel, J. B.; and Weber, R. 46(7–8):533–546, 2008.
Paper bibtex
Paper bibtex @ARTICLE{BBCRW08,
author = {Barmpalias, George and Brodhead, Paul and Cenzer, Douglas and Remmel,
Jeffrey B. and Weber, Rebecca},
title = {Algorithmic randomness of continuous functions},
journal = AML,
year = {2008},
volume = {46},
pages = {533--546},
number = {7--8},
keywords = {bib,cca},
url = {http://dx.doi.org/10.1007/s00153-007-0060-4}
}Effectively closed sets and enumerations. Brodhead, P. and Cenzer, D. 46(7–8):565–582, 2008.
Paper bibtex
Paper bibtex @ARTICLE{BC08,
author = {Brodhead, Paul and Cenzer, Douglas},
title = {Effectively closed sets and enumerations},
journal = AML,
year = {2008},
volume = {46},
pages = {565--582},
number = {7--8},
keywords = {bib,cca},
url = {http://dx.doi.org/10.1007/s00153-008-0065-7}
}2007 (5)
Audiovisual synchronization and fusion using canonical correlation analysis. Sargin, M. E.; Yemez, Y.; Erzin, E.; and Tekalp, A. M. IEEE TRANSACTIONS ON MULTIMEDIA, 9(7):1396-1403, NOV, 2007.
doi abstract bibtex
doi abstract bibtex
It is well-known that early integration (also called data fusion) is effective when the modalities are correlated, and late integration (also called decision or opinion fusion) is optimal when modalities are uncorrelated. In this paper, we propose a new multimodal fusion strategy for open-set speaker identification using a combination of early and late integration following canonical correlation analysis (CCA) of speech and lip texture features. We also propose a method for high precision synchronization of the speech and lip features using CCA prior to the proposed fusion. Experimental results show that i) the proposed fusion strategy yields the best equal error rates (EER), which are used to quantify the performance of the fusion strategy for open-set speaker identification, and ii) precise synchronization prior to fusion improves the EER; hence, the best EER is obtained when the proposed synchronization scheme is employed together with the proposed fusion strategy. We note that the proposed fusion strategy outperforms others because the features used in the late integration are truly uncorrelated, since they are output of the CCA analysis.
@article{ ISI:000250447400006,
Author = {Sargin, Mehmet Entre and Yemez, Yuecel and Erzin, Engin and Tekalp, A.
Murat},
Title = {{Audiovisual synchronization and fusion using canonical correlation
analysis}},
Journal = {{IEEE TRANSACTIONS ON MULTIMEDIA}},
Year = {{2007}},
Volume = {{9}},
Number = {{7}},
Pages = {{1396-1403}},
Month = {{NOV}},
Abstract = {{It is well-known that early integration (also called data fusion) is
effective when the modalities are correlated, and late integration (also
called decision or opinion fusion) is optimal when modalities are
uncorrelated. In this paper, we propose a new multimodal fusion strategy
for open-set speaker identification using a combination of early and
late integration following canonical correlation analysis (CCA) of
speech and lip texture features. We also propose a method for high
precision synchronization of the speech and lip features using CCA prior
to the proposed fusion. Experimental results show that i) the proposed
fusion strategy yields the best equal error rates (EER), which are used
to quantify the performance of the fusion strategy for open-set speaker
identification, and ii) precise synchronization prior to fusion improves
the EER; hence, the best EER is obtained when the proposed
synchronization scheme is employed together with the proposed fusion
strategy. We note that the proposed fusion strategy outperforms others
because the features used in the late integration are truly
uncorrelated, since they are output of the CCA analysis.}},
DOI = {{10.1109/TMM.2007.906583}},
ISSN = {{1520-9210}},
EISSN = {{1941-0077}},
ResearcherID-Numbers = {{Erzin, Engin/H-1716-2011}},
ORCID-Numbers = {{Erzin, Engin/0000-0002-2715-2368}},
Unique-ID = {{ISI:000250447400006}},
}Constructive analysis, types and exact real numbers. Geuvers, H.; Niqui, M.; Spitters, B.; and Wiedijk, F. 17:3–36, 2007.
Paper bibtex
Paper bibtex @ARTICLE{GNSW07,
author = {Geuvers, Herman and Niqui, Milad and Spitters, Bas and Wiedijk, Freek},
title = {Constructive analysis, types and exact real numbers},
journal = MSCS,
year = {2007},
volume = {17},
pages = {3--36},
file = {GNSW07.pdf:GNSW07.pdf:PDF;GNSW07.pdf:files\\GNSW07.pdf:PDF},
keywords = {bib,cca,con},
url = {http://dx.doi.org/10.1017/S0960129506005834}
}On the computational complexity of the Riemann mapping. Binder, I.; Braverman, M.; and Yampolsky, M. Ark. Mat., 45(2):221–239, 2007.
Paper doi bibtex
Paper doi bibtex @ARTICLE{BBY07a,
author = {Binder, Ilia and Braverman, Mark and Yampolsky, Michael},
title = {On the computational complexity of the {R}iemann mapping},
journal = {Ark. Mat.},
year = {2007},
volume = {45},
pages = {221--239},
number = {2},
coden = {AKMTAJ},
doi = {10.1007/s11512-007-0045-x},
file = {BBY07a.pdf:BBY07a.pdf:PDF},
fjournal = {Arkiv f\"or Matematik},
issn = {0004-2080},
keywords = {bib,cca},
mrclass = {03D78 (03D15 30C30 30F10 68Q17)},
mrnumber = {2342601 (2010b:03055)},
mrreviewer = {Timothy H. McNicholl},
owner = {Vasco},
timestamp = {2013.12.01},
url = {http://dx.doi.org/10.1007/s11512-007-0045-x}
}Filled Julia sets with empty interior are computable. Binder, I.; Braverman, M.; and Yampolsky, M. Found. Comput. Math., 7(4):405–416, 2007.
Paper doi bibtex
Paper doi bibtex @ARTICLE{BBY07,
author = {Binder, I. and Braverman, M. and Yampolsky, M.},
title = {Filled {J}ulia sets with empty interior are computable},
journal = {Found. Comput. Math.},
year = {2007},
volume = {7},
pages = {405--416},
number = {4},
doi = {10.1007/s10208-005-0210-1},
file = {BBY07.pdf:BBY07.pdf:PDF},
fjournal = {Foundations of Computational Mathematics. The Journal of the Society
for the Foundations of Computational Mathematics},
issn = {1615-3375},
keywords = {bib,cca},
mrclass = {37F10 (03F60)},
mrnumber = {2352604 (2008i:37084)},
mrreviewer = {Peter Ha{\"{\i}}ssinsky},
owner = {Vasco},
timestamp = {2013.12.01},
url = {http://dx.doi.org/10.1007/s10208-005-0210-1}
}Polynomial differential equations compute all real computable functions on computable compact intervals. Bournez, O.; Campagnolo, M. L.; Graça, D.; and S. Hainry, E. 23(3):317–335, 2007.
Paper bibtex
Paper bibtex @ARTICLE{BCGH07,
author = {Bournez, Olivier and Campagnolo, Manuel L. and Gra{\c{c}}a, Daniel
and S. Hainry, Emmanuel},
title = {Polynomial differential equations compute all real computable functions
on computable compact intervals},
journal = JC,
year = {2007},
volume = {23},
pages = {317--335},
number = {3},
file = {BCGH07.pdf:BCGH07.pdf:PDF;BCGH07.pdf:files\\BCGH07.pdf:PDF},
keywords = {bib,cca},
url = {http://dx.doi.org/10.1016/j.jco.2006.12.005}
}2006 (7)
Points on computable curves. Gu, X.; Lutz, J. H.; and Mayordomo, E. In 47th Annual IEEE Symposium on Foundations of Computer Science, pages 469–474, 2006. IEEE Computer Society Press. Proceedings of FOCS 2006, Berkeley, CA, October 22–24, 2006
bibtex
bibtex
@INPROCEEDINGS{GLM06,
author = {Gu, Xiaoyang and Lutz, Jack H. and Mayordomo, Elvira},
title = {Points on computable curves},
booktitle = {47th Annual IEEE Symposium on Foundations of Computer Science},
year = {2006},
pages = {469--474},
publisher = {IEEE Computer Society Press},
note = {Proceedings of FOCS 2006, Berkeley, CA, October 22--24, 2006},
keywords = {bib,cca}
}Schnorr dimension. Downey, R.; Merkle, W.; and Reimann, J. 16(5):789–811, 2006.
Paper bibtex
Paper bibtex @ARTICLE{DMR06,
author = {Downey, Rodney and Merkle, Wolfgang and Reimann, Jan},
title = {Schnorr dimension},
journal = MSCS,
year = {2006},
volume = {16},
pages = {789--811},
number = {5},
keywords = {bib,cca},
url = {http://dx.doi.org/10.1017/S0960129506005469}
}Random non-cupping revisited. Barmpalias, G. 22(6):850–857, 2006.
Paper bibtex
Paper bibtex @ARTICLE{Bar06,
author = {Barmpalias, George},
title = {Random non-cupping revisited},
journal = JC,
year = {2006},
volume = {22},
pages = {850--857},
number = {6},
keywords = {bib,cca},
url = {http://dx.doi.org/10.1016/j.jco.2006.03.007}
}On computational complexity of Siegel Julia sets. Binder, I.; Braverman, M.; and Yampolsky, M. Comm. Math. Phys., 264(2):317–334, 2006.
Paper doi bibtex
Paper doi bibtex @ARTICLE{BBY06,
author = {Binder, I. and Braverman, Mark and Yampolsky, M.},
title = {On computational complexity of {S}iegel {J}ulia sets},
journal = {Comm. Math. Phys.},
year = {2006},
volume = {264},
pages = {317--334},
number = {2},
doi = {10.1007/s00220-006-1546-3},
file = {BBY06.pdf:BBY06.pdf:PDF},
keywords = {bib,cca},
url = {http://dx.doi.org/10.1007/s00220-006-1546-3}
}Fundamental notions of analysis in subsystems of second-order arithmetic. Avigad, J. and Simic, K. 139:138–184, 2006.
bibtex
bibtex
@ARTICLE{AS06,
author = {Avigad, Jeremy and Simic, Ksenija},
title = {Fundamental notions of analysis in subsystems of second-order arithmetic},
journal = APAL,
year = {2006},
volume = {139},
pages = {138--184},
file = {AS06.pdf:AS06.pdf:PDF;AS06.pdf:files\\AS06.pdf:PDF},
keywords = {bib,cca}
}Random Closed Sets. Brodhead, P.; Cenzer, D.; and Dashti, S. In Beckmann, A.; Berger, U.; Löwe, B.; and Tucker, J., editors, Logical Approaches to Computational Barriers, volume 3988, pages 55–64, Berlin, 2006. Springer. Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006
Paper bibtex
Paper bibtex @INPROCEEDINGS{BCD06,
author = {Brodhead, Paul and Cenzer, Douglas and Dashti, Seyyed},
title = {Random Closed Sets},
booktitle = {Logical Approaches to Computational Barriers},
year = {2006},
editor = {Beckmann, A. and Berger, U. and L{\"o}we, B. and Tucker, J.V.},
volume = {3988},
series = LNCS,
pages = {55--64},
address = {Berlin},
publisher = {Springer},
note = {Second Conference on Computability in Europe, CiE 2006, Swansea,
UK, June 30-July 5, 2006},
keywords = {bib,cca},
url = {http://dx.doi.org/10.1007/11780342_6}
}The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation. Bournez, O.; Campagnolo, M. L.; Graça, D. S.; and Hainry, E. In Theory and applications of models of computation, volume 3959, of Lecture Notes in Comput. Sci., pages 631–643, Berlin, 2006. Springer.
Paper doi bibtex
Paper doi bibtex @INPROCEEDINGS{BCGH06,
author = {Bournez, Olivier and Campagnolo, Manuel L. and Gra{\c{c}}a, Daniel
S. and Hainry, Emmanuel},
title = {The general purpose analog computer and computable analysis are two
equivalent paradigms of analog computation},
booktitle = {Theory and applications of models of computation},
year = {2006},
volume = {3959},
series = {Lecture Notes in Comput. Sci.},
pages = {631--643},
address = {Berlin},
publisher = {Springer},
doi = {10.1007/11750321_60},
keywords = {bib,cca},
mrclass = {68Q05 (03F60)},
mrnumber = {2279126 (2007h:68038)},
owner = {Vasco},
timestamp = {2013.12.01},
url = {http://dx.doi.org/10.1007/11750321_60}
}2005 (6)
Effective fractal dimensions. Lutz, J. H. 51(1):62–72, 2005.
bibtex
bibtex
@ARTICLE{Lut05,
author = {Lutz, Jack H.},
title = {Effective fractal dimensions},
journal = MLQ,
year = {2005},
volume = {51},
pages = {62--72},
number = {1},
keywords = {bib,cca}
}Constructivity, computability, and the continuum. Beeson, M. In Essays on the Foundations of Mathematics and Logic, volume 2. Polimetrica, Milan, 2005.
![Constructivity, computability, and the continuum [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Pdf bibtex 2 downloads
Pdf bibtex 2 downloads @incollection{beeson2005,
Address = {Milan},
Author = {Michael Beeson},
Booktitle = {Essays on the Foundations of Mathematics and Logic},
Date-Added = {2014-11-13 23:09:07 +0000},
Date-Modified = {2014-11-14 18:16:21 +0000},
Keywords = {Logic, Constructive mathematics},
Publisher = {Polimetrica},
Title = {Constructivity, computability, and the continuum},
Url_Pdf = {ccc.pdf},
Volume = {2},
Year = {2005}}Kolmogorov complexity for possibly infinite computations. Becher, V. and Figueira, S. J. Log. Lang. Inf., 14(2):133–148, 2005.
Paper doi bibtex
Paper doi bibtex @ARTICLE{BF05,
author = {Becher, Ver{\'o}nica and Figueira, Santiago},
title = {Kolmogorov complexity for possibly infinite computations},
journal = {J. Log. Lang. Inf.},
year = {2005},
volume = {14},
pages = {133--148},
number = {2},
doi = {10.1007/s10849-005-2255-6},
fjournal = {Journal of Logic, Language and Information},
issn = {0925-8531},
keywords = {bib,cca},
mrclass = {68Q30 (03D15 68Q15)},
mrnumber = {2137455 (2006j:68049)},
mrreviewer = {John P. Helm},
owner = {Vasco},
timestamp = {2013.12.01},
url = {http://dx.doi.org/10.1007/s10849-005-2255-6}
}Efficient exact computation of iterated maps. Blanck, J. 64:41–59, 2005.
bibtex
bibtex
@ARTICLE{Bla05,
author = {Blanck, Jens},
title = {Efficient exact computation of iterated maps},
journal = JLAP,
year = {2005},
volume = {64},
pages = {41--59},
keywords = {bib,cca}
}Weak theories of nonstandard arithmetic and analysis. Avigad, J. In Reverse Mathematics 2001, pages 19–46, La Jolla, 2005. Association for Symbolic Logic.
bibtex
bibtex
@INPROCEEDINGS{Avi05,
author = {Avigad, Jeremy},
title = {Weak theories of nonstandard arithmetic and analysis},
booktitle = {Reverse Mathematics 2001},
year = {2005},
editor = {Simpson, Stephen},
series = LNL,
pages = {19--46},
address = {La Jolla},
publisher = {Association for Symbolic Logic},
keywords = {bib,cca}
}Real number representations of graph-directed IFS attractors. Akama, Y. and Iizuka, S. In Grubba, T.; Hertling, P.; Tsuiki, H.; and Weihrauch, K., editors, Computability and Complexity in Analysis, volume 326, of Informatik Berichte, pages 3–24, July, 2005. FernUniversität in Hagen. Proccedings, Second International Conference, CCA 2005, Kyoto, Japan, August 25–29, 2005
bibtex
bibtex
@INPROCEEDINGS{AI05,
author = {Akama, Yohji and Iizuka, Shinji},
title = {Real number representations of graph-directed {IFS} attractors},
booktitle = {Computability and Complexity in Analysis},
year = {2005},
editor = {Grubba, Tanja and Hertling, Peter and Tsuiki, Hideki and Weihrauch,
Klaus},
volume = {326},
series = {Informatik Berichte},
pages = {3--24},
month = jul,
publisher = {FernUniversit\"at in Hagen},
note = {Proccedings, Second International Conference, CCA 2005, Kyoto, Japan,
August 25--29, 2005},
keywords = {bib,cca}
}2004 (7)
Interval Arithmetic, Affine Arithmetic, Taylor Series Methods: Why, What Next?. Nedialkov, N. S.; Kreinovich, V.; and Starks, S. A. Numerical Algorithms, 37:325–336, 2004.
bibtex
bibtex
@ARTICLE{NKS04,
author = {Nedialkov, Nedialko S. and Kreinovich, Vladik and Starks, Scott A.},
title = {Interval Arithmetic, Affine Arithmetic, Taylor Series Methods: Why,
What Next?},
journal = {Numerical Algorithms},
year = {2004},
volume = {37},
pages = {325--336},
keywords = {bib,cca}
}Application of a micro-respirometric volumetric method to respiratory measurements of larvae of the Pacific oyster Crassostrea gigas. Goulletquer, P.; Wolowicz, M.; Latala, A.; Brown, C.; and Cragg, S. Aquatic living resources, 17:195-200, 2004.
Paper Website bibtex
Paper Website bibtex @article{
title = {Application of a micro-respirometric volumetric method to respiratory measurements of larvae of the Pacific oyster Crassostrea gigas},
type = {article},
year = {2004},
identifiers = {[object Object]},
keywords = {cca,crassostrea,larvae,leachate,metabolism,respiratory rate,volumetric micro-respirometry},
pages = {195-200},
volume = {17},
websites = {http://journals.cambridge.org/abstract_S099074400400018X},
id = {b5103a5f-2a1a-309b-9cd8-1b0459e6e27c},
created = {2012-12-06T09:11:04.000Z},
accessed = {2012-11-19},
file_attached = {true},
profile_id = {0b777e31-8c9d-39dd-97a3-3e054bd99cfe},
group_id = {764582e8-5773-3a66-8d6b-9b40e4fb5a88},
last_modified = {2017-03-14T17:27:14.020Z},
read = {true},
starred = {false},
authored = {false},
confirmed = {true},
hidden = {false},
citation_key = {Goulletquer2004},
bibtype = {article},
author = {Goulletquer, Philippe and Wolowicz, Maciej and Latala, Adam and Brown, Craig and Cragg, Simon},
journal = {Aquatic living resources}
}An arithmetical hierarchy of the law of excluded middle and related principles. Akama, Y.; Berardi, S.; Hayashi, S.; and Kohlenbach, U. In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004), pages 192–201, 2004. IEEE Computer Society Press.
doi bibtex
doi bibtex
@INPROCEEDINGS{ABHK04,
author = {Akama, Yohji and Berardi, Stefano and Hayashi, Susumu and Kohlenbach,
Ulrich},
title = {An arithmetical hierarchy of the law of excluded middle and related
principles},
booktitle = {Proceedings of the 19th Annual IEEE Symposium on Logic in Computer
Science (LICS 2004)},
year = {2004},
pages = {192--201},
publisher = {IEEE Computer Society Press},
doi = {10.1109/LICS.2004.1319613},
keywords = {bib,cca}
}Limiting partial combinatory algebras. Akama, Y. 311:199–220, 2004.
bibtex
bibtex
@ARTICLE{Aka04,
author = {Akama, Yohji},
title = {Limiting partial combinatory algebras},
journal = TCS,
year = {2004},
volume = {311},
pages = {199--220},
file = {Aka04.pdf:Aka04.pdf:PDF},
keywords = {cca,bib}
}Computability and Applications to Analysis. Barmpalias, G. Ph.D. Thesis, University of Leeds, School of Mathematics, Leeds, 2004.
bibtex
bibtex
@PHDTHESIS{Bar04a,
author = {Barmpalias, Georgios},
title = {Computability and Applications to Analysis},
school = {University of Leeds, School of Mathematics},
year = {2004},
address = {Leeds},
keywords = {bib,cca}
}Dynamical systems and computable information. Benci, V.; Bonanno, C.; Galatolo, S.; Menconi, G.; and Virgilio, M. Discrete and Continuous Dynamical Systems B, 4(4):935–960, 2004.
bibtex
bibtex
@ARTICLE{BBGMV04,
author = {Benci, V. and Bonanno, C. and Galatolo, S. and Menconi, G. and Virgilio,
M.},
title = {Dynamical systems and computable information},
journal = {Discrete and Continuous Dynamical Systems B},
year = {2004},
volume = {4},
pages = {935--960},
number = {4},
keywords = {bib,cca}
}Equilogical spaces. Bauer, A.; Birkedal, L.; and Scott, D. S. 315:35–59, 2004.
bibtex
bibtex
@ARTICLE{BBS04,
author = {Bauer, Andrej and Birkedal, Lars and Scott, Dana S.},
title = {Equilogical spaces},
journal = TCS,
year = {2004},
volume = {315},
pages = {35--59},
keywords = {bib,cca}
}2003 (2)
The approximation structure of a computably approximable real. Barmpalias, G. 68(3):885–922, 2003.
bibtex
bibtex
@ARTICLE{Bar03a,
author = {Barmpalias, George},
title = {The approximation structure of a computably approximable real},
journal = JSL,
year = {2003},
volume = {68},
pages = {885--922},
number = {3},
keywords = {bib,cca}
}A transfinite hierarchy of reals. Barmpalias, G. 49(2):163–172, 2003.
bibtex
bibtex
@ARTICLE{Bar03,
author = {Barmpalias, George},
title = {A transfinite hierarchy of reals},
journal = MLQ,
year = {2003},
volume = {49},
pages = {163--172},
number = {2},
keywords = {bib,cca}
}2002 (6)
Why Computational Complexity Requires Stricter Martingales. Hitchcock, J. M. and Lutz, J. H. In Widmayer, P.; Triguero, F.; Morales, R.; Hennessy, M.; Eidenbenz, S.; and Conejo, R., editors, Automata, Languages and Programming, volume 2380, pages 549–560, Berlin, 2002. Springer. 29th International Colloquium, ICALP, Málaga, Spain, July 8–13, 2002
bibtex
bibtex
@INPROCEEDINGS{HL02,
author = {Hitchcock, John M. and Lutz, Jack H.},
title = {Why Computational Complexity Requires Stricter Martingales},
booktitle = {Automata, Languages and Programming},
year = {2002},
editor = {Widmayer, Peter and Triguero, Francisco and Morales, Rafael and Hennessy,
Matthew and Eidenbenz, Stephan and Conejo, Ricardo},
volume = {2380},
series = LNCS,
pages = {549--560},
address = {Berlin},
publisher = {Springer},
note = {29th International Colloquium, ICALP, M{\'{a}}laga, Spain, July 8--13,
2002},
keywords = {bib,cca}
}A Kolmogorov complexity characterization of constructive Hausdorff dimension. Mayordomo, E. Inform. Process. Lett., 84(1):1–3, 2002.
Paper doi bibtex
Paper doi bibtex @ARTICLE{May02,
author = {Mayordomo, Elvira},
title = {A {K}olmogorov complexity characterization of constructive {H}ausdorff
dimension},
journal = {Inform. Process. Lett.},
year = {2002},
volume = {84},
pages = {1--3},
number = {1},
coden = {IFPLAT},
doi = {10.1016/S0020-0190(02)00343-5},
fjournal = {Information Processing Letters},
issn = {0020-0190},
keywords = {bib,cca},
mrclass = {68Q30 (28A80)},
mrnumber = {1926330 (2003h:68053)},
mrreviewer = {Cristian Calude},
owner = {Vasco},
timestamp = {2013.12.03},
url = {http://dx.doi.org/10.1016/S0020-0190(02)00343-5}
}Correspondence Principles for Effective Dimensions. Hitchcock, J. M. In Widmayer, P.; Triguero, F.; Morales, R.; Hennessy, M.; Eidenbenz, S.; and Conejo, R., editors, Automata, Languages and Programming, volume 2380, pages 561–572, Berlin, 2002. Springer. 29th International Colloquium, ICALP, Málaga, Spain, July 8–13, 2002
bibtex
bibtex
@INPROCEEDINGS{Hit02,
author = {Hitchcock, John M.},
title = {Correspondence Principles for Effective Dimensions},
booktitle = {Automata, Languages and Programming},
year = {2002},
editor = {Widmayer, Peter and Triguero, Francisco and Morales, Rafael and Hennessy,
Matthew and Eidenbenz, Stephan and Conejo, Ricardo},
volume = {2380},
series = LNCS,
pages = {561--572},
address = {Berlin},
publisher = {Springer},
note = {29th International Colloquium, ICALP, M{\'{a}}laga, Spain, July 8--13,
2002},
keywords = {bib,cca}
}Domain representations of partial functions, with applications to spatial objects and constructive volume geometry. Blanck, J.; Stoltenberg-Hansen, V.; and Tucker, J. V. 284(2):207–240, 2002.
bibtex
bibtex
@ARTICLE{BST02,
author = {Blanck, Jens and Stoltenberg-Hansen, Viggo and Tucker, John V.},
title = {Domain representations of partial functions, with applications to
spatial objects and constructive volume geometry},
journal = TCS,
year = {2002},
volume = {284},
pages = {207--240},
number = {2},
keywords = {bib,cca}
}On $0'$-computable Reals. Barmpalias, G. In Brattka, V.; Schröder, M.; and Weihrauch, K., editors, CCA 2002 Computability and Complexity in Analysis, volume 66, Amsterdam, 2002. Elsevier. 5th International Workshop, CCA 2002, Málaga, Spain, July 12–13, 2002
Paper bibtex
Paper bibtex @INPROCEEDINGS{Bar02,
author = {Barmpalias, George},
title = {On $0'$-computable Reals},
booktitle = {{CCA} 2002 Computability and Complexity in Analysis},
year = {2002},
editor = {Brattka, Vasco and Schr{\"{o}}der, Matthias and Weihrauch, Klaus},
volume = {66},
series = ENTCS,
address = {Amsterdam},
publisher = {Elsevier},
note = {5th International Workshop, CCA 2002, M{\'{a}}laga, Spain, July 12--13,
2002},
keywords = {bib,cca},
url = {http://www.elsevier.com/locate/entcs/volume66.html}
}A Relationship between Equilogical Spaces and Type Two Effectivity. Bauer, A. 48(Suppl. 1):1–15, 2002.
bibtex
bibtex
@ARTICLE{Bau02,
author = {Bauer, Andrej},
title = {A Relationship between Equilogical Spaces and Type Two Effectivity},
journal = MLQ,
year = {2002},
volume = {48},
pages = {1--15},
number = {Suppl. 1},
keywords = {bib,cca}
}2001 (2)
A Relationship between Equilogical Spaces and Type Two Effectivity. Bauer, A. In Brooks, S. and Mislove, M., editors, Seventeenth Conference on the Mathematical Foundations of Programming Semantics, volume 45, Amsterdam, 2001. Elsevier. MFPS 2001, Aarhus, Denmark May 23–26, 2001
bibtex
bibtex
@INPROCEEDINGS{Bau01,
author = {Bauer, Andrej},
title = {A Relationship between Equilogical Spaces and Type Two Effectivity},
booktitle = {Seventeenth Conference on the Mathematical Foundations of Programming
Semantics},
year = {2001},
editor = {Brooks, Stephen and Mislove, Michael},
volume = {45},
series = ENTCS,
address = {Amsterdam},
publisher = {Elsevier},
note = {MFPS 2001, Aarhus, Denmark May 23--26, 2001},
keywords = {bib,cca}
}Computability and Complexity in Analysis. Blanck, J.; Brattka, V.; and Hertling, P., editors Volume 2064Springer. Berlin, 2001. 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000. Selected Papers
Paper doi bibtex
Paper doi bibtex @PROCEEDINGS{BBH01,
title = {Computability and Complexity in Analysis},
year = {2001},
editor = {Blanck, Jens and Brattka, Vasco and Hertling, Peter},
volume = {2064},
series = LNCS,
address = {Berlin},
publisher = {Springer},
note = {4th International Workshop, CCA 2000, Swansea, UK, September 17-19,
2000. Selected Papers},
doi = {10.1007/3-540-45335-0},
keywords = {bib,cca,thi1},
url = {http://link.springer.com/book/10.1007/3-540-45335-0}
}2000 (4)
Predictive habitat distribution models in ecology. Guisan, a. Ecological Modelling, 135(2-3):147-186, 12, 2000.
Paper Website bibtex
Paper Website bibtex @article{
title = {Predictive habitat distribution models in ecology},
type = {article},
year = {2000},
identifiers = {[object Object]},
keywords = {abbre6iations,biogeography,canonical correspondence analysis,cart,cc,cca,classification and regression trees,climate change,dem,digital elevation model,ecological niche factor analysis,enfa,gam,generalized additive model,generalized linear model,glm,least squares,ls,model,model calibration,model formulation,pca,plant ecology,principal component analysis,rda,redundancy analysis,species models,vegetation models},
pages = {147-186},
volume = {135},
websites = {http://linkinghub.elsevier.com/retrieve/pii/S0304380000003549},
month = {12},
id = {69e3312e-b4a3-3f1f-af76-2362dc170ff7},
created = {2012-10-04T09:25:12.000Z},
file_attached = {true},
profile_id = {c6c6f844-18d2-32db-a619-2e915134a952},
group_id = {764582e8-5773-3a66-8d6b-9b40e4fb5a88},
last_modified = {2017-03-14T17:27:14.020Z},
read = {false},
starred = {false},
authored = {false},
confirmed = {true},
hidden = {false},
citation_key = {Guisan2000c},
bibtype = {article},
author = {Guisan, a},
journal = {Ecological Modelling},
number = {2-3}
}Domain representations of topological spaces. Blanck, J. 247:229–255, 2000.
bibtex
bibtex
@ARTICLE{Bla00,
author = {Blanck, Jens},
title = {Domain representations of topological spaces},
journal = TCS,
year = {2000},
volume = {247},
pages = {229--255},
keywords = {bib,cca,dom}
}The Realizability Approach to Computable Analysis and Topology. Bauer, A. Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, 2000.
bibtex
bibtex
@PHDTHESIS{Bau00,
author = {Bauer, Andrej},
title = {The Realizability Approach to Computable Analysis and Topology},
school = {School of Computer Science, Carnegie Mellon University},
year = {2000},
address = {Pittsburgh},
keywords = {bib,cca}
}Weakly Computable Real Numbers. Ambos-Spies, K.; Weihrauch, K.; and Zheng, X. 16(4):676–690, 2000.
bibtex
bibtex
@ARTICLE{AWZ00,
author = {Ambos-Spies, Klaus and Weihrauch, Klaus and Zheng, Xizhong},
title = {Weakly Computable Real Numbers},
journal = JC,
year = {2000},
volume = {16},
pages = {676--690},
number = {4},
file = {AWZ00.pdf:AWZ00.pdf:PDF;AWZ00.pdf:files\\AWZ00.pdf:PDF},
keywords = {bib,cca,thi1}
}1999 (4)
Degree Theoretic Aspects of Computably Enumerable Reals. Calude, C. S.; Coles, R.; Hertling, P. H.; and Khoussainov, B. In Cooper, S. B. and Truss, J. K., editors, Models and Computability, volume 259, of London Math.\ Society Lecture Note Series, pages 23–39, Cambridge, 1999. Cambridge University Press. Invited Papers from Logic Colloquium 1997, Leeds.
bibtex
bibtex
@INPROCEEDINGS{CCHK99,
author = {Calude, C. S. and Coles, R. and Hertling, P. H. and Khoussainov,
B.},
title = {Degree Theoretic Aspects of Computably Enumerable Reals},
booktitle = {Models and Computability},
year = {1999},
editor = {S. B. Cooper and J. K. Truss},
volume = {259},
series = {London Math.\ Society Lecture Note Series},
pages = {23--39},
address = {Cambridge},
publisher = {Cambridge University Press},
note = {Invited Papers from {L}ogic {C}olloquium 1997, {L}eeds.},
keywords = {bib,cca,thi1}
}Analytic machines. Chadzelek, T. and Hotz, G. 219:151–167, 1999.
bibtex
bibtex
@ARTICLE{CH99,
author = {Chadzelek, Thomas and Hotz, G{\"u}nter},
title = {Analytic machines},
journal = TCS,
year = {1999},
volume = {219},
pages = {151--167},
keywords = {bib,cca}
}On the inductive inference of recursive real-valued functions. Apsītis, K.; Arikawa, S.; Freivalds, R.; Hirowatari, E.; and Smith, C. H. 219:3–17, 1999.
bibtex
bibtex
@ARTICLE{AAFHS99,
author = {Aps{\={\i}}tis, Kalvis and Arikawa, Setsuo and Freivalds, R{\=u}si{\c{n}}{\v{s}}
and Hirowatari, Eiju and Smith, Carl H.},
title = {On the inductive inference of recursive real-valued functions},
journal = TCS,
year = {1999},
volume = {219},
pages = {3--17},
keywords = {bib,cca}
}Effectively Given Continuous Domains: A Computable Interval Analysis. Bedregal, B. R. C. and Acióly, B. M. Electronic Journal on Mathematics of Computation, 1999.
bibtex
bibtex
@ARTICLE{BA99,
author = {Bedregal, Benjam{\'{\i}}n Ren{\'{e}} Callejas and Aci{\'{o}}ly, Benedito
Melo},
title = {Effectively Given Continuous Domains: A Computable Interval Analysis},
journal = {Electronic Journal on Mathematics of Computation},
year = {1999},
volume = {0},
keywords = {bib,cca,dom}
}1997 (1)
Domain representability of metric spaces. Blanck, J. 83:225–247, 1997.
bibtex
bibtex
@ARTICLE{Bla97,
author = {Blanck, Jens},
title = {Domain representability of metric spaces},
journal = APAL,
year = {1997},
volume = {83},
pages = {225--247},
keywords = {bib,cca,dom}
}1990 (1)
Exact real arithmetic, formulating real numbers as functions. Boehm, H. and Cartwright, R. In Research topics in functional programming, pages 43–64, 1990. Addison-Wesley.
bibtex
bibtex
@INPROCEEDINGS{BC90,
author = {Boehm, Hans and Cartwright, Robert},
title = {Exact real arithmetic, formulating real numbers as functions},
booktitle = {Research topics in functional programming},
year = {1990},
editor = {Turner, D.},
pages = {43--64},
publisher = {Addison-Wesley},
keywords = {bib,cca}
}1989 (1)
Computability in analysis and physics. Pour-El, M. B. and Richards, J. I. Springer-Verlag, Berlin, 1989.
bibtex
bibtex
@book {MR1005942,
AUTHOR = {Pour-El, Marian B. and Richards, J. Ian},
TITLE = {Computability in analysis and physics},
SERIES = {Perspectives in Mathematical Logic},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin},
YEAR = {1989},
PAGES = {xii+206},
ISBN = {3-540-50035-9},
MRCLASS = {03F60 (03D80 46-02 46R05 47-02 65Jxx)},
MRNUMBER = {1005942 (90k:03062)},
MRREVIEWER = {Rodney G. Downey},
BOEKCODE = {03F41},
}1983 (1)
Recursivity in quantum mechanics. Baez, J. 280:339–350, 1983.
bibtex
bibtex
@ARTICLE{Bae83,
author = {Baez, J.C.},
title = {Recursivity in quantum mechanics},
journal = TAMS,
year = {1983},
volume = {280},
pages = {339--350},
file = {Bae83.pdf:Bae83.pdf:PDF;Bae83.pdf:files\\Bae83.pdf:PDF},
keywords = {bib,cca}
}1980 (1)
Computable Analysis. Aberth, O. McGraw-Hill, New York, 1980.
bibtex
bibtex
@BOOK{Abe80,
title = {Computable Analysis},
publisher = {McGraw-Hill},
year = {1980},
author = {Aberth, Oliver},
address = {New York},
keywords = {bib,cca}
}1971 (1)
The failure in computable analysis of a classical existence theorem for differential equations. Aberth, O. Proceedings of the American Mathematical Society, 30:151–156, 1971.
bibtex
bibtex
@ARTICLE{Abe71,
author = {Aberth, Oliver},
title = {The failure in computable analysis of a classical existence theorem
for differential equations},
journal = {Proceedings of the American Mathematical Society},
year = {1971},
volume = {30},
pages = {151--156},
file = {Abe71.pdf:Abe71.pdf:PDF;Abe71.pdf:files\\Abe71.pdf:PDF},
keywords = {bib,cca}
}1970 (1)
Computable analysis and differential equations. Aberth, O. In Kino, A.; Myhill, J.; and Vesley, R., editors, Intuitionism and Proof Theory, pages 47–52, Amsterdam, 1970. North-Holland. Proc. of the Summer Conf. at Buffalo N.Y. 1968
bibtex
bibtex
@INPROCEEDINGS{Abe70,
author = {Aberth, Oliver},
title = {Computable analysis and differential equations},
booktitle = {Intuitionism and Proof Theory},
year = {1970},
editor = {Kino, A. and Myhill, J. and Vesley, R.E.},
series = SIL,
pages = {47--52},
address = {Amsterdam},
publisher = {North-Holland},
note = {Proc. of the Summer Conf. at Buffalo N.Y. 1968},
keywords = {bib,cca}
}1969 (2)
A Chain of Inclusion Relations in Computable Analysis. Aberth, O. Proceedings of the American Mathematical Society, 22:539–548, 1969.
bibtex
bibtex
@ARTICLE{Abe69,
author = {Aberth, Oliver},
title = {A Chain of Inclusion Relations in Computable Analysis},
journal = {Proceedings of the American Mathematical Society},
year = {1969},
volume = {22},
pages = {539--548},
keywords = {bib,cca}
}Some recursively unsolvable problems in analysis. Adler, A. Proceedings of the American Mathematical Society, 22:523–526, 1969.
Paper bibtex
Paper bibtex @ARTICLE{Adl69,
author = {Adler, Andrew},
title = {Some recursively unsolvable problems in analysis},
journal = {Proceedings of the American Mathematical Society},
year = {1969},
volume = {22},
pages = {523--526},
file = {Adl69.pdf:Adl69.pdf:PDF},
issn = {0002-9939},
keywords = {bib, cca},
mrclass = {02.74},
mrnumber = {0248020},
mrreviewer = {I. Fenyo},
url = {https://doi.org/10.2307/2037093}
}1968 (1)
Analysis in the Computable Number Field. Aberth, O. 15:275–299, 1968.
bibtex
bibtex
@ARTICLE{Abe68,
author = {Aberth, Oliver},
title = {Analysis in the Computable Number Field},
journal = JACM,
year = {1968},
volume = {15},
pages = {275--299},
file = {Abe68.pdf:Abe68.pdf:PDF;Abe68.pdf:files\\Abe68.pdf:PDF},
keywords = {bib,cca}
}1957 (1)
On computable sequences. Mostowski, A. 44:37–51, 1957.
bibtex
bibtex
@ARTICLE{Mos57,
author = {Mostowski, Andrzej},
title = {On computable sequences},
journal = FM,
year = {1957},
volume = {44},
pages = {37--51},
file = {Mos57.pdf:Mos57.pdf:PDF},
keywords = {bib,cca}
}