Search results for "Computability"

Hits ?▲	Authors	Title	Venue	Year	Link
29	Nikolay Bazhenov 0001, Vittorio Cipriani, Luca San Mauro	Calculating the Mind Change Complexity of Learning Algebraic Structures.	CiE	2022	DBLP DOI BibTeX RDF
29	Lauri Hella, Miikka Vilander	Defining Long Words Succinctly in FO and MSO.	CiE	2022	DBLP DOI BibTeX RDF
29	Keng Meng Ng, Frank Stephan 0001, Yue Yang 0004, Liang Yu	On Trees Without Hyperimmune Branches.	CiE	2022	DBLP DOI BibTeX RDF
29	Juvenal Murwanashyaka	Hilbert's Tenth Problem for Term Algebras with a Substitution Operator.	CiE	2022	DBLP DOI BibTeX RDF
29	Sam Sanders	Reverse Mathematics of the Uncountability of ℝ.	CiE	2022	DBLP DOI BibTeX RDF
29	Samuele Maschio, Pietro Sabelli	On the Compatibility Between the Minimalist Foundation and Constructive Set Theory.	CiE	2022	DBLP DOI BibTeX RDF
29	Nikolay Bazhenov 0001, Maxim V. Zubkov	Well-Orders Realized by C.E. Equivalence Relations.	CiE	2022	DBLP DOI BibTeX RDF
29	Olivier Bournez	Programming with Ordinary Differential Equations: Some First Steps Towards a Programming Language.	CiE	2022	DBLP DOI BibTeX RDF
29	Kitty Meeks	Reducing Reachability in Temporal Graphs: Towards a More Realistic Model of Real-World Spreading Processes.	CiE	2022	DBLP DOI BibTeX RDF
29	Cécilia Pradic, Giovanni Solda	On the Weihrauch Degree of the Additive Ramsey Theorem over the Rationals.	CiE	2022	DBLP DOI BibTeX RDF
29	Liesbeth De Mol, Andreas Weiermann, Florin Manea, David Fernández-Duque (eds.)	Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings	CiE	2021	DBLP DOI BibTeX RDF
29	Ardalan Khazraei, Timo Kötzing, Karen Seidel 0001	Towards a Map for Incremental Learning in the Limit from Positive and Negative Information.	CiE	2021	DBLP DOI BibTeX RDF
29	Angeliki Koutsoukou-Argyraki	On Preserving the Computational Content of Mathematical Proofs: Toy Examples for a Formalising Strategy.	CiE	2021	DBLP DOI BibTeX RDF
29	Timo Kötzing, Karen Seidel 0001	Learning Languages in the Limit from Positive Information with Finitely Many Memory Changes.	CiE	2021	DBLP DOI BibTeX RDF
29	Esther Ezra	On 3SUM-hard Problems in the Decision Tree Model.	CiE	2021	DBLP DOI BibTeX RDF
29	Sebastian Berndt 0001, Kilian Grage, Klaus Jansen, Lukas Johannsen, Maria Kosche	Robust Online Algorithms for Dynamic Choosing Problems.	CiE	2021	DBLP DOI BibTeX RDF
29	Karl Bringmann	Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry.	CiE	2021	DBLP DOI BibTeX RDF
29	Marat Kh. Faizrahmanov	Limitwise Monotonic Spectra and Their Generalizations.	CiE	2021	DBLP DOI BibTeX RDF
29	Liron Cohen 0001	Formally Computing with the Non-computable.	CiE	2021	DBLP DOI BibTeX RDF
29	Sam Sanders	Splittings and Robustness for the Heine-Borel Theorem.	CiE	2021	DBLP DOI BibTeX RDF
29	Máté Szabó	Péter on Church's Thesis, Constructivity and Computers.	CiE	2021	DBLP DOI BibTeX RDF
29	Pavel Alaev, Victor L. Selivanov	Searching for Applicable Versions of Computable Structures.	CiE	2021	DBLP DOI BibTeX RDF
29	Merlin Carl	The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines.	CiE	2021	DBLP DOI BibTeX RDF
29	Francesco A. Genco, Francesca Poggiolesi	Defining Formal Explanation in Classical Logic by Substructural Derivability.	CiE	2021	DBLP DOI BibTeX RDF
29	Leszek Aleksander Kolodziejczyk, Keita Yokoyama	In Search of the First-Order Part of Ramsey's Theorem for Pairs.	CiE	2021	DBLP DOI BibTeX RDF
29	Samuel D. Birns, Bjørn Kjos-Hanssen	On the Degrees of Constructively Immune Sets.	CiE	2021	DBLP DOI BibTeX RDF
29	Markus Lohrey	Compression Techniques in Group Theory.	CiE	2021	DBLP DOI BibTeX RDF
29	Andrea Sorbi	Effective Inseparability and Its Applications.	CiE	2021	DBLP DOI BibTeX RDF
29	Vanja Doskoc, Timo Kötzing	Normal Forms for Semantically Witness-Based Learners in Inductive Inference.	CiE	2021	DBLP DOI BibTeX RDF
29	Franziskus Wiesnet	An Algorithmic Version of Zariski's Lemma.	CiE	2021	DBLP DOI BibTeX RDF
29	Richard Krogman, Douglas Cenzer	Complexity and Categoricity of Injection Structures Induced by Finite State Transducers.	CiE	2021	DBLP DOI BibTeX RDF
29	Jordan M. Eizenga, Ryan Lorig-Roach, Melissa M. Meredith, Benedict Paten	Walk-Preserving Transformation of Overlapped Sequence Graphs into Blunt Sequence Graphs with GetBlunted.	CiE	2021	DBLP DOI BibTeX RDF
29	Rayan Chikhi	A Tale of Optimizing the Space Taken by de Bruijn Graphs.	CiE	2021	DBLP DOI BibTeX RDF
29	Vanja Doskoc, Timo Kötzing	Mapping Monotonic Restrictions in Inductive Inference.	CiE	2021	DBLP DOI BibTeX RDF
29	Bjørn Kjos-Hanssen, David J. Webb	KL-Randomness and Effective Dimension Under Strong Reducibility.	CiE	2021	DBLP DOI BibTeX RDF
29	Lorenzo Carlucci	Restrictions of Hindman's Theorem: An Overview.	CiE	2021	DBLP DOI BibTeX RDF
29	Victor L. Selivanov	Non-collapse of the Effective Wadge Hierarchy.	CiE	2021	DBLP DOI BibTeX RDF
29	Johanna N. Y. Franklin	A Church-Turing Thesis for Randomness?	CiE	2021	DBLP DOI BibTeX RDF
29	Julian Berger, Maximilian Böther, Vanja Doskoc, Jonathan Gadea Harder, Nicolas Klodt, Timo Kötzing, Winfried Lötzsch, Jannik Peters 0001, Leon Schiller, Lars Seifert, Armin Wells, Simon Wietheger	Learning Languages with Decidable Hypotheses.	CiE	2021	DBLP DOI BibTeX RDF
29	Lars Kristiansen	On Subrecursive Representation of Irrational Numbers: Contractors and Baire Sequences.	CiE	2021	DBLP DOI BibTeX RDF
29	Barbara F. Csima, Dino Rossegger, Daniel Yu	Positive Enumerable Functors.	CiE	2021	DBLP DOI BibTeX RDF
29	Joan Rand Moschovakis, Garyfallia Vafeiadou	Minimum Classical Extensions of Constructive Theories.	CiE	2021	DBLP DOI BibTeX RDF
29	Eric Goles 0001, Pedro Montealegre 0001, Martín Ríos Wilson, Guillaume Theyssier	On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics.	CiE	2021	DBLP DOI BibTeX RDF
29	Tomasz Steifer	Simple Betting and Stochasticity.	CiE	2021	DBLP DOI BibTeX RDF
29	Melissa Antonelli, Ugo Dal Lago, Paolo Pistone	On Measure Quantifiers in First-Order Arithmetic.	CiE	2021	DBLP DOI BibTeX RDF
29	Russell Miller 0001	Computable Procedures for Fields.	CiE	2021	DBLP DOI BibTeX RDF
29	Léo Robert, Daiki Miyahara, Pascal Lafourcade 0001, Takaaki Mizuki	Interactive Physical ZKP for Connectivity: Applications to Nurikabe and Hitori.	CiE	2021	DBLP DOI BibTeX RDF
29	Jean-Yves Moyen, Jakob Grue Simonsen	Subrecursive Equivalence Relations and (non-)Closure Under Lattice Operations.	CiE	2021	DBLP DOI BibTeX RDF
29	D. A. Turner	Constructive Mathematics, Church's Thesis, and Free Choice Sequences.	CiE	2021	DBLP DOI BibTeX RDF
29	Askar Gafurov, Tomás Vinar, Brona Brejová	Probabilistic Models of k-mer Frequencies (Extended Abstract).	CiE	2021	DBLP DOI BibTeX RDF
29	Merlin Carl, Lorenzo Galeotti, Robert Paßmann	Randomising Realizability.	CiE	2021	DBLP DOI BibTeX RDF
29	Till Fluschnik, Leon Kellerhals	Placing Green Bridges Optimally, with a Multivariate Analysis.	CiE	2021	DBLP DOI BibTeX RDF
29	Ivan Georgiev	Dedekind Cuts and Long Strings of Zeros in Base Expansions.	CiE	2021	DBLP DOI BibTeX RDF
29	Fernando Ferreira 0001	On False Heine/Borel Compactness Principles in Proof Mining.	CiE	2021	DBLP DOI BibTeX RDF
29	Marcella Anselmo, Gianluca Della Vedova, Florin Manea, Arno Pauly (eds.)	Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29 - July 3, 2020, Proceedings	CiE	2020	DBLP DOI BibTeX RDF
29	Andrea Frosini, Giulia Palma, Simone Rinaldi	Combinatorial Properties of Degree Sequences of 3-Uniform Hypergraphs Arising from Saind Arrays.	CiE	2020	DBLP DOI BibTeX RDF
29	Wim Martens	Formal Languages in Information Extraction and Graph Databases.	CiE	2020	DBLP DOI BibTeX RDF
29	Lars Kristiansen, Jakob Grue Simonsen	On the Complexity of Conversion Between Classic Real Number Representations.	CiE	2020	DBLP DOI BibTeX RDF
29	Donghyun Lim, Martin Ziegler 0001	Quantitative Coding and Complexity Theory of Compact Metric Spaces.	CiE	2020	DBLP DOI BibTeX RDF
29	Antonio Boccuto, Arturo Carpi	Repetitions in Toeplitz Words and the Thue Threshold.	CiE	2020	DBLP DOI BibTeX RDF
29	Matthew de Brecht	Some Notes on Spaces of Ideals and Computable Topology.	CiE	2020	DBLP DOI BibTeX RDF
29	David Fernández-Duque, Andreas Weiermann	Ackermannian Goodstein Sequences of Intermediate Growth.	CiE	2020	DBLP DOI BibTeX RDF
29	Rodney G. Downey, Alexander G. Melnikov	Computable Analysis and Classification Problems.	CiE	2020	DBLP DOI BibTeX RDF
29	Lars Kristiansen, Juvenal Murwanashyaka	On Interpretability Between Some Weak Essentially Undecidable Theories.	CiE	2020	DBLP DOI BibTeX RDF
29	Kévin Perrot, Sylvain Sené, Lucas Venturini	#P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method.	CiE	2020	DBLP DOI BibTeX RDF
29	Zuzana Haniková	On the Complexity of Validity Degrees in Łukasiewicz Logic.	CiE	2020	DBLP DOI BibTeX RDF
29	Shay Moran, Ido Nachum, Itai Panasoff, Amir Yehudayoff	On the Perceptron's Compression.	CiE	2020	DBLP DOI BibTeX RDF
29	Russell Miller 0001	Non-coding Enumeration Operators.	CiE	2020	DBLP DOI BibTeX RDF
29	Przemyslaw Uznanski	Recent Advances in Text-to-Pattern Distance Algorithms.	CiE	2020	DBLP DOI BibTeX RDF
29	Merlin Carl	Clockability for Ordinal Turing Machines.	CiE	2020	DBLP DOI BibTeX RDF
29	Ulrich Berger 0001, Olga Petrovska, Hideki Tsuiki	Prawf: An Interactive Proof System for Program Extraction.	CiE	2020	DBLP DOI BibTeX RDF
29	Manuel Bodirsky, Simon Knäuer, Florian Starke	ASNP: A Tame Fragment of Existential Second-Order Logic.	CiE	2020	DBLP DOI BibTeX RDF
29	Martin Vu, Henning Fernau	Insertion-Deletion Systems with Substitutions I.	CiE	2020	DBLP DOI BibTeX RDF
29	Peter Schuster 0001, Daniel Misselbeck-Wessel	The Computational Significance of Hausdorff's Maximal Chain Principle.	CiE	2020	DBLP DOI BibTeX RDF
29	Florian Bridoux, Maximilien Gadouleau, Guillaume Theyssier	On Simulation in Automata Networks.	CiE	2020	DBLP DOI BibTeX RDF
29	Nicola Prezza, Giovanna Rosone	Faster Online Computation of the Succinct Longest Previous Factor Array.	CiE	2020	DBLP DOI BibTeX RDF
29	Markus Lohrey	Balancing Straight-Line Programs for Strings and Trees.	CiE	2020	DBLP DOI BibTeX RDF
29	Sune Kristian Jakobsen, Jakob Grue Simonsen	Liouville Numbers and the Computational Complexity of Changing Bases.	CiE	2020	DBLP DOI BibTeX RDF
29	Nikolay Bazhenov 0001, Stefan V. Vatev	A Note on Computable Embeddings for Ordinals and Their Reverses.	CiE	2020	DBLP DOI BibTeX RDF
29	Stavros Konstantinidis	Theoretical and Implementational Aspects of the Formal Language Server (LaSer).	CiE	2020	DBLP DOI BibTeX RDF
29	Stéphane Le Roux 0001	Time-Aware Uniformization of Winning Strategies.	CiE	2020	DBLP DOI BibTeX RDF
29	Makoto Fujiwara	Parallelizations in Weihrauch Reducibility and Constructive Reverse Mathematics.	CiE	2020	DBLP DOI BibTeX RDF
29	Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano	Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power.	CiE	2020	DBLP DOI BibTeX RDF
29	Thomas Zeugmann	On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings.	CiE	2020	DBLP DOI BibTeX RDF
29	Cyril Banderier, Massimiliano Goldwurm	Number of Prefixes in Trace Monoids: Clique Polynomials and Dependency Graphs.	CiE	2020	DBLP DOI BibTeX RDF
29	Iosif Petrakis	Functions of Baire Class One over a Bishop Topology.	CiE	2020	DBLP DOI BibTeX RDF
29	Maria Madonia	Two-Dimensional Codes.	CiE	2020	DBLP DOI BibTeX RDF
29	Michal Wroclawski	Representations of Natural Numbers and Computability of Various Functions.	CiE	2019	DBLP DOI BibTeX RDF
29	Daniel Silva Graça, Ning Zhong 0002	Computability of Ordinary Differential Equations.	CiE	2018	DBLP DOI BibTeX RDF
29	Douglas Cenzer, Diego A. Rojas	Online Computability and Differentiation in the Cantor Space.	CiE	2018	DBLP DOI BibTeX RDF
29	Damir D. Dzhafarov	Robert I. Soare, Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, Heidelberg, 2016, xxxvi + 263 pp.	Bull. Symb. Log.	2017	DBLP DOI BibTeX RDF
29	Andrej Bauer, Ulrich Berger 0001, Willem L. Fouché, Dieter Spreen, Hideki Tsuiki, Martin Ziegler 0001	Continuity, computability, constructivity: from logic to algorithms 2014 (Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014).	J. Log. Anal.	2017	DBLP BibTeX RDF
29	Juliette Kennedy	Gödel's Reception of Turing's Model of Computability: The "Shift of Perception" in 1934.	CiE	2017	DBLP DOI BibTeX RDF
29	Margarita V. Korovina, Oleg V. Kudinov	Outline of Partial Computability in Computable Topology.	CiE	2017	DBLP DOI BibTeX RDF
29	Emmanuel Jeandel	Computability in Symbolic Dynamics.	CiE	2016	DBLP DOI BibTeX RDF
29	Vasco Brattka	Computability and Analysis, a Historical Approach.	CiE	2016	DBLP DOI BibTeX RDF
29	Nathanael L. Ackerman, Cameron E. Freer, Robert S. Lubarsky	Feedback Turing Computability, and Turing Computability as Feedback.	LICS	2015	DBLP DOI BibTeX RDF
29	Arnold Beckmann, Victor Mitrana, Mariya Ivanova Soskova (eds.)	Evolving Computability - 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29 - July 3, 2015. Proceedings	CiE	2015	DBLP DOI BibTeX RDF
29	Guillaume Bonfante, Mohamed El-Aqqad, Benjamin Greenbaum, Mathieu Hoyrup	Immune Systems in Computer Virology.	CiE	2015	DBLP DOI BibTeX RDF
29	Jean-Éric Pin	Newton's Forward Difference Equation for Functions from Words to Words.	CiE	2015	DBLP DOI BibTeX RDF