Search results for "Computability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
119	Klaus Weihrauch	Computability on the Probability Measures on the Borel Sets of the Unit Interval.	ICALP	1997	DBLP DOI BibTeX RDF
93	Giorgi Japaridze	Propositional computability logic I.	ACM Trans. Comput. Log.	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.	ACM Southeast Regional Conference	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.	CCA	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.	CiE	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.	CiE	2008	DBLP DOI BibTeX RDF	perfect local computability, simulation, computability, Category theory, local computability
71	Robert I. Soare	Computability and Incomputability.	CiE	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.	CSL	1998	DBLP DOI BibTeX RDF
62	Giorgi Japaridze	Propositional computability logic II.	ACM Trans. Comput. Log.	2006	DBLP DOI BibTeX RDF	interactive algorithms, linear logic, game semantics, Computability logic, computational resources
60	Peter Koepke	Ordinal Computability.	CiE	2009	DBLP DOI BibTeX RDF	Ordinal machines, Infinite Time Register Machines, Constructible sets
60	Xizhong Zheng	A Computability Theory of Real Numbers.	CiE	2006	DBLP DOI BibTeX RDF
60	Abbas Edalat, Ali Asghar Khanban, André Lieutier	Computability in Computational Geometry.	CiE	2005	DBLP DOI BibTeX RDF
55	James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers	Computability and Complexity in Self-assembly.	CiE	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.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
53	Udi Boker, Nachum Dershowitz	Honest Computability and Complexity.	Martin Davis on Computability, Computational Logic, and Mathematical Foundations	2016	DBLP DOI BibTeX RDF
53	Marian Boykan Pour-El	The Structure of Computability in Analysis and Physical Theory.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
53	Douglas Cenzer	∏10 Classes in Computability Theory.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
53	Robert I. Soare	The History and Concept of Computability.	Handbook of Computability Theory	1999	DBLP DOI BibTeX RDF
52	Hiroto Yasuura	Locally Computable Coding for Unary Operations.	Concurrency: Theory, Language, And Architecture	1989	DBLP DOI BibTeX RDF
52	Ker-I Ko, Klaus Weihrauch	On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries.	CCC	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.	CiE	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.	Appl. Algebra Eng. Commun. Comput.	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.	CiE	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.	Arch. Math. Log.	2006	DBLP DOI BibTeX RDF	TTE, Measurable set, computable topological space, Measure, Computability
51	Orit Hazzan	Reducing abstraction level when learning computability theory concepts.	ITiCSE	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.	FSTTCS	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.	CiE	2005	DBLP DOI BibTeX RDF
50	Wilfried Sieg	Computability and Discrete Dynamical Systems.	CiE	2005	DBLP DOI BibTeX RDF
47	Antje Nowack	A Guarded Fragment for Abstract State Machines.	J. Log. Lang. Inf.	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.	CiE	2007	DBLP DOI BibTeX RDF
46	Xizhong Zheng, George Barmpalias	On the Monotonic Computability of Semi-computable Real Numbers.	DMTCS	2003	DBLP DOI BibTeX RDF
46	Hiroyasu Kamo	Effective Contraction Theorem and Its Application.	CCA	2000	DBLP DOI BibTeX RDF
46	Yehoshua Sagiv	On Testing Effective Computability of Magic Programs.	DOOD	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).	SIGMOD Conference	1988	DBLP DOI BibTeX RDF	DATALOG
46	Joel David Hamkins, Russell G. Miller	Post's Problem for Ordinal Register Machines.	CiE	2007	DBLP DOI BibTeX RDF	ordinal computability, ordinal register machine, Post’s Problem, computability
46	John Havlicek	Computable Obstructions to Wait-free Computability.	FOCS	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.	CiE	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.	CiE	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.	CiE	2007	DBLP DOI BibTeX RDF	simulation, complexity, computability, universality, amorphous computers
43	Henry Yuen	Einstein Meets Turing: The Computability of Nonlocal Games.	CiE	2021	DBLP DOI BibTeX RDF
43	Daniel Silva Graça, Ning Zhong 0002	Computability of Limit Sets for Two-Dimensional Flows.	CiE	2021	DBLP DOI BibTeX RDF
43	Mathieu Hoyrup, Takayuki Kihara, Victor L. Selivanov	Degrees of Non-computability of Homeomorphism Types of Polish Spaces.	CiE	2020	DBLP DOI BibTeX RDF
43	Shu-Ming Sun, Ning Zhong 0002, Martin Ziegler 0001	On Computability of Navier-Stokes' Equation.	CiE	2015	DBLP DOI BibTeX RDF
43	Peter Hertling	Computable Real Functions: Type 1 Computability Versus Type 2 Computability.	CCA	1996	DBLP BibTeX RDF
42	Kohtaro Tadaki	Fixed Point Theorems on Partial Randomness.	LFCS	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.	MCU	2007	DBLP DOI BibTeX RDF
42	Gunter Grieser, Klaus P. Jantke, Steffen Lange	Towards the Validation of Inductive Learning Systems.	ALT	1998	DBLP DOI BibTeX RDF
42	Vasco Brattka, Klaus Weihrauch, Xizhong Zheng	Approaches to Effective Semi-continuity of Real Functions.	COCOON	1998	DBLP DOI BibTeX RDF
42	Marian Boykan Pour-El	Computer Science And Recursion Theory.	ACM Annual Conference (1)	1978	DBLP DOI BibTeX RDF
42	Wesley Calvert, Russell G. Miller	Real Computable Manifolds and Homotopy Groups.	UC	2009	DBLP DOI BibTeX RDF	Blum-Shub-Smale computability, Computability, homotopy, manifold
41	John Case	Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems.	Theory Comput. Syst.	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.	CiE	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.	CiE	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.	CiE	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.	CiE	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.	CiE	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.	CiE	2006	DBLP DOI BibTeX RDF	domain representations, computability theory, computable analysis, Domain theory
41	Tie Hou	Coinductive Proofs for Basic Real Computation.	CiE	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.	CiE	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.	CiE	2006	DBLP DOI BibTeX RDF	?01 Classes, Computability, Randomness
41	Douglas Cenzer, Zia Uddin	Logspace Complexity of Functions and Structures.	CiE	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.	Commun. ACM	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.	CiE	2009	DBLP DOI BibTeX RDF
39	Guido Gherardi	Internal Computability.	CiE	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.	CiE	2007	DBLP DOI BibTeX RDF
39	Richard Zach	Kurt Gödel and Computability Theory.	CiE	2006	DBLP DOI BibTeX RDF
39	Arnon Avron	From Constructibility and Absoluteness to Computability and Domain Independence.	CiE	2006	DBLP DOI BibTeX RDF
39	Martin Ziegler 0001	Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.	CiE	2005	DBLP DOI BibTeX RDF
39	Margarita V. Korovina, Oleg V. Kudinov	Towards Computability of Higher Type Continuous Data.	CiE	2005	DBLP DOI BibTeX RDF
39	Margarita V. Korovina, Oleg V. Kudinov	Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory.	CCA	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	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Eric Allender	The Complexity of Complexity.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Rumen D. Dimitrov, Valentina S. Harizanov	The Lattice of Computably Enumerable Vector Spaces.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Carl G. Jockusch Jr.	Herrmann's Beautiful Theorem on Computable Partial Orderings.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	George Barmpalias, Andrew Lewis-Pye	A Note on the Differences of Computably Enumerable Reals.	Computability and Complexity	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.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Johanna N. Y. Franklin	Strength and Weakness in Computable Structure Theory.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Nikolay K. Vereshchagin, Alexander Shen	Algorithmic Statistics: Forty Years Later.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Bjørn Kjos-Hanssen	A Rigid Cone in the Truth-Table Degrees with Jump.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Rupert Hölzl 0001, Dilip Raghavan, Frank Stephan 0001, Jing Zhang	Weakly Represented Families in Reverse Mathematics.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Antonio Montalbán	Effectively Existentially-Atomic Structures.	Computability and Complexity	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.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Vasco Brattka, Guido Gherardi, Rupert Hölzl 0001, Arno Pauly	The Vitali Covering Theorem in the Weihrauch Lattice.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Joseph S. Miller	On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Uri Andrews, Serikzhan A. Badaev, Andrea Sorbi	A Survey on Universal Computably Enumerable Equivalence Relations.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Christian Glaßer, Dung T. Nguyen, Alan L. Selman, Maximilian Witek	Introduction to Autoreducibility and Mitoticity.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Guohua Wu, Mars M. Yamaleev	There Are No Maximal d.c.e. wtt-degrees.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Lance Fortnow	Complexity with Rod.	Computability and Complexity	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.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Stephen G. Simpson	Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Alexandra A. Soskova, Mariya Ivanova Soskova	Enumeration Reducibility and Computable Structure Theory.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen	Effective Bi-immunity and Randomness.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Klaus Ambos-Spies	On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Denis R. Hirschfeldt	Some Questions in Computable Mathematics.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Anil Nerode	Prequel to the Cornell Computer Science Department.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Robert Goldblatt	Cameo of a Consummate Computabilist.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Andrey S. Morozov	Computable Model Theory over the Reals.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Peter A. Cholak	On Splits of Computably Enumerable Sets.	Computability and Complexity	2017	DBLP DOI BibTeX RDF
39	Liang Yu, Yizheng Zhu	On the Reals Which Cannot Be Random.	Computability and Complexity	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.	Computability and Complexity	2017	DBLP DOI BibTeX RDF