Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
119 | Klaus Weihrauch |
Computability on the Probability Measures on the Borel Sets of the Unit Interval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings, pp. 166-176, 1997, Springer, 3-540-63165-8. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
93 | Giorgi Japaridze |
Propositional computability logic I. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 7(2), pp. 302-330, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
interactive algorithms, linear logic, game semantics, Computability logic, computational resources |
93 | Paresh B. Shah, James C. Pleasant |
Formal program verification and computability theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Southeast Regional Conference ![In: Proceedings of the 30th Annual Southeast Regional Conference, 1992, Raleigh, North Carolina, USA, April 8-10, 1992, pp. 471-473, 1992, ACM, 0-89791-506-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
Hoare proof rules, loop programs, primitive recursive functions, computability theory, formal program verification |
77 | Yoshiki Tsujii, Mariko Yasugi, Takakazu Mori |
Some Properties of the Effective Uniform Topological Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCA ![In: Computability and Complexity in Analysis, 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000, Selected Papers, pp. 336-356, 2000, Springer, 3-540-42197-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Effective uniform topological space, Computability structure, Computable function, Binary tree structure, Cylinder function, Amalgamated space of reals, Function with jump points, Partial computability |
76 | Alexey V. Chernov, Jürgen Schmidhuber |
Prefix-Like Complexities and Computability in the Limit. ![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. 85-93, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
limit computability, generalized Turing machine, non-halting computation, Kolmogorov complexity |
76 | Russell Miller 0001, Dustin Mulcahey |
Perfect Local Computability and Computable Simulations. ![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. 447-456, 2008, Springer, 978-3-540-69405-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
perfect local computability, simulation, computability, Category theory, local computability |
71 | Robert I. Soare |
Computability and Incomputability. ![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. 705-715, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Turing a-machine, Church-Turing Thesis, Kurt Gödel, Turing o-machine, computable approximations, effectively continuous functions on reals, computability in analysis, strong reducibilities reexamined, computability, Alan Turing |
67 | Margarita V. Korovina, Oleg V. Kudinov |
Characteristic Properties of Majorant-Computability over the Reals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 188-203, 1998, Springer, 3-540-65922-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
62 | Giorgi Japaridze |
Propositional computability logic II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 7(2), pp. 331-362, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
interactive algorithms, linear logic, game semantics, Computability logic, computational resources |
60 | Peter Koepke |
Ordinal Computability. ![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. 280-289, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Ordinal machines, Infinite Time Register Machines, Constructible sets |
60 | Xizhong Zheng |
A Computability Theory of Real Numbers. ![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. 584-594, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
60 | Abbas Edalat, Ali Asghar Khanban, André Lieutier |
Computability in Computational Geometry. ![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. 117-127, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
55 | James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers |
Computability and Complexity in Self-assembly. ![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. 349-358, 2008, Springer, 978-3-540-69405-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
computational complexity, computability, self-assembly, molecular computing |
53 | Carl G. Jockusch Jr., Paul E. Schupp |
Asymptotic Density and the Theory of Computability: A Partial Survey. ![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. 501-520, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
53 | Udi Boker, Nachum Dershowitz |
Honest Computability and Complexity. ![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. 151-173, 2016, Springer, 978-3-319-41841-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
53 | Marian Boykan Pour-El |
The Structure of Computability in Analysis and Physical Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 449-471, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
53 | Douglas Cenzer |
∏10 Classes in Computability Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 37-85, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
53 | Robert I. Soare |
The History and Concept of Computability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Computability Theory ![In: Handbook of Computability Theory, pp. 3-36, 1999, North-Holland, 978-0-444-89882-1. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
52 | Hiroto Yasuura |
Locally Computable Coding for Unary Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Concurrency: Theory, Language, And Architecture ![In: Concurrency: Theory, Language, And Architecture, UK/Japan Workshop, Oxford, UK, September 25-27, 1989, Proceedings, pp. 312-323, 1989, Springer, 3-540-53932-8. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
52 | Ker-I Ko, Klaus Weihrauch |
On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996, pp. 150-159, 1996, IEEE Computer Society, 0-8186-7386-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Lebesgue measure, two-dimensional region, polynomial-time computable boundary, interior region, polynomial-time computable, computational complexity, computability, computability, Turing machines |
51 | Mathieu Hoyrup, Cristobal Rojas |
An Application of Martin-Löf Randomness to Effective Probability Theory. ![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. 260-269, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
universal test, effective probability theory, Lebesgue integration, layerwise computability, computable analysis, Algorithmic randomness |
51 | Keiichirou Kusakari, Masahiko Sakai |
Enhancing dependency pair method using strong computability in simply-typed term rewriting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 18(5), pp. 407-431, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Simply-typed term rewriting system, Plain function- passing, Strong computability, Termination, Dependency pair |
51 | Russell G. Miller |
Locally Computable Structures. ![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. 575-584, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
extensional, perfectly locally computable, computability, locally computable, computable model theory |
51 | Yongcheng Wu, Decheng Ding |
Computability of measurable sets via effective topologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 45(3), pp. 365-379, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
TTE, Measurable set, computable topological space, Measure, Computability |
51 | Orit Hazzan |
Reducing abstraction level when learning computability theory concepts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITiCSE ![In: Proceedings of the 7th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE 2002, Aarhus, Denmark, June 24-28, 2002, pp. 156-160, 2002, ACM, 1-58113-499-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
mental processes, abstraction, computer science education, computability |
51 | Patrick Bellot |
Unformly Applicative Structures, A Theory of Computability and Polyadic Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Eighth Conference, Pune, India, December 21-23, 1988, Proceedings, pp. 270-285, 1988, Springer, 3-540-50517-2. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
polyadicity, algorithmic, abstraction, computability, representability, recursive function, definability |
50 | Denis R. Hirschfeldt |
Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model 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. 209-210, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
50 | Wilfried Sieg |
Computability and Discrete Dynamical Systems. ![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. 440-440, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
47 | Antje Nowack |
A Guarded Fragment for Abstract State Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Lang. Inf. ![In: J. Log. Lang. Inf. 14(3), pp. 345-368, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Datalog LITE, guarded fixed-point logic, computability, decidability, Abstract State Machines, expressive power, guarded fragment |
46 | José Félix Costa, Bruno Loff, Jerzy Mycka |
The New Promise of Analog Computation. ![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. 189-195, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
46 | Xizhong Zheng, George Barmpalias |
On the Monotonic Computability of Semi-computable Real Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DMTCS ![In: Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings, pp. 290-300, 2003, Springer, 3-540-40505-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
46 | Hiroyasu Kamo |
Effective Contraction Theorem and Its Application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCA ![In: Computability and Complexity in Analysis, 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000, Selected Papers, pp. 88-100, 2000, Springer, 3-540-42197-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
46 | Yehoshua Sagiv |
On Testing Effective Computability of Magic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DOOD ![In: Deductive and Object-Oriented Databases, Second International Conference, DOOD'91, Munich, Germany, December 16-18, 1991, Proceedings, pp. 244-262, 1991, Springer, 3-540-55015-1. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
46 | Ravi Krishnamurthy, Raghu Ramakrishnan 0001, Oded Shmueli |
A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, June 1-3, 1988., pp. 154-163, 1988, ACM Press, 978-0-89791-268-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
DATALOG |
46 | Joel David Hamkins, Russell G. Miller |
Post's Problem for Ordinal Register Machines. ![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. 358-367, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
ordinal computability, ordinal register machine, Post’s Problem, computability |
46 | John Havlicek |
Computable Obstructions to Wait-free Computability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 80-89, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
computable obstructions, distributed decision task, wait-free protocol, fault-tolerant computation, computability, asynchronous distributed systems, shared-memory model, wait-free computability |
45 | Martín Hötzel Escardó |
Computability of Continuous Solutions of Higher-Type Equations. ![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. 188-197, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Higher-type computability, Kleene-Kreisel spaces of continuous functionals, exhaustible set |
45 | Hajime Ishihara |
Unique Existence and Computability in Constructive Reverse Mathematics. ![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. 368-377, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
unique existence, Brouwer’s fan theorem, weak König lemma, computability, constructive mathematics, reverse mathematics |
45 | Jirí Wiedermann, Lukás Petru |
Computability in Amorphous Structures. ![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. 781-790, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
simulation, complexity, computability, universality, amorphous computers |
43 | Henry Yuen |
Einstein Meets Turing: The Computability of Nonlocal Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings, pp. 483-493, 2021, Springer, 978-3-030-80048-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
43 | Daniel Silva Graça, Ning Zhong 0002 |
Computability of Limit Sets for Two-Dimensional Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings, pp. 494-503, 2021, Springer, 978-3-030-80048-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
43 | Mathieu Hoyrup, Takayuki Kihara, Victor L. Selivanov |
Degrees of Non-computability of Homeomorphism Types of Polish Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29 - July 3, 2020, Proceedings, pp. 189-192, 2020, Springer, 978-3-030-51465-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
43 | Shu-Ming Sun, Ning Zhong 0002, Martin Ziegler 0001 |
On Computability of Navier-Stokes' Equation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Evolving Computability - 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29 - July 3, 2015. Proceedings, pp. 334-342, 2015, Springer, 978-3-319-20027-9. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
43 | Peter Hertling |
Computable Real Functions: Type 1 Computability Versus Type 2 Computability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCA ![In: Second Workshop on Computability and Complexity in Analysis, CCA 1996, August 22-23, 1996, Trier, Germany., 1996, Unjiversity of Trier. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP BibTeX RDF |
|
42 | Kohtaro Tadaki |
Fixed Point Theorems on Partial Randomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LFCS ![In: Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings, pp. 422-440, 2009, Springer, 978-3-540-92686-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
partial randomness, Chaitin’s ? number, algorithmic information theory, thermodynamic quantities, fixed point theorem, Algorithmic randomness |
42 | Joel David Hamkins |
A Survey of Infinite Time Turing Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCU ![In: Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, Proceedings, pp. 62-71, 2007, Springer, 978-3-540-74592-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
42 | Gunter Grieser, Klaus P. Jantke, Steffen Lange |
Towards the Validation of Inductive Learning Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALT ![In: Algorithmic Learning Theory, 9th International Conference, ALT '98, Otzenhausen, Germany, October 8-10, 1998, Proceedings, pp. 409-423, 1998, Springer, 3-540-65013-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
42 | Vasco Brattka, Klaus Weihrauch, Xizhong Zheng |
Approaches to Effective Semi-continuity of Real Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 4th Annual International Conference, COCOON '98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings, pp. 184-193, 1998, Springer, 3-540-64824-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
42 | Marian Boykan Pour-El |
Computer Science And Recursion Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Annual Conference (1) ![In: Proceedings 1978 ACM Annual Conference, Washington, DC, USA, December 4-6, 1978, Volume I, pp. 15-20, 1978, ACM, 978-0-89791-000-2. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
|
42 | Wesley Calvert, Russell G. Miller |
Real Computable Manifolds and Homotopy Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UC ![In: Unconventional Computation, 8th International Conference, UC 2009, Ponta Delgada, Azores, Portugal, September 7-11, 2009. Proceedings, pp. 98-109, 2009, Springer, 978-3-642-03744-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Blum-Shub-Smale computability, Computability, homotopy, manifold |
41 | John Case |
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(4), pp. 773-786, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Computability theoretic learning, Fair polynomial time, Memory limitations, Optimality |
41 | Andrey N. Frolov, Iskander Sh. Kalimullin, Russell G. Miller |
Spectra of Algebraic Fields and Subfields. ![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. 232-241, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Computability, algebraic, field, spectrum, computable model theory |
41 | Douglas A. Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel |
S01 and P01 Equivalence Structures. ![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. 99-108, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
equivalence structures, effective categoricity, computability theory, computable model theory |
41 | John Case, Samuel E. Moelius |
Characterizing Programming Systems Allowing Program Self-reference. ![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. 125-134, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Computability Theory, Programming Language Semantics, Self-Reference |
41 | Joel David Hamkins, David Linetsky, Russell G. Miller |
The Complexity of Quickly ORM-Decidable Sets. ![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. 488-496, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
ordinal computation, infinite time computation, hyperarithmetical hierarchy, complexity, computability, Ordinal, arithmetical hierarchy, register machine |
41 | Anton Setzer |
Partial Recursive Functions in Martin-Löf Type Theory. ![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. 505-515, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Martin-Löf type theory, Kleene index, Kleene brackets, partial recursive functions, inductive-recursive definitions, indexed induction-recursion, computability theory, recursion theory |
41 | Fredrik Dahlgren |
Partial Continuous Functions and Admissible Domain Representations. ![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. 94-104, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
domain representations, computability theory, computable analysis, Domain theory |
41 | Tie Hou |
Coinductive Proofs for Basic Real 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. 221-230, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Real computation, Coinductive proof, Signed digit streams, Minlog, Computability |
41 | Jérôme Durand-Lose |
Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal. ![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. 163-172, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
2-counter automata, Reversibility, Conservativeness, Turing-computability, Rational numbers, Abstract geometrical computation |
41 | Paul Brodhead, Douglas Cenzer, Seyyed Dashti |
Random Closed Sets. ![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. 55-64, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
?01 Classes, Computability, Randomness |
41 | Douglas Cenzer, Zia Uddin |
Logspace Complexity of Functions and Structures. ![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. 75-84, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Complexity, Computability, Computable Model Theory |
41 | Robert McNaughton |
Automata, formal languages abstract switching, and computability in a Ph.D. computer science program. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 11(11), pp. 738-740, 1968. The full citation details ...](Pics/full.jpeg) |
1968 |
DBLP DOI BibTeX RDF |
Ph.D computer science curriculum, Ph.D computer science program, automata, formal languages, theory of computability, switching theory |
39 | Tobias Gärtner, Günter Hotz |
Computability of Analytic Functions with Analytic Machines. ![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. 250-259, 2009, Springer, 978-3-642-03072-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
39 | Guido Gherardi |
Internal Computability. ![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. 348-357, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Nonstandard Analysis, Type-2 Theory of Effectivity, Theory of Representations, Computable Analysis, Constructive Mathematics |
39 | John Case |
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems. ![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. 115-124, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
39 | Richard Zach |
Kurt Gödel and Computability Theory. ![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. 575-583, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Arnon Avron |
From Constructibility and Absoluteness to Computability and Domain Independence. ![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. 11-20, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Martin Ziegler 0001 |
Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. ![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. 562-571, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
39 | Margarita V. Korovina, Oleg V. Kudinov |
Towards Computability of Higher Type Continuous Data. ![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. 235-241, 2005, Springer, 3-540-26179-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
39 | Margarita V. Korovina, Oleg V. Kudinov |
Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCA ![In: Computability and Complexity in Analysis, 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000, Selected Papers, pp. 146-168, 2000, Springer, 3-540-42197-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
39 | Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov, Frances A. Rosamond (eds.) |
Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computability and Complexity ![Springer, 978-3-319-50061-4 The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Eric Allender |
The Complexity of Complexity. ![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. 79-94, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Rumen D. Dimitrov, Valentina S. Harizanov |
The Lattice of Computably Enumerable Vector Spaces. ![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. 366-393, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Carl G. Jockusch Jr. |
Herrmann's Beautiful Theorem on Computable Partial Orderings. ![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. 127-133, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | George Barmpalias, Andrew Lewis-Pye |
A Note on the Differences of Computably Enumerable Reals. ![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. 623-632, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Damir D. Dzhafarov, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick |
Effectiveness of Hindman's Theorem for Bounded Sums. ![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. 134-142, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Johanna N. Y. Franklin |
Strength and Weakness in Computable Structure Theory. ![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. 302-323, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Nikolay K. Vereshchagin, Alexander Shen |
Algorithmic Statistics: Forty Years Later. ![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. 669-737, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Bjørn Kjos-Hanssen |
A Rigid Cone in the Truth-Table Degrees with Jump. ![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. 487-500, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Rupert Hölzl 0001, Dilip Raghavan, Frank Stephan 0001, Jing Zhang |
Weakly Represented Families in Reverse Mathematics. ![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. 160-187, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Antonio Montalbán |
Effectively Existentially-Atomic Structures. ![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. 221-237, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Marat M. Arslanov, Iskander Sh. Kalimullin |
A Survey of Results on the d-c.e. and n-c.e. 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. 469-478, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Vasco Brattka, Guido Gherardi, Rupert Hölzl 0001, Arno Pauly |
The Vitali Covering Theorem in the Weihrauch Lattice. ![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. 188-200, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Joseph S. Miller |
On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals. ![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. 644-659, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi |
A Survey on Universal Computably Enumerable Equivalence Relations. ![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. 418-451, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Christian Glaßer, Dung T. Nguyen, Alan L. Selman, Maximilian Witek |
Introduction to Autoreducibility and Mitoticity. ![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. 56-78, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Guohua Wu, Mars M. Yamaleev |
There Are No Maximal d.c.e. wtt-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. 479-486, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Lance Fortnow |
Complexity 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. 115-121, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Leo Harrington, Richard A. Shore, Theodore A. Slaman |
Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1. ![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. 455-466, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Stephen G. Simpson |
Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions. ![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. 660-668, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Alexandra A. Soskova, Mariya Ivanova Soskova |
Enumeration Reducibility and Computable Structure Theory. ![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. 271-301, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen |
Effective Bi-immunity and Randomness. ![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. 633-643, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Klaus Ambos-Spies |
On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets. ![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. 563-598, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Denis R. Hirschfeldt |
Some Questions in Computable Mathematics. ![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. 22-55, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Anil Nerode |
Prequel to the Cornell Computer Science Department. ![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. 19-21, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Robert Goldblatt |
Cameo of a Consummate Computabilist. ![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. 3-8, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Andrey S. Morozov |
Computable Model Theory over the Reals. ![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. 354-365, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Peter A. Cholak |
On Splits of Computably Enumerable Sets. ![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. 521-535, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Liang Yu, Yizheng Zhu |
On the Reals Which Cannot Be Random. ![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. 611-622, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
39 | Uri Andrews, Rutger Kuyper, Steffen Lempp, Mariya Ivanova Soskova, Mars M. Yamaleev |
Nondensity of Double Bubbles in the D.C.E. 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. 547-562, 2017, Springer, 978-3-319-50061-4. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|