default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th CiE 2019: Durham, UK
- Florin Manea, Barnaby Martin
, Daniël Paulusma, Giuseppe Primiero:
Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings. Lecture Notes in Computer Science 11558, Springer 2019, ISBN 978-3-030-22995-5 - Felipe Cucker:
Recent Advances in the Computation of the Homology of Semialgebraic Sets. 1-12 - Lorenzo Galeotti:
Surreal Blum-Shub-Smale Machines. 13-24 - Markus Holzer, Martin Kutrib:
Non-Recursive Trade-Offs Are "Almost Everywhere". 25-36 - Stefan Klootwijk, Bodo Manthey:
Probabilistic Analysis of Facility Location on Random Shortest Path Metrics. 37-49 - Kenshi Miyabe:
Uniform Relativization. 50-61 - Raymond Turner:
Correctness, Explanation and Intention. 62-71 - Philip D. Welch:
Higher Type Recursion for Transfinite Machine Theory. 72-83 - Nikolay Bazhenov, Hristo Ganchev, Stefan V. Vatev:
Effective Embeddings for Pairs of Structures. 84-95 - Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev:
Bounded Reducibility for Computable Numberings. 96-107 - Laurent Beaudou, Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richard:
Complexity of Conjunctive Regular Path Query Homomorphisms. 108-119 - Paul C. Bell, Igor Potapov:
Towards Uniform Online Spherical Tessellations. 120-131 - Florian Bridoux, Nicolas Durbec, Kévin Perrot, Adrien Richard:
Complexity of Maximum Fixed Point Problem in Boolean Networks. 132-143 - Lorenzo Carlucci, Leonardo Mainardi, Michael Rathjen:
A Note on the Ordinal Analysis of \mathbf RCA_0 + \mathrm WO(\mathbf σ ) RCA 0 + WO ( σ ). 144-155 - Patrick Cégielski, Julien Cervelle:
Study of Stepwise Simulation Between ASM. 156-167 - Rumen D. Dimitrov, Valentina S. Harizanov, Andrei S. Morozov, Paul Shafer, Alexandra A. Soskova, Stefan V. Vatev:
Cohesive Powers of Linear Orders. 168-180 - Bruno Durand, Grégory Lafitte:
An algorithmic approach to characterizations of admissibles. 181-192 - Niels Grüttemeier, Christian Komusiewicz, Jannik Schestag, Frank Sommer:
Destroying Bicolored P3s by Deleting Few Edges. 193-204 - Iskander Sh. Kalimullin, Russell G. Miller, Hans Schoutens:
Degree Spectra for Transcendence in Fields. 205-216 - Jean-Yves Moyen, Jakob Grue Simonsen:
More Intensional Versions of Rice's Theorem. 217-229 - Ruslan Ishkuvatov, Daniil Musatov:
On Approximate Uncomputability of the Kolmogorov Complexity Function. 230-239 - Iosif Petrakis:
Borel and Baire Sets in Bishop Spaces. 240-252 - Sam Sanders:
Nets and Reverse Mathematics - Some Initial Results. 253-264 - Máté Szabó:
Kalmár's Argument for the Independence of Computer Science. 265-276 - Shaoyi Wang, Guohua Wu, Mars M. Yamaleev:
The d.r.e wtt-Degrees are Dense. 277-285 - Jirí Wiedermann, Jan van Leeuwen:
Finite State Machines with Feedback: An Architecture Supporting Minimal Machine Consciousness. 286-297 - Michal Wroclawski:
Representations of Natural Numbers and Computability of Various Functions. 298-309 - Klaus Ambos-Spies, Xizhong Zheng:
On the Differences and Sums of Strongly Computably Enumerable Real Numbers. 310-322
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 2025-02-09 15:02 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:
