default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID13. CiE 2017: Turku, Finland
- Jarkko Kari, Florin Manea, Ion Petre:
Unveiling Dynamics and Complexity - 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings. Lecture Notes in Computer Science 10307, Springer 2017, ISBN 978-3-319-58740-0
Invited Papers
- Gianluca Della Vedova
, Murray Patterson, Raffaella Rizzi, Mauricio Soto Gomez:
Character-Based Phylogeny Construction and Its Application to Tumor Evolution. 3-13 - Alberto Hernández-Espinosa, Francisco Hernández Quiroz, Héctor Zenil:
Is there any Real Substance to the Claims for a 'New Computationalism'? 14-23 - Stepan Holub, Robert Veroff:
Formalizing a Fragment of Combinatorics on Words. 24-31 - Cliff B. Jones:
Turing's 1949 Paper in Context. 32-41 - Juliette Kennedy:
Gödel's Reception of Turing's Model of Computability: The "Shift of Perception" in 1934. 42-49 - Gunnar W. Klau, Tobias Marschall:
A Guided Tour to Computational Haplotyping. 50-63 - Margarita V. Korovina, Oleg V. Kudinov:
Outline of Partial Computability in Computable Topology. 64-76 - Alexander G. Melnikov:
Eliminating Unbounded Search in Computable Algebra. 77-87 - Russell G. Miller:
Computable Transformations of Structures. 88-97 - Narad Rampersad:
Formulas with Reversal. 98-100 - Alexander Shen:
Compressibility and Probabilistic Proofs. 101-111 - Ivan Visconti:
Delayed-Input Cryptographic Protocols. 112-115
Contributed Papers
- Stefan Arnold, Jacobo Torán:
A Deterministic Algorithm for Testing the Equivalence of Read-Once Branching Programs with Small Discrepancy. 119-128 - Robert D. Barish, Akira Suyama:
Counting Substrate Cycles in Topologically Restricted Metabolic Networks. 129-140 - Nikolay Bazhenov:
Turing Computable Embeddings, Computable Infinitary Equivalence, and Linear Orders. 141-151 - Nikolay Bazhenov, Mars M. Yamaleev:
Degrees of Categoricity of Rigid Structures. 152-161 - Djamal Belazzougui, Fabio Cunial, Travis Gagie, Nicola Prezza, Mathieu Raffinot:
Flexible Indexing of Repetitive Collections. 162-174 - Merlin Carl, Bruno Durand, Grégory Lafitte, Sabrina Ouazzani:
Admissibles in Gaps. 175-186 - Merlin Carl, Benedikt Löwe, Benjamin G. Rin:
Koepke Machines and Satisfiability for Infinitary Propositional Languages. 187-197 - Merlin Carl, Philipp Schlicht:
The Recognizability Strength of Infinite Time Turing Machines with Ordinal Parameters. 198-209 - Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski:
New Bounds on the Strength of Some Restrictions of Hindman's Theorem. 210-220 - Oscar Defrain, Bruno Durand, Grégory Lafitte:
Infinite Time Busy Beavers. 221-233 - Martin Delacourt, Nicolas Ollinger:
Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups. 234-245 - Lorenzo Galeotti, Hugo Nobrega:
Towards Computable Analysis on the Generalised Real Line. 246-257 - Daniela Genova, Hendrik Jan Hoogeboom:
Finite Language Forbidding-Enforcing Systems. 258-269 - Petr A. Golovach, Matthew Johnson, Barnaby Martin, Daniël Paulusma, Anthony Stewart:
Surjective H-Colouring: New Hardness Results. 270-281 - Margarita V. Korovina, Oleg V. Kudinov:
On Higher Effective Descriptive Set Theory. 282-291 - Karoliina Lehtinen, Sandra Quickert:
∑μ2 is decidable for ∏μ2. 292-303 - Neil Lutz, Donald M. Stull:
Dimension Spectra of Lines. 304-314 - Thierry Monteil:
A Universal Oracle for Signal Machines. 315-326 - Hugo Nobrega, Arno Pauly:
Game Characterizations and Lower Cones in the Weihrauch Degrees. 327-337 - Gleb Novikov:
Randomness Deficiencies. 338-350 - Iosif Petrakis:
McShane-Whitney Pairs. 351-363 - Zenon Sadowski:
Total Nondeterministic Turing Machines and a p-optimal Proof System for SAT. 364-374 - Ville Salo, Ilkka Törmä:
A One-Dimensional Physically Universal Cellular Automaton. 375-386 - Victor L. Selivanov:
Extending Wadge Theory to k-Partitions. 387-399
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-18 02:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
