Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
39 | Jeffry L. Hirst, Carl Mummert |
Reverse Mathematics of Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computability and Complexity ![In: Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, pp. 143-159, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Michael R. Fellows |
Surfing with Rod. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computability and Complexity ![In: Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, pp. 9-18, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Laurent Bienvenu, Rutger Kuyper |
Parallel and Serial Jumps of Weak Weak König's Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computability and Complexity ![In: Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, pp. 201-217, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Keng Meng Ng |
On Being Rod's Graduate Student. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computability and Complexity ![In: Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, pp. 122-123, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Pilar Albert, Elvira Mayordomo, Philippe Moser |
Bounded Pushdown Dimension vs Lempel Ziv Information Density. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computability and Complexity ![In: Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, pp. 95-114, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Sam Buss, Douglas Cenzer, Mia Minnes, Jeffrey B. Remmel |
Injection Structures Specified by Finite State Transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computability and Complexity ![In: Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, pp. 394-417, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | André Nies |
Lowness, Randomness, and Computable Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computability and Complexity ![In: Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, pp. 738-754, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Nazif G. Khisamiev, Ivan V. Latkin |
On Constructive Nilpotent Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computability and Complexity ![In: Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, pp. 324-353, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Bjørn Kjos-Hanssen |
Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computability and Complexity ![In: Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, pp. 599-607, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | C. T. Chong |
1-Generic Degrees Bounding Minimal Degrees Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computability and Complexity ![In: Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, pp. 536-546, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Leigh Evron, Joseph R. Mileti, Ethan Ratliff-Crain |
Irreducibles and Primes in Computable Integral Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computability and Complexity ![In: Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, pp. 238-253, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Russell Miller 0001 |
Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computability and Complexity ![In: Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday, pp. 254-270, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Martin Davis |
My Life as a Logician. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Martin Davis on Computability, Computational Logic, and Mathematical Foundations ![In: Martin Davis on Computability, Computational Logic, and Mathematical Foundations., pp. 1-33, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Wilfried Sieg, Máté Szabó, Dawn McLaughlin |
Why Post Did [Not] Have Turing's Thesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Martin Davis on Computability, Computational Logic, and Mathematical Foundations ![In: Martin Davis on Computability, Computational Logic, and Mathematical Foundations., pp. 175-208, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Eugenio G. Omodeo |
Martin Davis's Bibliography 1950-2015. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Martin Davis on Computability, Computational Logic, and Mathematical Foundations ![In: Martin Davis on Computability, Computational Logic, and Mathematical Foundations., pp. 363-370, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Peter Szabó, Jörg H. Siekmann, Michael Hoche |
What Is Essential Unification? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Martin Davis on Computability, Computational Logic, and Mathematical Foundations ![In: Martin Davis on Computability, Computational Logic, and Mathematical Foundations., pp. 285-314, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Hilary Putnam |
On Davis's "Pragmatic Platonism". ![Search on Bibsonomy](Pics/bibsonomy.png) |
Martin Davis on Computability, Computational Logic, and Mathematical Foundations ![In: Martin Davis on Computability, Computational Logic, and Mathematical Foundations., pp. 337-347, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Laura Elena Morales Guerrero |
A Story of Hilbert's Tenth Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Martin Davis on Computability, Computational Logic, and Mathematical Foundations ![In: Martin Davis on Computability, Computational Logic, and Mathematical Foundations., pp. 93-105, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Donald W. Loveland, Ashish Sabharwal, Bart Selman |
DPLL: The Core of Modern Satisfiability Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Martin Davis on Computability, Computational Logic, and Mathematical Foundations ![In: Martin Davis on Computability, Computational Logic, and Mathematical Foundations., pp. 315-335, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Andreas Blass, Yuri Gurevich |
On Quantum Computation, Anyons, and Categories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Martin Davis on Computability, Computational Logic, and Mathematical Foundations ![In: Martin Davis on Computability, Computational Logic, and Mathematical Foundations., pp. 209-241, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti |
Banishing Ultrafilters from Our Consciousness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Martin Davis on Computability, Computational Logic, and Mathematical Foundations ![In: Martin Davis on Computability, Computational Logic, and Mathematical Foundations., pp. 255-283, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Don Perlis |
Taking Physical Infinity Seriously. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Martin Davis on Computability, Computational Logic, and Mathematical Foundations ![In: Martin Davis on Computability, Computational Logic, and Mathematical Foundations., pp. 243-254, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Martin Davis |
Concluding Comments by Martin. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Martin Davis on Computability, Computational Logic, and Mathematical Foundations ![In: Martin Davis on Computability, Computational Logic, and Mathematical Foundations., pp. 357-362, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Yiannis N. Moschovakis |
Hyperarithmetical Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Martin Davis on Computability, Computational Logic, and Mathematical Foundations ![In: Martin Davis on Computability, Computational Logic, and Mathematical Foundations., pp. 107-149, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Martin Davis |
Pragmatic Platonism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Martin Davis on Computability, Computational Logic, and Mathematical Foundations ![In: Martin Davis on Computability, Computational Logic, and Mathematical Foundations., pp. 349-356, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Alexandra Shlapentokh |
Extensions of Hilbert's Tenth Problem: Definability and Decidability in Number Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Martin Davis on Computability, Computational Logic, and Mathematical Foundations ![In: Martin Davis on Computability, Computational Logic, and Mathematical Foundations., pp. 55-92, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Yuri V. Matiyasevich |
Martin Davis and Hilbert's Tenth Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Martin Davis on Computability, Computational Logic, and Mathematical Foundations ![In: Martin Davis on Computability, Computational Logic, and Mathematical Foundations., pp. 35-54, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
39 | Gerald E. Sacks |
E-recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 301-314, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | S. Barry Cooper |
Local Degree Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 121-153, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | Dag Normann |
The Continuous Functionals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 251-275, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | Klaus Ambos-Spies |
Polynomial Time Reducibilities and Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 683-705, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | Edward R. Griffor |
Preface. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. v-vii, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | Peter Clote |
Computation Models and Function Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 589-681, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | Peter G. Hinman |
Recursion on Abstract Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 315-359, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | Piergiorgio Odifreddi |
Reducibilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 89-119, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | Terrence Millar |
Pure Recursive Model Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 507-532, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | C. T. Chong, Sy D. Friedman |
Ordinal Recursion Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 277-299, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | Robert I. Soare |
An Overview of the Computably Enumerable Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 199-248, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | Richard A. Shore |
The Recursively Enumerable Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 169-197, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | Helmut Schwichtenberg |
Classifying Recursive Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 533-586, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | Theodore A. Slaman |
The Global Structure of the Turing Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 155-168, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | Viggo Stoltenberg-Hansen, John V. Tucker |
Computable Rings and Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 363-447, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
39 | Yuri Leonidovich Ershov |
Theory of Numberings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 473-503, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
37 | Pieter Collins, Ivan S. Zapreev |
Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RP ![In: Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings, pp. 107-119, 2009, Springer, 978-3-642-04419-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
CTL *, Model Checking, Computability, Dynamic Systems |
37 | Wilfried Sieg |
On mind & Turing's machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nat. Comput. ![In: Nat. Comput. 6(2), pp. 187-205, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
absolutely unsolvable (undecidable), axiom of infinity, Church’s Thesis, Diophantine problem, finite machine, general recursive function, mechanical computability, objective mathematics, subjective mathematics, Turing machine |
37 | Mark Braverman, Michael Yampolsky |
Constructing non-computable Julia sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 709-716, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Julia sets, real computation, computability, dynamical systems |
37 | Haiming Chen, Yunmei Dong |
Towards Practical Computable Functions on Context-Free Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings, pp. 555-565, 2006, Springer, 3-540-34021-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
computability, operator, structured data, context-free language, recursive function |
37 | Ning Zhong 0002, Klaus Weihrauch |
Computatbility theory of generalized functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 50(4), pp. 469-505, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
computability on distributions, computable real functions, Computable analysis |
35 | Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio |
The Computability Path Ordering: The End of a Quest. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings, pp. 1-14, 2008, Springer, 978-3-540-87530-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Hong-Cheu Liu, Jeffrey Xu Yu |
On Safety, Computability and Local Property of Web Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb ![In: Progress in WWW Research and Development, 10th Asia-Pacific Web Conference, APWeb 2008, Shenyang, China, April 26-28, 2008. Proceedings, pp. 251-262, 2008, Springer, 978-3-540-78848-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
35 | Yatao Xu, Tanja Grubba |
Computability on Subsets of Locally Compact Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 100-114, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Frédéric Blanqui |
Computability Closure: Ten Years Later. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rewriting, Computation and Proof ![In: Rewriting, Computation and Proof, Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday, pp. 68-88, 2007, Springer, 978-3-540-73146-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Vasco Brattka, Guido Gherardi |
Borel Complexity of Topological Operations on Computable Metric Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 83-97, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
effective descriptive set theory, Borel measurability, hyperspace topologies, Computable analysis |
35 | Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio |
Higher-Order Termination: From Kruskal to Computability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings, pp. 1-14, 2006, Springer, 3-540-48281-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Benedikt Löwe |
Space Bounds for Infinitary Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, pp. 319-329, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | S. Barry Cooper |
Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings, pp. 1-7, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
35 | George Barmpalias |
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings, pp. 8-17, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
35 | Peter Koepke |
Computing a Model of Set Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: New Computational Paradigms, First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings, pp. 223-232, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
35 | Margarita V. Korovina, Oleg V. Kudinov |
Semantic Characterisations of Second-Order Computability over the Real Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings, pp. 160-172, 2001, Springer, 3-540-42554-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
35 | Pietro Di Gianantonio |
Real Number Computability and Domain Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1993, 18th International Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993, Proceedings, pp. 413-422, 1993, Springer, 3-540-57182-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
31 | Franco Turini |
The Semantics of Ugo Montanari. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Concurrency, Graphs and Models ![In: Concurrency, Graphs and Models, Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday, pp. 804-805, 2008, Springer, 978-3-540-68676-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Yuri Gurevich, Dirk Leinders, Jan Van den Bussche |
A Theory of Stream Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DBPL ![In: Database Programming Languages, 11th International Symposium, DBPL 2007, Vienna, Austria, September 23-24, 2007, Revised Selected Papers, pp. 153-168, 2007, Springer, 978-3-540-75986-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Xizhong Zheng |
Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 327-337, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
c.e. sets, c.e. reals, bounded c.e. reals, Ershov’s Hierarchy |
31 | Margarita V. Korovina |
Recent Advances in S-Definability over Continuous Data Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ershov Memorial Conference ![In: Perspectives of Systems Informatics, 5th International Andrei Ershov Memorial Conference, PSI 2003, Akademgorodok, Novosibirsk, Russia, July 9-12, 2003, Revised Papers, pp. 238-247, 2003, Springer, 3-540-20813-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Xizhong Zheng |
On the Divergence Bounded Computable Real Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, pp. 102-111, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Lew Gordeev |
Proof Theory and Post-turing Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proof Theory in Computer Science ![In: Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings, pp. 130-152, 2001, Springer, 3-540-42752-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Klaus Weihrauch |
A Foundation for Computable Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Foundations of Computer Science: Potential - Theory - Cognition ![In: Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday, pp. 185-199, 1997, Springer, 3-540-63746-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
30 | Paul Brodhead, Bjørn Kjos-Hanssen |
The Strength of the Grätzer-Schmidt Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, pp. 59-67, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
computability theory, lattice theory |
30 | David Diamondstone, Bjørn Kjos-Hanssen |
Members of Random Closed Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, pp. 144-153, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
random closed sets, computability theory |
30 | Thomas Anberrée |
First-Order Universality for Real Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, pp. 1-10, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
real number computation, simply typed lambda-calculus, computability, denotational semantics |
30 | Douglas Cenzer, Rebecca Weber, Guohua Wu |
Immunity for Closed Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings, pp. 109-117, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Computability, Classes |
30 | Peter Koepke, Russell G. Miller |
An Enhanced Theory of Infinite Time Register Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, Proceedings, pp. 306-315, 2008, Springer, 978-3-540-69405-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
ordinal computability, hypercomputation, infinitary computation, register machine |
30 | Frieder Nake |
Computer art: creativity and computability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Creativity & Cognition ![In: Proceedings of the 6th Conference on Creativity & Cognition, Washington, DC, USA, June 13-15, 2007, pp. 305-306, 2007, ACM, 978-1-59593-712-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
algorithmic revolution, algorithmic sign, computability, creativity, computer art |
30 | Giangiacomo Gerla |
Multi-valued Logics, Effectiveness and Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 336-347, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Fuzzy grammar, Fuzzy Turing Machine, Church Thesis, Fuzzy logic, Computability, Multi-valued logic, Domain theory |
30 | George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber |
K -Trivial Closed Sets and Continuous Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 135-145, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Computability, Randomness, Classes |
30 | Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu |
Pseudojump Operators and P01 Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 146-151, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Computability, Classes |
30 | Giuseppe Trautteur |
Does the Cell Compute? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 742-747, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Virtuality, Computability, Systems biology |
30 | John V. Tucker, Jeffery I. Zucker |
Abstract computability and algebraic specification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 3(2), pp. 279-333, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Abstract computability, conditional equations, metric algebras, topological algebras, algebraic specification, computable analysis, equational logic |
30 | John H. Reif, J. D. Tygar, Akitoshi Yoshida |
The Computability and Complexity of Optical Beam Tracing ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, pp. 106-114, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
optical models, refractive surfaces, undecidable problem, PSPACE-hard problem, optical beam tracing, ray-tracing problem, reflective surfaces, incident angle, complexity, computability |
29 | Lorenzo Galeotti, Ethan S. Lewis, Benedikt Löwe |
Symmetry for Transfinite Computability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Unity of Logic and Computation - 19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24-28, 2023, Proceedings, pp. 65-76, 2023, Springer, 978-3-031-36977-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
29 | Sam Sanders |
The Non-normal Abyss in Kleene's Computability Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Unity of Logic and Computation - 19th Conference on Computability in Europe, CiE 2023, Batumi, Georgia, July 24-28, 2023, Proceedings, pp. 37-49, 2023, Springer, 978-3-031-36977-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
29 | Holger Boche, Volker Pohl |
On Non-Detectability of Non-Computability and the Degree of Non-Computability of Solutions of Circuit and Wave Equations on Digital Computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 68(8), pp. 5561-5578, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Holger Boche, Volker Pohl |
On non-detectability of non-computability and the degree of non-computability of solutions of circuit and wave equations on digital computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.12626, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Ulrich Berger 0001, Johanna N. Y. Franklin, Florin Manea, Arno Pauly (eds.) |
Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![Springer, 978-3-031-08739-4 The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | William R. Stirton |
Barendregt's Problem #26 and Combinatory Strong Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 313-326, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Ingo Blechschmidt, Peter Schuster 0001 |
Maximal Ideals in Countable Rings, Constructively. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 24-38, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Robert S. Lubarsky |
On the Necessity of Some Topological Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 162-171, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Makoto Fujiwara |
An Extension of the Equivalence Between Brouwer's Fan Theorem and Weak König's Lemma with a Uniqueness Hypothesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 115-124, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Svetlana Selivanova |
Computational Complexity of Classical Solutions of Partial Differential Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 299-312, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Merlin Carl |
Lower Bounds on β (α ). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 64-73, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Eike Neumann |
On Envelopes and Backward Approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 220-233, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Vanja Doskoc, Timo Kötzing |
Maps of Restrictions for Behaviourally Correct Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 103-114, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov |
Enumerating Classes of Effective Quasi-Polish Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 88-102, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Bjørn Kjos-Hanssen, David J. Webb |
Strong Medvedev Reducibilities and the KL-Randomness Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 151-161, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Victor L. Selivanov |
Boole vs Wadge: Comparing Two Basic Tools of Descriptive Set Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 287-298, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Iosif Petrakis, Daniel Misselbeck-Wessel |
Algebras of Complemented Subsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 246-258, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Véronique Bruyère |
A Game-Theoretic Approach for the Synthesis of Complex Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 52-63, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | María Dolores Jiménez-López |
Processing Natural Language with Biomolecules: Where Linguistics, Biology and Computation Meet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 139-150, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Juvenal Murwanashyaka |
Weak Sequential Theories of Finite Full Binary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 208-219, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
29 | Anupam Das 0002, Avgerinos Delkos |
Proof Complexity of Monotone Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Revolutions and Revelations in Computability - 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11-15, 2022, Proceedings, pp. 74-87, 2022, Springer, 978-3-031-08739-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|