Search results for "computability"

Hits ?▲	Authors	Title	Venue	Year	Link
14	Arno Pauly, Willem L. Fouché, George Davie	Weihrauch-completeness for layerwise computability.	Log. Methods Comput. Sci.	2018	DBLP DOI BibTeX RDF
14	Carsten Rösnick-Neugebauer	Closed Sets and Operators thereon: Representations, Computability and Complexity.	Log. Methods Comput. Sci.	2018	DBLP DOI BibTeX RDF
14	Eike Neumann, Martin Pape, Thomas Streicher	Computability in Basic Quantum Mechanics.	Log. Methods Comput. Sci.	2018	DBLP DOI BibTeX RDF
14	Hajo Broersma, Susan Stepney, Göran Wendin	Computability and Complexity of Unconventional Computing Devices.	Computational Matter	2018	DBLP DOI BibTeX RDF
14	Dusko Pavlovic, Muzamil Yahia	Monoidal Computer III: A Coalgebraic View of Computability and Complexity (Extended Abstract).	CMCS	2018	DBLP DOI BibTeX RDF
14	Patrick Cousot, Roberto Giacobazzi, Francesco Ranzato	Program Analysis Is Harder Than Verification: A Computability Perspective.	CAV (2)	2018	DBLP DOI BibTeX RDF
14	Mark Bickford, Liron Cohen 0001, Robert L. Constable, Vincent Rahli	Computability Beyond Church-Turing via Choice Sequences.	LICS	2018	DBLP DOI BibTeX RDF
14	Mikolaj Bojanczyk, Szymon Torunczyk	On computability and tractability for infinite sets.	LICS	2018	DBLP DOI BibTeX RDF
14	Holger Boche, Volker Pohl	On the Computability of System Approximations Under Causality Constraints.	ICASSP	2018	DBLP DOI BibTeX RDF
14	Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal	Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits.	ICDCN	2018	DBLP DOI BibTeX RDF
14	Akitoshi Kawamura, Holger Thies, Martin Ziegler 0001	Average-Case Polynomial-Time Computability of Hamiltonian Dynamics.	MFCS	2018	DBLP DOI BibTeX RDF
14	Petr Kuznetsov, Thibault Rieutord, Yuan He 0003	An Asynchronous Computability Theorem for Fair Adversaries.	PODC	2018	DBLP BibTeX RDF
14	Bin Yu 0001	Three principles of data science: predictability, computability, and stability (PCS).	IEEE BigData	2018	DBLP DOI BibTeX RDF
14	Petr Kuznetsov, Nayuta Yanagisawa	Task Computability in Unreliable Anonymous Networks.	OPODIS	2018	DBLP DOI BibTeX RDF
14	Sam Sanders	Metastability and Higher-Order Computability.	LFCS	2018	DBLP DOI BibTeX RDF
14	Olivier Bournez	Ordinary Differential Equations & Computability.	SYNASC	2018	DBLP DOI BibTeX RDF
14	Olivier Bournez, Sabrina Ouazzani	Cheap Non-Standard Analysis and Computability: Some Applications.	SYNASC	2018	DBLP DOI BibTeX RDF
14	Florin Manea, Russell G. Miller, Dirk Nowotka (eds.)	Sailing Routes in the World of Computation - 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 - August 3, 2018, Proceedings	CiE	2018	DBLP DOI BibTeX RDF
14	Arnon Avron, Shahar Lev, Nissan Levi	Safety, Absoluteness, and Computability.	CSL	2018	DBLP DOI BibTeX RDF
14	Thibault Rieutord	Combinatorial characterization of asynchronous distributed computability. (Caractérisation combinatoire de la calculabilité distribuée asynchrone).		2018	RDF
14	Florent Becker, Diego Maldonado, Nicolas Ollinger, Guillaume Theyssier	Universality in Freezing Cellular Automata.	CiE	2018	DBLP DOI BibTeX RDF
14	Christoph Benzmüller, Xavier Parent, Leendert W. N. van der Torre	A Deontic Logic Reasoning Infrastructure.	CiE	2018	DBLP DOI BibTeX RDF
14	Bakh Khoussainov	A Journey to Computably Enumerable Structures (Tutorial Lectures).	CiE	2018	DBLP DOI BibTeX RDF
14	Martin Monath	A C.E. Weak Truth Table Degree Which Is Array Noncomputable and R-maximal.	CiE	2018	DBLP DOI BibTeX RDF
14	Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen, André Nies	From Eventually Different Functions to Pandemic Numberings.	CiE	2018	DBLP DOI BibTeX RDF
14	Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele	New Nonterminal Complexity Results for Semi-conditional Grammars.	CiE	2018	DBLP DOI BibTeX RDF
14	Martin Davis	Turing's Vision and Deep Learning.	CiE	2018	DBLP DOI BibTeX RDF
14	Dag Normann	Functionals of Type 3 as Realisers of Classical Theorems in Analysis.	CiE	2018	DBLP DOI BibTeX RDF
14	Sebastian Berndt 0001, Kim-Manuel Klein	Using Structural Properties for Integer Programs.	CiE	2018	DBLP DOI BibTeX RDF
14	Ulrich Berger 0001, Olga Petrovska	Optimized Program Extraction for Induction and Coinduction.	CiE	2018	DBLP DOI BibTeX RDF
14	Dino Rossegger	Elementary Bi-embeddability Spectra of Structures.	CiE	2018	DBLP DOI BibTeX RDF
14	Paula Quinon	A Taxonomy of Deviant Encodings.	CiE	2018	DBLP DOI BibTeX RDF
14	Paola Bonizzoni, Gianluca Della Vedova, Serena Nicosia, Yuri Pirola, Marco Previtali, Raffaella Rizzi	Divide and Conquer Computation of the Multi-string BWT and LCP Array.	CiE	2018	DBLP DOI BibTeX RDF
14	Arno Pauly	Enumeration Degrees and Topology.	CiE	2018	DBLP DOI BibTeX RDF
14	Henning Fernau, Till Fluschnik, Danny Hermelin, Andreas Krebs, Hendrik Molter, Rolf Niedermeier	Diminishable Parameterized Problems and Strict Polynomial Kernelization.	CiE	2018	DBLP DOI BibTeX RDF
14	Nikolay Bazhenov 0001, Margarita Marchuk	Degrees of Categoricity for Prime and Homogeneous Models.	CiE	2018	DBLP DOI BibTeX RDF
14	Mathieu Hoyrup	Topological Analysis of Representations.	CiE	2018	DBLP DOI BibTeX RDF
14	André Souto, Luís Antunes 0002, Paulo Mateus, Andreia Teixeira	Witness Hiding Without Extractors or Simulators.	CiE	2018	DBLP DOI BibTeX RDF
14	Wilfried Sieg	What Is the Concept of Computation?	CiE	2018	DBLP DOI BibTeX RDF
14	Merlin Carl, Sabrina Ouazzani, Philip D. Welch	Taming Koepke's Zoo.	CiE	2018	DBLP DOI BibTeX RDF
14	Alexey Milovanov	Algorithmic Statistics and Prediction for Polynomial Time-Bounded Algorithms.	CiE	2018	DBLP DOI BibTeX RDF
14	Merlin Carl	Some Observations on Infinitary Complexity.	CiE	2018	DBLP DOI BibTeX RDF
14	João Marques-Silva 0001	Computing with SAT Oracles: Past, Present and Future.	CiE	2018	DBLP DOI BibTeX RDF
14	Sam Sanders	Some Nonstandard Equivalences in Reverse Mathematics.	CiE	2018	DBLP DOI BibTeX RDF
14	Alexander N. Rybalov	A Generic m-Reducibility.	CiE	2018	DBLP DOI BibTeX RDF
14	Marie Nicholson	The Complexity of Tukey Types and Cofinal Types.	CiE	2018	DBLP DOI BibTeX RDF
14	Margarita V. Korovina, Oleg V. Kudinov	Weak Reduction Principle and Computable Metric Spaces.	CiE	2018	DBLP DOI BibTeX RDF
14	Takashi Yokomori, Fumiya Okubo	Computing with Multisets: A Survey on Reaction Automata Theory.	CiE	2018	DBLP DOI BibTeX RDF
14	Massimo Lauria	Algorithm Analysis Through Proof Complexity.	CiE	2018	DBLP DOI BibTeX RDF
14	Ishai Kones, Asaf Levin	A Unified Framework for Designing EPTAS's for Load Balancing on Parallel Machines.	CiE	2018	DBLP DOI BibTeX RDF
14	Svetlana V. Selivanova, Victor L. Selivanov	Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended Abstract).	CiE	2018	DBLP DOI BibTeX RDF
14	Vladimir Uspenskiy, Alexander Shen	Algorithms and Geometric Constructions.	CiE	2018	DBLP DOI BibTeX RDF
14	Lars Kristiansen, Juvenal Murwanashyaka	Decidable and Undecidable Fragments of First-Order Concatenation Theory.	CiE	2018	DBLP DOI BibTeX RDF
14	Ivan Georgiev, Lars Kristiansen, Frank Stephan 0001	On General Sum Approximations of Irrational Numbers.	CiE	2018	DBLP DOI BibTeX RDF
14	Timothy H. McNicholl, Don M. Stull	The Isometry Degree of a Computable Copy of p.	CiE	2018	DBLP DOI BibTeX RDF
14	Pavel Alaev, Victor L. Selivanov	Polynomial-Time Presentations of Algebraic Number Fields.	CiE	2018	DBLP DOI BibTeX RDF
14	Klaus Ambos-Spies	Multiple Permitting and Array Noncomputability.	CiE	2018	DBLP DOI BibTeX RDF
14	Till Fluschnik, George B. Mertzios, André Nichterlein	Kernelization Lower Bounds for Finding Constant-Size Subgraphs.	CiE	2018	DBLP DOI BibTeX RDF
14	Thomas Erlebach	Computing and Scheduling with Explorable Uncertainty.	CiE	2018	DBLP DOI BibTeX RDF
14	Sebastian Berndt 0001	Computing Tree Width: From Theory to Practice and Back.	CiE	2018	DBLP DOI BibTeX RDF
14	Matteo Cavaleri	Computability of Følner sets.	Int. J. Algebra Comput.	2017	DBLP DOI BibTeX RDF
14	Polina Vinogradova, Amy P. Felty, Philip J. Scott	Formalizing Abstract Computability: Turing Categories in Coq.	LSFA	2017	DBLP DOI BibTeX RDF
14	Hajime Ishihara, Margarita V. Korovina, Arno Pauly, Monika Seisenberger, Dieter Spreen	Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013.	Math. Struct. Comput. Sci.	2017	DBLP DOI BibTeX RDF
14	Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy 0001	On computability and disintegration.	Math. Struct. Comput. Sci.	2017	DBLP DOI BibTeX RDF
14	Klaus Ambos-Spies, Vasco Brattka, Rodney G. Downey, Steffen Lempp	Computability Theory (Dagstuhl Seminar 17081).	Dagstuhl Reports	2017	DBLP DOI BibTeX RDF
14	Andrew S. Marks	Uniformity, universality, and computability theory.	J. Math. Log.	2017	DBLP DOI BibTeX RDF
14	Andrew Lewis-Pye, Wolfgang Merkle	Guest Editorial: Tenth International Conference on Computability, Complexity and Randomness (CCR 2015).	Theory Comput. Syst.	2017	DBLP DOI BibTeX RDF
14	Vasco Brattka, Matthew Hendtlass, Alexander P. Kreuzer	On the Uniform Computational Content of Computability Theory.	Theory Comput. Syst.	2017	DBLP DOI BibTeX RDF
14	Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen	Layerwise Computability and Image Randomness.	Theory Comput. Syst.	2017	DBLP DOI BibTeX RDF
14	Carsten Rösnick-Neugebauer	Closed Sets and Operators thereon: Representations, Computability and Complexity.	CoRR	2017	DBLP BibTeX RDF
14	Vikram Saraph, Maurice Herlihy, Eli Gafni	An Algorithmic Approach to the Asynchronous Computability Theorem.	CoRR	2017	DBLP BibTeX RDF
14	Dusko Pavlovic, Muzamil Yahia	Monoidal computer III: A coalgebraic view of computability and complexity.	CoRR	2017	DBLP BibTeX RDF
14	Silvère Gangloff, Mathieu Sablik	Block gluing intensity of bidimensional SFT: computability of the entropy and periodic points.	CoRR	2017	DBLP BibTeX RDF
14	Jean-Yves Moyen, Jakob Grue Simonsen	Computability in the Lattice of Equivalence Relations.	DICE-FOPARA@ETAPS	2017	DBLP DOI BibTeX RDF
14	Malgorzata Moczurad, Piotr Zgliczynski	Real-number Computability from the Perspective of Computer Assisted Proofs in Analysis.	CoRR	2017	DBLP BibTeX RDF
14	Nathanael L. Ackerman, Cameron E. Freer	On the computability of graph Turing machines.	CoRR	2017	DBLP BibTeX RDF
14	Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky	Feedback computability on Cantor space.	CoRR	2017	DBLP BibTeX RDF
14	Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Nayuta Yanagisawa	A characterization of colorless anonymous t-resilient task computability.	CoRR	2017	DBLP BibTeX RDF
14	Hajo Broersma, Susan Stepney, Göran Wendin	Computability and Complexity of Unconventional Computing Devices.	CoRR	2017	DBLP BibTeX RDF
14	Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal	Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits.	CoRR	2017	DBLP BibTeX RDF
14	Jaun Casanova, Simone Santini	On the relation between representations and computability.	CoRR	2017	DBLP BibTeX RDF
14	Zvonko Iljazovic, Igor Susic	Computability of semicomputable manifolds in computable topological spaces.	CoRR	2017	DBLP BibTeX RDF
14	Dimiter Georgiev	Definability in the class of all -frames - computability and complexity.	J. Appl. Non Class. Logics	2017	DBLP DOI BibTeX RDF
14	Francis Adams, Douglas Cenzer	Computability and categoricity of weakly ultrahomogeneous structures.	Comput.	2017	DBLP DOI BibTeX RDF
14	Klaus Weihrauch	Computability on measurable functions.	Comput.	2017	DBLP DOI BibTeX RDF
14	Hristo Ganchev, Dimiter Skordev	Ivan Soskov: A Life in Computability.	The Incomputable	2017	DBLP DOI BibTeX RDF
14	Sam Sanders	From Nonstandard Analysis to Various Flavours of Computability Theory.	TAMC	2017	DBLP DOI BibTeX RDF
14	Bin Yu 0001	Three Principles of Data Science: Predictability, Stability and Computability.	KDD	2017	DBLP DOI BibTeX RDF
14	Tomoyuki Yamakami	A recursive definition of quantum polynomial time computability (extended abstract).	NCMA	2017	DBLP BibTeX RDF
14	Philippe Balbiani, Joseph Boudou	Axiomatization and Computability of a Variant of Iteration-Free PDL with Fork.	DALI@TABLEAUX	2017	DBLP DOI BibTeX RDF
14	Xiang Huang 0001, Titus H. Klinge, James I. Lathrop, Xiaoyuan Li, Jack H. Lutz	Real-Time Computability of Real Numbers by Chemical Reaction Networks.	UCNC	2017	DBLP DOI BibTeX RDF
14	Vasco Brattka, Rupert Hölzl 0001, Rutger Kuyper	Monte Carlo Computability.	STACS	2017	DBLP DOI BibTeX RDF
14	Marjorie Bournat, Swan Dubois, Franck Petit	Computability of Perpetual Exploration in Highly Dynamic Rings.	ICDCS	2017	DBLP DOI BibTeX RDF
14	Jarkko Kari, Florin Manea, Ion Petre (eds.)	Unveiling Dynamics and Complexity - 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings	CiE	2017	DBLP DOI BibTeX RDF
14	Georg Gottlob, Reinhard Pichler, Emanuel Sallinger	Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability.	AMW	2017	DBLP BibTeX RDF
14	Sebastián Andrés Barbieri Lemp	Shift spaces on groups : computability and dynamics. (Calculabilité et dynamique des sous-décalages sur des groupes).		2017	RDF
14	Robert D. Barish, Akira Suyama	Counting Substrate Cycles in Topologically Restricted Metabolic Networks.	CiE	2017	DBLP DOI BibTeX RDF
14	Gianluca Della Vedova, Murray Patterson, Raffaella Rizzi, Mauricio Soto Gomez	Character-Based Phylogeny Construction and Its Application to Tumor Evolution.	CiE	2017	DBLP DOI BibTeX RDF
14	Nikolay Bazhenov 0001	Turing Computable Embeddings, Computable Infinitary Equivalence, and Linear Orders.	CiE	2017	DBLP DOI BibTeX RDF
14	Stefan Arnold, Jacobo Torán	A Deterministic Algorithm for Testing the Equivalence of Read-Once Branching Programs with Small Discrepancy.	CiE	2017	DBLP DOI BibTeX RDF