Search results for "Computability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
29	Klaus Weihrauch	Computability on the probability measures on the Borel sets of the unit interval.	CCA	1996	DBLP BibTeX RDF
29	Klaus Weihrauch, Xizhong Zheng	Computability on Continuous, Lower Semi-Continuous and Upper Semi-Continuous Real Functions.	CCA	1996	DBLP BibTeX RDF
29	Joost Engelfriet	The non-computability of computability.	Bull. EATCS	1985	DBLP BibTeX RDF
26	Giorgi Japaridze	Many Concepts and Two Logics of Algorithmic Reduction.	Stud Logica	2009	DBLP DOI BibTeX RDF	Affine logic, Interactivecomputation, Linear logic, Game semantics, Intuitionistic logic, Computability logic
26	John Case, Samuel E. Moelius	Characterizing Programming Systems Allowing Program Self-Reference.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Computable operators, Programming systems, Recursive function theory, Recursive operators, Computability theory, Control structures, Self-reference, Recursion theorem, Numberings
26	Andrea Asperti	The intensional content of Rice's theorem.	POPL	2008	DBLP DOI BibTeX RDF	complexity, computability, recursion theory
26	John Case, Samuel E. Moelius	Properties Complementary to Program Self-reference.	MFCS	2007	DBLP DOI BibTeX RDF	Computability Theory, Programming Language Semantics, Self-Reference
26	Mario Vélez, Juan Ospina	Gravitational Topological Quantum Computation.	UC	2007	DBLP DOI BibTeX RDF	Gravitational computer, Topological quantum computing, link invariants, complexity, computability, entanglement
26	Giuseppe Prencipe	On the Feasibility of Gathering by Autonomous Mobile Robots.	SIROCCO	2005	DBLP DOI BibTeX RDF	Multiplicity Detection, Mobile Robots, Computability, Distributed Models, Distributed Coordination
26	Giuseppe Prencipe	Instantaneous Actions vs. Full Asynchronicity : Controlling and Coordinating a Set of Autonomous Mobile Robots.	ICTCS	2001	DBLP DOI BibTeX RDF	Mobile Robots, Computability, Distributed Models, Distributed Coordination
26	Jack H. Lutz	Gales and the Constructive Dimension of Individual Sequences.	ICALP	2000	DBLP DOI BibTeX RDF	algorithmic information, gales, Hausdorff dimension, computability, randomness, Kolmogorov complexity, martingales, constructive dimension
26	Gertjan van Noord, Joke Dorrepaal, Pim van der Eijk, Maria Florenza, Herbert Ruessink, Louis des Tombe	An overview of MiMo2.	Mach. Transl.	1991	DBLP DOI BibTeX RDF	Dutch, unification grammar, computability, symmetry, reversibility, transfer, English, declarativity
26	David A. Basin	An Environment For Automated Reasoning About Partial Functions.	CADE	1988	DBLP DOI BibTeX RDF	Automated program development, unsolvability, theorem proving, computability, type theory, constructivity, tactics, partial functions
25	Dana Ron, Gilad Tsur	Testing Computability by Width Two OBDDs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
25	David R. Bélanger	Structures of Some Strong Reducibilities.	CiE	2009	DBLP DOI BibTeX RDF
25	Tim Button	Hyperloops Do Not Threaten the Notion of an Effective Procedure.	CiE	2009	DBLP DOI BibTeX RDF
25	Vasco Brattka	Borel complexity and computability of the Hahn-Banach Theorem.	Arch. Math. Log.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 03F60, 46S30, 03E15
25	Anastasia Analyti, Grigoris Antoniou, Carlos Viegas Damásio, Gerd Wagner 0001	On the Computability and Complexity Issues of Extended RDF.	PRICAI	2008	DBLP DOI BibTeX RDF	Extended RDF ontologies, Semantic Web, complexity, rules, negation
25	Jérémie Chalopin, Emmanuel Godard, Yves Métivier	Local Terminations and Distributed Computability in Anonymous Networks.	DISC	2008	DBLP DOI BibTeX RDF
25	Grégory Lafitte, Michael Weiss	Computability of Tilings.	IFIP TCS	2008	DBLP DOI BibTeX RDF
25	Jiming Liu 0001	Autonomy-Oriented Computing (AOC), Self-organized Computability, and Complex Data Mining.	ADMA	2008	DBLP DOI BibTeX RDF
25	Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio	HORPO with Computability Closure: A Reconstruction.	LPAR	2007	DBLP DOI BibTeX RDF
25	Luís Moniz Pereira	Gödel and Computability.	EPIA Workshops	2007	DBLP DOI BibTeX RDF
25	Wolfgang Maass 0001	Liquid Computing.	CiE	2007	DBLP DOI BibTeX RDF
25	Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion	A Classification of Viruses Through Recursion Theorems.	CiE	2007	DBLP DOI BibTeX RDF	iteration theorem, polymorphism, propagation, Computer viruses, recursion theorem
25	Abbas Edalat	A Continuous Derivative for Real-Valued Functions.	CiE	2007	DBLP DOI BibTeX RDF	L-derivative, Clarke gradient, weak* topology, upper semi-continuity
25	Margarita V. Korovina, Oleg V. Kudinov	The Uniformity Principle for Sigma -Definability with Applications to Computable Analysis.	CiE	2007	DBLP DOI BibTeX RDF
25	Victor L. Selivanov	A Useful Undecidable Theory.	CiE	2007	DBLP DOI BibTeX RDF	discrete weak semilattice, partition, theory, reducibility, undecidability, Semilattice
25	Benjamín René Callejas Bedregal, Santiago Figueira	Classical Computability and Fuzzy Turing Machines.	LATIN	2006	DBLP DOI BibTeX RDF
25	Matthias Schröder 0001	Admissible Representations in Computable Analysis.	CiE	2006	DBLP DOI BibTeX RDF
25	Greg Michaelson, W. Paul Cockshott	Constraints on Hypercomputation.	CiE	2006	DBLP DOI BibTeX RDF
25	Klaus Meer, Martin Ziegler 0001	Uncomputability Below the Real Halting Problem.	CiE	2006	DBLP DOI BibTeX RDF
25	Jeffery I. Zucker	Primitive Recursive Selection Functions over Abstract Algebras.	CiE	2006	DBLP DOI BibTeX RDF
25	Wilfried Sieg	Gödel's Conflicting Approaches to Effective Calculability.	CiE	2006	DBLP DOI BibTeX RDF
25	Robert Rettinger, Xizhong Zheng	On the Turing Degrees of Divergence Bounded Computable Reals.	CiE	2005	DBLP DOI BibTeX RDF
25	Giuseppe Trautteur	Beyond the Super-Turing Snare: Analog Computation and Digital Virtuality.	CiE	2005	DBLP DOI BibTeX RDF
25	Klaus Weihrauch	Computable Analysis.	CiE	2005	DBLP DOI BibTeX RDF
25	Ning Zhong 0002	Computable Analysis of a Non-homogeneous Boundary-Value Problem for the Korteweg-de Vries Equation.	CiE	2005	DBLP DOI BibTeX RDF
25	Ulrich Berger 0001	Continuous Semantics for Strong Normalization.	CiE	2005	DBLP DOI BibTeX RDF
25	Yuri V. Matiyasevich	Hilbert's Tenth Problem and Paradigms of Computation.	CiE	2005	DBLP DOI BibTeX RDF
25	Yiannis N. Moschovakis	Recursion and Complexity.	CiE	2005	DBLP DOI BibTeX RDF
25	Dirk Pattinson	Domain-Theoretic Formulation of Linear Boundary Value Problems.	CiE	2005	DBLP DOI BibTeX RDF
25	Margarita V. Korovina, Oleg V. Kudinov	Generalised Computability and Applications to Hybrid Systems.	Ershov Memorial Conference	2001	DBLP DOI BibTeX RDF
25	Klaus Weihrauch, Ning Zhong 0002	Turing Computability of a Nonlinear Schrödinger Propagator.	COCOON	2001	DBLP DOI BibTeX RDF
25	Cristiano Calcagno, Hongseok Yang, Peter W. O'Hearn	Computability and Complexity Results for a Spatial Assertion Language for Data Structures.	FSTTCS	2001	DBLP DOI BibTeX RDF
25	Izumi Takeuti	Effective Fixed Point Theorem over a Non-computably Separable Metric Space.	CCA	2000	DBLP DOI BibTeX RDF
25	George Kapoulas	Polynomially Time Computable Functions over p-Adic Fields.	CCA	2000	DBLP DOI BibTeX RDF
25	Klaus Weihrauch, Ning Zhong 0002	Is the Linear Schrödinger Propagator Turing Computable?	CCA	2000	DBLP DOI BibTeX RDF
25	Matthias Schröder 0001	Admissible Representations of Limit Spaces.	CCA	2000	DBLP DOI BibTeX RDF
25	Armin Hemmerling	Standard Representations of Effective Metric Spaces.	CCA	2000	DBLP DOI BibTeX RDF
25	Charles Meyssonnier, Paolo Boldi, Sebastiano Vigna	delta-Approximable Functions.	CCA	2000	DBLP DOI BibTeX RDF
25	Peter Hertling	Banach-Mazur Computable Functions on Metric Spaces.	CCA	2000	DBLP DOI BibTeX RDF
25	Takakazu Mori	Computabilities of Fine-Continuous Functions.	CCA	2000	DBLP DOI BibTeX RDF	Locally uniform Fine-computable function, Effectively integrable function, Walsh-Fourier coefficients, Walsh-Fourier Series
25	Martin Kummer, Marcus Schäfer 0001	Computability of Convex Sets (Extended Abstract).	STACS	1995	DBLP DOI BibTeX RDF
25	Philippe Darondeau	Concurrency and Computability.	Semantics of Systems of Concurrent Processes	1990	DBLP DOI BibTeX RDF
25	Klaus Weihrauch	A Generalized Computability Thesis (Abstract).	MFCS	1977	DBLP DOI BibTeX RDF
21	Paola Flocchini, Bernard Mans, Nicola Santoro	Exploration of Periodically Varying Graphs.	ISAAC	2009	DBLP DOI BibTeX RDF
21	Andrea Sorbi	Strong Positive Reducibilities.	TAMC	2009	DBLP DOI BibTeX RDF
21	S. Barry Cooper	The Extended Turing Model as Contextual Tool.	TAMC	2009	DBLP DOI BibTeX RDF
21	Mathieu Hoyrup, Cristobal Rojas	Applications of Effective Probability Theory to Martin-Löf Randomness.	ICALP (1)	2009	DBLP DOI BibTeX RDF
21	Chee-Keng Yap	Theory of Real Computation According to EGC.	Reliable Implementation of Real Number Algorithms	2008	DBLP DOI BibTeX RDF
21	Boris A. Trakhtenbrot	From Logic to Theoretical Computer Science - An Update.	Pillars of Computer Science	2008	DBLP DOI BibTeX RDF
21	Hong-Viet Luong, Thomas Lambolais, Anne-Lise Courbis	Implementation of the Conformance Relation for Incremental Development of Behavioural Models.	MoDELS	2008	DBLP DOI BibTeX RDF
21	Ruipeng Li, Hai Jiang 0003, Hung-Chi Su, Bin Zhang 0005, Jeff Jenness	Speculative and distributed simulation of many-particle collision systems.	ICPADS	2007	DBLP DOI BibTeX RDF
21	Rod Downey, Noam Greenberg	Totally < ωω Computably Enumerable and m-topped Degrees.	TAMC	2006	DBLP DOI BibTeX RDF
21	Marios Mavronicolas, Loizos Michael, Paul G. Spirakis	Computing on a Partially Eponymous Ring.	OPODIS	2006	DBLP DOI BibTeX RDF
21	Qing Zhou, Weihao Hu	Decidability in Analysis.	Computing	2005	DBLP DOI BibTeX RDF	almost decidable, Decidable
21	Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungju Park, Chee-Keng Yap	Shortest path amidst disc obstacles is computable.	SCG	2005	DBLP DOI BibTeX RDF	disc obstacles, guaranteed precision computation, real RAM model, robust numerical algorithms, shortest path, exact geometric computation, exponential complexity
21	Jerzy Mycka, José Félix Costa	The Computational Power of Continuous Dynamic Systems.	MCU	2004	DBLP DOI BibTeX RDF
21	Hong-Cheu Liu, Weifa Liang	Safe Web Queries.	APWeb	2004	DBLP DOI BibTeX RDF
21	Marcus Hutter	On the Existence and Convergence of Computable Universal Priors.	ALT	2003	DBLP DOI BibTeX RDF
21	Xizhong Zheng, Robert Rettinger, Romain Gengler	Ershov's Hierarchy of Real Numbers.	MFCS	2003	DBLP DOI BibTeX RDF
21	Frédéric Blanqui	Rewriting Modulo in Deduction Modulo.	RTA	2003	DBLP DOI BibTeX RDF
21	Margarita V. Korovina	Computational Aspects of sigma-Definability over the Real Numbers without the Equality Test.	CSL	2003	DBLP DOI BibTeX RDF
21	Qing Zhou	Relatively Computable Functions of Real Variables.	Computing	2001	DBLP DOI BibTeX RDF	Continuous real valued functions, degrees of unsolvability
21	Bart Kuijpers, Jan Paredaens, Dirk Van Gucht	Towards a Theory of Movie Database Queries.	TIME	2000	DBLP DOI BibTeX RDF	query languages, spatio-temporal databases
21	Jose Maria Turull Torres	Reflective Relational Machines Working on Homogeneous Databases.	FoIKS	2000	DBLP DOI BibTeX RDF
21	Klaus Weihrauch, Ning Zhong 0002	The Wave Propagator Is Turing Computable.	ICALP	1999	DBLP DOI BibTeX RDF
21	Michael Prasse, Peter Rittgen	Bemerkungen zu Peter Wegners Ausführungen über Interaktion und Berechenbarkeit.	Inform. Spektrum	1998	DBLP DOI BibTeX RDF	Interaktionsmaschine, Turingmaschine, Churchsche These, Berechenbarkeit, Algorithmus
21	Chris Hankin, Hanne Riis Nielson, Jens Palsberg	Position Statements on Strategic Directions for Research on Programming Languages.	ACM SIGPLAN Notices	1997	DBLP DOI BibTeX RDF
21	Friedhelm Meyer auf der Heide	On Genuinely Time Bounded Compuations.	STACS	1989	DBLP DOI BibTeX RDF
16	Damien Imbs, Michel Raynal	The multiplicative power of consensus numbers.	PODC	2010	DBLP DOI BibTeX RDF	bg simulation, synchronization power, t-resilience, simulation, fault-tolerance, distributed computability, shared memory system, system model, wait-freedom, asynchronous processes, k-set agreement, consensus number, reduction algorithm, process crash failure
16	Roman G. Strongin	Global Optimization Using Space Filling.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Constrained global optimization, Lipschitz optimization, Peano curve, Index approach, Partial computability, ?-reserved solution, Space filling curve
16	Stephen A. Fenner, William I. Gasarch, Brian Postow	The Complexity of Finding SUBSEQ(A).	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Turing degree, Higman’s lemma, Unbounded search, Recursive mathematics, Computational complexity, Computability, Context-free grammar, Automata theory, Automaton, Context-free language, Subsequence, Reverse mathematics, Bounded queries
16	Damien Imbs, Michel Raynal	Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation.	SSS	2009	DBLP DOI BibTeX RDF	t-Resilience, Wait-free environment, Fault-Tolerance, Distributed computability, Shared memory system, Reduction, Arbiter, Asynchronous processes, Process crash failure
16	Helmut Alt	The Computational Geometry of Comparing Shapes.	Efficient Algorithms	2009	DBLP DOI BibTeX RDF	computational geometry, computability, shapes, distance measures
16	Victor L. Selivanov	Wadge Reducibility and Infinite Computations.	Math. Comput. Sci.	2008	DBLP DOI BibTeX RDF	Wadge reducibility, Baire space, Baire domain, ?-language, k-partition, complexity, topology, computability, automaton
16	Haiming Chen, Mihai Ionescu, Tseren-Onolt Ishdorj, Andrei Paun, Gheorghe Paun, Mario J. Pérez-Jiménez	Spiking neural P systems with extended rules: universality and languages.	Nat. Comput.	2008	DBLP DOI BibTeX RDF	Universality, Membrane computing, Turing computability, Spiking neural P systems, Chomsky hierarchy
16	Xingwu Liu, Juhua Pu, Jianzhong Pan	A Classification of Degenerate Loop Agreement.	IFIP TCS	2008	DBLP DOI BibTeX RDF	loop agreement, classification, distributed computing, computability
16	Gheorghe Paun	A quick overview of membrane computing with some details about spiking neural P systems.	Frontiers Comput. Sci. China	2007	DBLP DOI BibTeX RDF	computational biology, membrane computing, P system, natural computing, Turing computability, spiking neural P system, chomsky hierarchy
16	Martín Hötzel Escardó	Infinite sets that admit fast exhaustive search.	LICS	2007	DBLP DOI BibTeX RDF	Higher-type computability and complexity, Kleene-Kreisel functionals, topology, Haskell, PCF
16	Decheng Ding, Klaus Weihrauch, Yongcheng Wu	Absolutely Non-effective Predicates and Functions in Computable Analysis.	TAMC	2007	DBLP DOI BibTeX RDF	measure, computability, representation, set, undecidability
16	Mark Burgin	Universality, Reducibility, and Completeness.	MCU	2007	DBLP DOI BibTeX RDF	problem completeness, algorithm, computability, reducibility, universal, computing power, problem hardness
16	Julien Cervelle, Pierre Guillon 0001	Towards a Rice Theorem on Traces of Cellular Automata.	MFCS	2007	DBLP DOI BibTeX RDF	cellular automata, computability, decidability, formal languages, symbolic dynamics, Discrete-time dynamical systems
16	Gheorghe Paun	Spiking Neural P Systems Used as Acceptors and Transducers.	CIAA	2007	DBLP DOI BibTeX RDF	string processing, membrane computing, Turing computability, spiking neural P system
16	Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion	On Abstract Computer Virology from a Recursion Theoretic Perspective.	J. Comput. Virol.	2006	DBLP DOI BibTeX RDF	Polymorphic virus, Companion virus, Computability, Detection, Computer virus, Self-reference, Recursion theorem
16	Linda Lawton	Almost complemented Pi01 classes.	Arch. Math. Log.	2006	DBLP DOI BibTeX RDF	?01 classes, computability, recursion
16	Ioan I. Ardelean, Matteo Cavaliere, Dragos Sburlan	Computing using signals: from cells to P systems.	Soft Comput.	2005	DBLP DOI BibTeX RDF	Cell Biology, L System, Membrane Computing, Turing Computability
16	Francesco Bernardini, Marian Gheorghe 0001	Cell communication in tissue P systems: universality results.	Soft Comput.	2005	DBLP DOI BibTeX RDF	Tissue, Membrane computing, Turing computability
16	Linqiang Pan, Artiom Alhazov, Tseren-Onolt Ishdorj	Further remarks on P systems with active membranes, separation, merging, and release rules.	Soft Comput.	2005	DBLP DOI BibTeX RDF	Membrane computing, Turing computability, SAT problem