Search results for "Computability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
39	Jeffry L. Hirst, Carl Mummert	Reverse Mathematics of Matroids.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Michael R. Fellows	Surfing with Rod.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Laurent Bienvenu, Rutger Kuyper	Parallel and Serial Jumps of Weak Weak König's Lemma.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Keng Meng Ng	On Being Rod's Graduate Student.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Pilar Albert, Elvira Mayordomo, Philippe Moser	Bounded Pushdown Dimension vs Lempel Ziv Information Density.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Sam Buss, Douglas Cenzer, Mia Minnes, Jeffrey B. Remmel	Injection Structures Specified by Finite State Transducers.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	André Nies	Lowness, Randomness, and Computable Analysis.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Nazif G. Khisamiev, Ivan V. Latkin	On Constructive Nilpotent Groups.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Bjørn Kjos-Hanssen	Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	C. T. Chong	1-Generic Degrees Bounding Minimal Degrees Revisited.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Leigh Evron, Joseph R. Mileti, Ethan Ratliff-Crain	Irreducibles and Primes in Computable Integral Domains.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Russell Miller 0001	Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Martin Davis	My Life as a Logician.	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
39	Wilfried Sieg, Máté Szabó, Dawn McLaughlin	Why Post Did [Not] Have Turing's Thesis.	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
39	Eugenio G. Omodeo	Martin Davis's Bibliography 1950-2015.	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
39	Peter Szabó, Jörg H. Siekmann, Michael Hoche	What Is Essential Unification?	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
39	Hilary Putnam	On Davis's "Pragmatic Platonism".	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
39	Laura Elena Morales Guerrero	A Story of Hilbert's Tenth Problem.	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
39	Donald W. Loveland, Ashish Sabharwal, Bart Selman	DPLL: The Core of Modern Satisfiability Solvers.	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
39	Andreas Blass, Yuri Gurevich	On Quantum Computation, Anyons, and Categories.	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
39	Domenico Cantone, Eugenio G. Omodeo, Alberto Policriti	Banishing Ultrafilters from Our Consciousness.	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
39	Don Perlis	Taking Physical Infinity Seriously.	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
39	Martin Davis	Concluding Comments by Martin.	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
39	Yiannis N. Moschovakis	Hyperarithmetical Sets.	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
39	Martin Davis	Pragmatic Platonism.	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
39	Alexandra Shlapentokh	Extensions of Hilbert's Tenth Problem: Definability and Decidability in Number Theory.	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
39	Yuri V. Matiyasevich	Martin Davis and Hilbert's Tenth Problem.	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
39	Gerald E. Sacks	E-recursion.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
39	S. Barry Cooper	Local Degree Theory.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
39	Dag Normann	The Continuous Functionals.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
39	Klaus Ambos-Spies	Polynomial Time Reducibilities and Degrees.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
39	Edward R. Griffor	Preface.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
39	Peter Clote	Computation Models and Function Algebras.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
39	Peter G. Hinman	Recursion on Abstract Structures.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
39	Piergiorgio Odifreddi	Reducibilities.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
39	Terrence Millar	Pure Recursive Model Theory.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
39	C. T. Chong, Sy D. Friedman	Ordinal Recursion Theory.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
39	Robert I. Soare	An Overview of the Computably Enumerable Sets.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
39	Richard A. Shore	The Recursively Enumerable Degrees.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
39	Helmut Schwichtenberg	Classifying Recursive Functions.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
39	Theodore A. Slaman	The Global Structure of the Turing Degrees.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
39	Viggo Stoltenberg-Hansen, John V. Tucker	Computable Rings and Fields.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
39	Yuri Leonidovich Ershov	Theory of Numberings.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
37	Pieter Collins, Ivan S. Zapreev	Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems.	RP	2009	DBLP DOI BibTeX RDF	CTL *, Model Checking, Computability, Dynamic Systems
37	Wilfried Sieg	On mind & Turing's machines.	Nat. Comput.	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.	STOC	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.	TAMC	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.	J. ACM	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.	CSL	2008	DBLP DOI BibTeX RDF
35	Hong-Cheu Liu, Jeffrey Xu Yu	On Safety, Computability and Local Property of Web Queries.	APWeb	2008	DBLP DOI BibTeX RDF
35	Yatao Xu, Tanja Grubba	Computability on Subsets of Locally Compact Spaces.	TAMC	2007	DBLP DOI BibTeX RDF
35	Frédéric Blanqui	Computability Closure: Ten Years Later.	Rewriting, Computation and Proof	2007	DBLP DOI BibTeX RDF
35	Vasco Brattka, Guido Gherardi	Borel Complexity of Topological Operations on Computable Metric Spaces.	CiE	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.	LPAR	2006	DBLP DOI BibTeX RDF
35	Benedikt Löwe	Space Bounds for Infinitary Computation.	CiE	2006	DBLP DOI BibTeX RDF
35	S. Barry Cooper	Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It.	CiE	2005	DBLP DOI BibTeX RDF
35	George Barmpalias	Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees.	CiE	2005	DBLP DOI BibTeX RDF
35	Peter Koepke	Computing a Model of Set Theory.	CiE	2005	DBLP DOI BibTeX RDF
35	Margarita V. Korovina, Oleg V. Kudinov	Semantic Characterisations of Second-Order Computability over the Real Numbers.	CSL	2001	DBLP DOI BibTeX RDF
35	Pietro Di Gianantonio	Real Number Computability and Domain Theory.	MFCS	1993	DBLP DOI BibTeX RDF
31	Franco Turini	The Semantics of Ugo Montanari.	Concurrency, Graphs and Models	2008	DBLP DOI BibTeX RDF
31	Yuri Gurevich, Dirk Leinders, Jan Van den Bussche	A Theory of Stream Queries.	DBPL	2007	DBLP DOI BibTeX RDF
31	Xizhong Zheng	Bounded Computable Enumerability and Hierarchy of Computably Enumerable Reals.	COCOON	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.	Ershov Memorial Conference	2003	DBLP DOI BibTeX RDF
31	Xizhong Zheng	On the Divergence Bounded Computable Real Numbers.	COCOON	2003	DBLP DOI BibTeX RDF
31	Lew Gordeev	Proof Theory and Post-turing Analysis.	Proof Theory in Computer Science	2001	DBLP DOI BibTeX RDF
31	Klaus Weihrauch	A Foundation for Computable Analysis.	Foundations of Computer Science: Potential - Theory - Cognition	1997	DBLP DOI BibTeX RDF
30	Paul Brodhead, Bjørn Kjos-Hanssen	The Strength of the Grätzer-Schmidt Theorem.	CiE	2009	DBLP DOI BibTeX RDF	computability theory, lattice theory
30	David Diamondstone, Bjørn Kjos-Hanssen	Members of Random Closed Sets.	CiE	2009	DBLP DOI BibTeX RDF	random closed sets, computability theory
30	Thomas Anberrée	First-Order Universality for Real Programs.	CiE	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.	CiE	2009	DBLP DOI BibTeX RDF	Computability, Classes
30	Peter Koepke, Russell G. Miller	An Enhanced Theory of Infinite Time Register Machines.	CiE	2008	DBLP DOI BibTeX RDF	ordinal computability, hypercomputation, infinitary computation, register machine
30	Frieder Nake	Computer art: creativity and computability.	Creativity & Cognition	2007	DBLP DOI BibTeX RDF	algorithmic revolution, algorithmic sign, computability, creativity, computer art
30	Giangiacomo Gerla	Multi-valued Logics, Effectiveness and Domains.	CiE	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.	CiE	2007	DBLP DOI BibTeX RDF	Computability, Randomness, Classes
30	Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu	Pseudojump Operators and P01 Classes.	CiE	2007	DBLP DOI BibTeX RDF	Computability, Classes
30	Giuseppe Trautteur	Does the Cell Compute?	CiE	2007	DBLP DOI BibTeX RDF	Virtuality, Computability, Systems biology
30	John V. Tucker, Jeffery I. Zucker	Abstract computability and algebraic specification.	ACM Trans. Comput. Log.	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	FOCS	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.	CiE	2023	DBLP DOI BibTeX RDF
29	Sam Sanders	The Non-normal Abyss in Kleene's Computability Theory.	CiE	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.	IEEE Trans. Inf. Theory	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.	CoRR	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	CiE	2022	DBLP DOI BibTeX RDF
29	William R. Stirton	Barendregt's Problem #26 and Combinatory Strong Reduction.	CiE	2022	DBLP DOI BibTeX RDF
29	Ingo Blechschmidt, Peter Schuster 0001	Maximal Ideals in Countable Rings, Constructively.	CiE	2022	DBLP DOI BibTeX RDF
29	Robert S. Lubarsky	On the Necessity of Some Topological Spaces.	CiE	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.	CiE	2022	DBLP DOI BibTeX RDF
29	Svetlana Selivanova	Computational Complexity of Classical Solutions of Partial Differential Equations.	CiE	2022	DBLP DOI BibTeX RDF
29	Merlin Carl	Lower Bounds on β (α ).	CiE	2022	DBLP DOI BibTeX RDF
29	Eike Neumann	On Envelopes and Backward Approximations.	CiE	2022	DBLP DOI BibTeX RDF
29	Vanja Doskoc, Timo Kötzing	Maps of Restrictions for Behaviourally Correct Learning.	CiE	2022	DBLP DOI BibTeX RDF
29	Matthew de Brecht, Takayuki Kihara, Victor L. Selivanov	Enumerating Classes of Effective Quasi-Polish Spaces.	CiE	2022	DBLP DOI BibTeX RDF
29	Bjørn Kjos-Hanssen, David J. Webb	Strong Medvedev Reducibilities and the KL-Randomness Problem.	CiE	2022	DBLP DOI BibTeX RDF
29	Victor L. Selivanov	Boole vs Wadge: Comparing Two Basic Tools of Descriptive Set Theory.	CiE	2022	DBLP DOI BibTeX RDF
29	Iosif Petrakis, Daniel Misselbeck-Wessel	Algebras of Complemented Subsets.	CiE	2022	DBLP DOI BibTeX RDF
29	Véronique Bruyère	A Game-Theoretic Approach for the Synthesis of Complex Systems.	CiE	2022	DBLP DOI BibTeX RDF
29	María Dolores Jiménez-López	Processing Natural Language with Biomolecules: Where Linguistics, Biology and Computation Meet.	CiE	2022	DBLP DOI BibTeX RDF
29	Juvenal Murwanashyaka	Weak Sequential Theories of Finite Full Binary Trees.	CiE	2022	DBLP DOI BibTeX RDF
29	Anupam Das 0002, Avgerinos Delkos	Proof Complexity of Monotone Branching Programs.	CiE	2022	DBLP DOI BibTeX RDF