Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday

DOI10.1007/978-3-319-50062-1MaRDI QIDQ502158zbMATH OpenOpenAlexFDO

Authors

Publication date 2 January 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-50062-1

Mathematics Subject Classification ID

Festschriften (00B30) Biographies, obituaries, personalia, bibliographies (01A70) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Foundations of classical theories (including reverse mathematics) (03B30) Computable structure theory, computable model theory (03C57) Computability and recursion theory (03Dxx) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Cited in

(11)

• Computation, logic, games, and quantum foundations. The many facets of Samson Abramsky. Essays dedicated to Samson Abramsky on the occasion of his 60th birthday
• Automata and complexity. Essays presented to Eric Goles on the occasion of his 70th birthday
• Computability of Real Numbers
• Semicomputable points in Euclidean spaces
• On isomorphism classes of computably enumerable equivalence relations
• Computing sets from all infinite subsets
• Muchnik degrees and cardinal characteristics
• Computation, cooperation, and life. Essays dedicated to Gheorghe Păun on the occasion of his 60th birthday
• scientific article; zbMATH DE number 5187689 (Why is no real title available?)
• Zorn's lemma, reverse mathematics, and applications in combinatorics
• A recursive coloring function without _3⁰ solutions for Hindman's theorem

This page was built for publication: Computability and complexity. Essays dedicated to Rodney G. Downey on the occasion of his 60th birthday

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q502158)