Search results for "computability"

Hits ?▲	Authors	Title	Venue	Year	Link
14	Zenon Sadowski	Total Nondeterministic Turing Machines and a p-optimal Proof System for SAT.	CiE	2017	DBLP DOI BibTeX RDF
14	Ville Salo, Ilkka Törmä	A One-Dimensional Physically Universal Cellular Automaton.	CiE	2017	DBLP DOI BibTeX RDF
14	Merlin Carl, Philipp Schlicht	The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters.	CiE	2017	DBLP DOI BibTeX RDF
14	Daniela Genova, Hendrik Jan Hoogeboom	Finite Language Forbidding-Enforcing Systems.	CiE	2017	DBLP DOI BibTeX RDF
14	Ivan Visconti	Delayed-Input Cryptographic Protocols.	CiE	2017	DBLP DOI BibTeX RDF
14	Thierry Monteil 0002	A Universal Oracle for Signal Machines.	CiE	2017	DBLP DOI BibTeX RDF
14	Alexander G. Melnikov	Eliminating Unbounded Search in Computable Algebra.	CiE	2017	DBLP DOI BibTeX RDF
14	Petr A. Golovach, Matthew Johnson 0002, Barnaby Martin, Daniël Paulusma, Anthony Stewart	Surjective H-Colouring: New Hardness Results.	CiE	2017	DBLP DOI BibTeX RDF
14	Iosif Petrakis	McShane-Whitney Pairs.	CiE	2017	DBLP DOI BibTeX RDF
14	Martin Delacourt, Nicolas Ollinger	Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups.	CiE	2017	DBLP DOI BibTeX RDF
14	Neil Lutz, Donald M. Stull	Dimension Spectra of Lines.	CiE	2017	DBLP DOI BibTeX RDF
14	Oscar Defrain, Bruno Durand 0001, Grégory Lafitte	Infinite Time Busy Beavers.	CiE	2017	DBLP DOI BibTeX RDF
14	Gleb Novikov	Randomness Deficiencies.	CiE	2017	DBLP DOI BibTeX RDF
14	Hugo Nobrega, Arno Pauly	Game Characterizations and Lower Cones in the Weihrauch Degrees.	CiE	2017	DBLP DOI BibTeX RDF
14	Margarita V. Korovina, Oleg V. Kudinov	On Higher Effective Descriptive Set Theory.	CiE	2017	DBLP DOI BibTeX RDF
14	Stepan Holub, Robert Veroff	Formalizing a Fragment of Combinatorics on Words.	CiE	2017	DBLP DOI BibTeX RDF
14	Lorenzo Galeotti, Hugo Nobrega	Towards Computable Analysis on the Generalised Real Line.	CiE	2017	DBLP DOI BibTeX RDF
14	Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot	Flexible Indexing of Repetitive Collections.	CiE	2017	DBLP DOI BibTeX RDF
14	Narad Rampersad	Formulas with Reversal.	CiE	2017	DBLP DOI BibTeX RDF
14	Victor L. Selivanov	Extending Wadge Theory to k-Partitions.	CiE	2017	DBLP DOI BibTeX RDF
14	Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski	New Bounds on the Strength of Some Restrictions of Hindman's Theorem.	CiE	2017	DBLP DOI BibTeX RDF
14	Nikolay Bazhenov 0001, Mars M. Yamaleev	Degrees of Categoricity of Rigid Structures.	CiE	2017	DBLP DOI BibTeX RDF
14	Gunnar W. Klau, Tobias Marschall	A Guided Tour to Computational Haplotyping.	CiE	2017	DBLP DOI BibTeX RDF
14	Merlin Carl, Benedikt Löwe, Benjamin G. Rin	Koepke Machines and Satisfiability for Infinitary Propositional Languages.	CiE	2017	DBLP DOI BibTeX RDF
14	Karoliina Lehtinen, Sandra Quickert	∑μ2 is decidable for ∏μ2.	CiE	2017	DBLP DOI BibTeX RDF
14	Alexander Shen	Compressibility and Probabilistic Proofs.	CiE	2017	DBLP DOI BibTeX RDF
14	Russell G. Miller	Computable Transformations of Structures.	CiE	2017	DBLP DOI BibTeX RDF
14	Cliff B. Jones	Turing's 1949 Paper in Context.	CiE	2017	DBLP DOI BibTeX RDF
14	Alberto Hernández-Espinosa, Francisco Hernández Quiroz, Héctor Zenil	Is there any Real Substance to the Claims for a 'New Computationalism'?	CiE	2017	DBLP DOI BibTeX RDF
14	Merlin Carl, Bruno Durand 0001, Grégory Lafitte, Sabrina Ouazzani	Admissibles in Gaps.	CiE	2017	DBLP DOI BibTeX RDF
14	Sergio Pissanetzky	On the Future of Information: Reunification, Computability, Adaptation, Cybersecurity, Semantics.	IEEE Access	2016	DBLP DOI BibTeX RDF
14	Nir Shavit, Gadi Taubenfeld	The computability of relaxed data structures: queues and stacks as examples.	Distributed Comput.	2016	DBLP DOI BibTeX RDF
14	Isaac Goldbring, Bradd Hart	Computability and the Connes Embedding Problem.	Bull. Symb. Log.	2016	DBLP DOI BibTeX RDF
14	Alasdair Urquhart	S. Barry Cooper and Andrew Hodges (editors), The Once and Future Turing: Computing the World. Cambridge University Press, 2016. xviii + 379 pp. - therein: - Martin Davis. Algorithms, Equations, and Logic. pp. 4-19. - J.M.E. Hyland. The Forgotten Turing. pp. 20-33. - Andrew R. Booker. Turing and the Primes. pp. 34-52. - Ueli Maurer. Cryptography and Computation after Turing. pp. 53-77. - Kanti V. Mardia and S. Barry Cooper. Alan Turing and Enigmatic Statistics. pp. 78-89. - Stephen Wolfram. What Alan Turing Might Have Discovered. pp. 92-105. - Christof Teuscher. Designed versus Intrinsic Computation. pp. 106-116. - Solomon Feferman. Turing's 'Oracle': From Absolute to Relative Computability and Back. pp. 300-334. - P.D. Welch. Turing Transcendent: Beyond the Event Horizon. pp. 335-360. - Roger Penrose. On Attempting to Model the Mathematical Mind. pp. 361-378.	Bull. Symb. Log.	2016	DBLP DOI BibTeX RDF
14	Zvonko Iljazovic, Lucija Validzic	Maximal Computability Structures.	Bull. Symb. Log.	2016	DBLP DOI BibTeX RDF
14	Denis R. Hirschfeldt, Carl G. Jockusch Jr.	On notions of computability-theoretic reduction between Π21 principles.	J. Math. Log.	2016	DBLP DOI BibTeX RDF
14	Scott Aaronson, Mohammad Bavarian, Giulio G. Giusteri	Computability Theory of Closed Timelike Curves.	Electron. Colloquium Comput. Complex.	2016	DBLP BibTeX RDF
14	Noam Greenberg	Editorial: Special Issue on Computability, Complexity and Randomness.	Theory Comput. Syst.	2016	DBLP DOI BibTeX RDF
14	Manuel Alfonseca 0001, Manuel Cebrián, Antonio Fernández Anta, Lorenzo Coviello, Andrés Abeliuk, Iyad Rahwan	Superintelligence cannot be contained: Lessons from Computability Theory.	CoRR	2016	DBLP BibTeX RDF
14	Marjorie Bournat, Swan Dubois, Franck Petit	Computability of Perpetual Exploration in Highly Dynamic Rings.	CoRR	2016	DBLP BibTeX RDF
14	Giorgi Japaridze	A survey of computability logic.	CoRR	2016	DBLP BibTeX RDF
14	Richard Moot, Christian Retoré	Natural Language Semantics and Computability.	CoRR	2016	DBLP BibTeX RDF
14	Martin Pape, Thomas Streicher	Computability in Basic Quantum Mechanics.	CoRR	2016	DBLP BibTeX RDF
14	Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen	Layerwise computability and image randomness.	CoRR	2016	DBLP BibTeX RDF
14	Vasco Brattka	Computability and Analysis, a Historical Approach.	CoRR	2016	DBLP BibTeX RDF
14	Felipe S. Abrahão	The "paradox" of computability and a recursive relative version of the Busy Beaver function.	CoRR	2016	DBLP BibTeX RDF
14	William I. Gasarch	Review of: Turing Computability: Theory and Applications by Robert Soare.	SIGACT News	2016	DBLP DOI BibTeX RDF
14	William I. Gasarch	Review of Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles by Denis Hirschfeldt.	SIGACT News	2016	DBLP DOI BibTeX RDF
14	Benedikt Löwe	Barry Cooper (1943-2015): The engine of Computability in Europe.	Comput.	2016	DBLP DOI BibTeX RDF
14	Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp	Asymptotic density and the coarse computability bound.	Comput.	2016	DBLP DOI BibTeX RDF
14	Alberto Ciaffaglione	Towards Turing computability via coinduction.	Sci. Comput. Program.	2016	DBLP DOI BibTeX RDF
14	Peter Franek, Marek Krcál	On Computability and Triviality of Well Groups.	Discret. Comput. Geom.	2016	DBLP DOI BibTeX RDF
14	Stephen P. Jordan	Black holes, quantum mechanics, and the limits of polynomial-time computability.	XRDS	2016	DBLP DOI BibTeX RDF
14	Solomon Feferman	Turing's 'Oracle': From Absolute to Relative Computability and Back.	The Once and Future Turing	2016	DBLP DOI BibTeX RDF
14	Robert I. Soare	Turing Computability - Theory and Applications		2016	DOI RDF
14	Eugenio G. Omodeo, Alberto Policriti (eds.)	Martin Davis on Computability, Computational Logic, and Mathematical Foundations.		2016	DBLP DOI BibTeX RDF
14	Vikram Saraph, Maurice Herlihy, Eli Gafni	Asynchronous Computability Theorems for t-Resilient Systems.	DISC	2016	DBLP DOI BibTeX RDF
14	Robert S. Lubarsky	Parallel Feedback Turing Computability.	LFCS	2016	DBLP DOI BibTeX RDF
14	Arnold Beckmann, Laurent Bienvenu, Natasa Jonoska (eds.)	Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings	CiE	2016	DBLP DOI BibTeX RDF
14	S. M. Amadae	Computability of Rational Action.	Robophilosophy/TRANSOR	2016	DBLP DOI BibTeX RDF
14	Tatsuya Imai, Osamu Watanabe 0001	Relating Sublinear Space Computability Among Graph Connectivity and Related Problems.	SOFSEM	2016	DBLP DOI BibTeX RDF
14	Hammurabi Mendes	Byzantine Computability and Combinatorial Topology.		2016	RDF
14	Mathieu Hoyrup	The Typical Constructible Object.	CiE	2016	DBLP DOI BibTeX RDF
14	Danilo Gligoroski, Simona Samardjiska	Semantic Security and Key-Privacy with Random Split of St-Gen Codes.	CiE	2016	DBLP DOI BibTeX RDF
14	Walter Dean	Squeezing Feasibility.	CiE	2016	DBLP DOI BibTeX RDF
14	Bas Luttik, Fei Yang	On the Executability of Interactive Computation.	CiE	2016	DBLP DOI BibTeX RDF
14	Iosif Petrakis	A Direct Constructive Proof of a Stone-Weierstrass Theorem for Metric Spaces.	CiE	2016	DBLP DOI BibTeX RDF
14	Oriol Farràs	Recent Advances in Non-perfect Secret Sharing Schemes.	CiE	2016	DBLP DOI BibTeX RDF
14	Riccardo Dondi, Florian Sikora	Parameterized Complexity and Approximation Issues for the Colorful Components Problems.	CiE	2016	DBLP DOI BibTeX RDF
14	Irène Marcovici	Ergodicity of Noisy Cellular Automata: The Coupling Method and Beyond.	CiE	2016	DBLP DOI BibTeX RDF
14	Barnaby Martin, András Pongrácz, Michal Wrona	The Complexity of Counting Quantifiers on Equality Languages.	CiE	2016	DBLP DOI BibTeX RDF
14	Akitoshi Kawamura, Florian Steinberg 0001, Martin Ziegler 0001	Towards Computational Complexity Theory on Advanced Function Spaces in Analysis.	CiE	2016	DBLP DOI BibTeX RDF
14	Merlin Carl	Generalized Effective Reducibility.	CiE	2016	DBLP DOI BibTeX RDF
14	Priscila Biller, Carole Knibbe, Guillaume Beslon, Eric Tannier	Comparative Genomics on Artificial Life.	CiE	2016	DBLP DOI BibTeX RDF
14	Aleksander Galicki, André Nies	A Computational Approach to the Borwein-Ditor Theorem.	CiE	2016	DBLP DOI BibTeX RDF
14	Reed Solomon	Computable Reductions and Reverse Mathematics.	CiE	2016	DBLP DOI BibTeX RDF
14	Ludovic Patey	Partial Orders and Immunity in Reverse Mathematics.	CiE	2016	DBLP DOI BibTeX RDF
14	Daniela Besozzi	Reaction-Based Models of Biochemical Networks.	CiE	2016	DBLP DOI BibTeX RDF
14	Natasha Alechina, Brian Logan 0001	Verifying Systems of Resource-Bounded Agents.	CiE	2016	DBLP DOI BibTeX RDF
14	Vasco Brattka, Stéphane Le Roux 0001, Joseph S. Miller, Arno Pauly	The Brouwer Fixed Point Theorem Revisited.	CiE	2016	DBLP DOI BibTeX RDF
14	Sebastián Barbieri, Mathieu Sablik	The Domino Problem for Self-similar Structures.	CiE	2016	DBLP DOI BibTeX RDF
14	Sanjay Jain 0001, Bakhadyr Khoussainov, Frank Stephan 0001	Finitely Generated Semiautomatic Groups.	CiE	2016	DBLP DOI BibTeX RDF
14	Mikhail Andreev	Busy Beavers and Kolmogorov Complexity.	CiE	2016	DBLP DOI BibTeX RDF
14	Oleg V. Kudinov, Victor L. Selivanov	On the Lattices of Effectively Open Sets.	CiE	2016	DBLP DOI BibTeX RDF
14	Ignacio Cascudo	Secret Sharing Schemes with Algebraic Properties and Applications.	CiE	2016	DBLP DOI BibTeX RDF
14	Valérie Berthé, Thomas Fernique, Mathieu Sablik	Effective S-adic Symbolic Dynamical Systems.	CiE	2016	DBLP DOI BibTeX RDF
14	Rumen D. Dimitrov, Valentina S. Harizanov, Andrei S. Morozov	Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra.	CiE	2016	DBLP DOI BibTeX RDF
14	Pierre-Éric Mounier-Kuhn, Maël Pégny	AFCAL and the Emergence of Computer Science in France: 1957-1967.	CiE	2016	DBLP DOI BibTeX RDF
14	Anton Konovalov, Victor L. Selivanov	The Boolean Algebra of Piecewise Testable Languages.	CiE	2016	DBLP DOI BibTeX RDF
14	Gemma Carotenuto, André Nies	Lightface Π30-Completeness of Density Sets Under Effective Wadge Reducibility.	CiE	2016	DBLP DOI BibTeX RDF
14	John Case, James S. Royer	Program Size Complexity of Correction Grammars in the Ershov Hierarchy.	CiE	2016	DBLP DOI BibTeX RDF
14	Delaram Kahrobaei, Vladimir Shpilrain	Using Semidirect Product of (Semi)groups in Public Key Cryptography.	CiE	2016	DBLP DOI BibTeX RDF
14	Lorenzo Galeotti	A Candidate for the Generalised Real Line.	CiE	2016	DBLP DOI BibTeX RDF
14	Olivier Bournez, Nachum Dershowitz, Pierre Néron	Axiomatizing Analog Algorithms.	CiE	2016	DBLP DOI BibTeX RDF
14	Simone Martini 0001	Types in Programming Languages, Between Modelling, Abstraction, and Correctness - Extended Abstract.	CiE	2016	DBLP DOI BibTeX RDF
14	Russell Miller 0001	Baire Category Theory and Hilbert's Tenth Problem Inside \mathbb Q Q.	CiE	2016	DBLP DOI BibTeX RDF
14	Christian Glaßer, Peter Jonsson, Barnaby Martin	Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic.	CiE	2016	DBLP DOI BibTeX RDF
14	Hugo Daniel Macedo, Edward Hermann Haeusler, Alex de V. Garcia	Defining Effectiveness Using Finite Sets A Study on Computability.	WEIT	2015	DBLP DOI BibTeX RDF
14	Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel D. Turetsky	Computability and uncountable Linear Orders II: degree spectra.	J. Symb. Log.	2015	DBLP DOI BibTeX RDF
14	Noam Greenberg, Asher M. Kach, Steffen Lempp, Daniel Turetsky	Computability and uncountable Linear Orders I: Computable Categoricity.	J. Symb. Log.	2015	DBLP DOI BibTeX RDF