Weihrauch, Klaus, Intersection points of planar curves can be computed, Computability 11:2 (2022) 113-133.Neumann, Eike, On the computability of the set of automorphisms of the unit square, Theoretical Computer Science 903 (2022) 74-83.M., Dimension spectra of lines, Computability 11:2 (2022) 85-112 Lucier, Bradley J., The Nature of Numbers: Real Computing, Journal of Humanistic Mathematics 12:1 (2022) 317-347.Hölzl, Rupert and Porter, Christoph P., Degrees of randomized computability, Bulletin of Symbolic Logic 28:1 (2022) 27-70.Hoyrup, Mathieu, The fixed-point property for represented spaces, Annals of Pure and Applied Logic 173:5 (2022) Paper No.Graça, Daniel and Zhong, Ning, Computing the exact number of periodic orbits for planar flows, Transactions of the American Mathematical Society 375 (2022) 5491-5538.Fiori-Carones, Marta and Shafer, Paul and Soldà, Giovanni, An inside/outside Ramsey theorem and recursion theory, Transactions of the American Mathematical Society 375 (2022) 1977-2024.and Mummert, Carl, Reverse Mathematics, Theory and Applications of Computability, Springer, Cham, 2022 Carl, Merlin, Space-bounded OTMs and REG^∞, Computability 11:1 (2022) 41-56. Brattka, Vasco, The Discontinuity Problem, Journal of Symbolic Logic accepted for publication (2022).48 of Tributes, College Publications, London, 2022, pages 13-44 Brattka, Vasco, Weihrauch complexity and the Hagen school of computable analysis, in: Löwe, Benedikt and Sarikaya, Deniz (eds.), 60 Jahre DVMLG, vol.CCA Net - Bibliography - Alphabetically Bibliographyīibliography styles: alphabetically, chronologically, by publication type.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |