default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID8. CiE 2012: Cambridge, UK
- S. Barry Cooper, Anuj Dawar
, Benedikt Löwe:
How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings. Lecture Notes in Computer Science 7318, Springer 2012, ISBN 978-3-642-30869-7 - Bahareh Afshari, Michael Rathjen:
Ordinal Analysis and the Infinite Ramsey Theorem. 1-10 - Eric Allender:
Curiouser and Curiouser: The Link between Incompressibility and Complexity. 11-16 - Patrick Allo:
Information and Logical Discrimination. 17-28 - Luis Filipe Coelho Antunes, Andre Souto, Andreia Teixeira:
Robustness of Logical Depth. 29-34 - Verónica Becher:
Turing's Normal Numbers: Towards Randomness. 35-45 - Michael Beeson:
Logic of Ruler and Compass Constructions. 46-55 - Vasco Brattka, Stéphane Le Roux, Arno Pauly:
On the Computational Content of the Brouwer Fixed Point Theorem. 56-67 - Douglas S. Bridges, Robin Havea:
Square Roots and Powers in Constructive Banach Algebra Theory. 68-77 - Dan Brumleve, Joel David Hamkins, Philipp Schlicht:
The Mate-in-n Problem of Infinite Chess Is Decidable. 78-88 - Lorenzo Carlucci, Konrad Zdanowski:
A Note on Ramsey Theorems and Turing Jumps. 89-95 - John Case, Sanjay Jain, Samuel Seah, Frank Stephan:
Automatic Functions, Linear Time and Learning. 96-106 - Marcel Celaya, Frank Ruskey:
An Undecidable Nested Recurrence Relation. 107-117 - Yijia Chen, Jörg Flum, Moritz Müller:
Hard Instances of Algorithms and Proof Systems. 118-128 - Peter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst:
On Mathias Generic Sets. 129-138 - Anupam Das:
Complexity of Deep Inference via Atomic Flows. 139-150 - Jürgen Dassow, Florin Manea, Robert Mercas:
Connecting Partial Words and Regular Languages. 151-161 - Rod Downey:
Randomness, Computation and Mathematics. 162-181 - Bruce Edmonds, Carlos Gershenson:
Learning, Social Intelligence and the Turing Test - Why an "Out-of-the-Box" Turing Machine Will Not Pass the Turing Test. 182-192 - Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier, Olga Runge:
Confluence in Data Reduction: Bridging Graph Transformation and Kernelization. 193-202 - Chengling Fang, Shenling Wang, Guohua Wu:
Highness and Local Noncappability. 203-211 - David Fernández-Duque, Joost J. Joosten:
Turing Progressions and Their Well-Orders. 212-221 - Fernando Ferreira:
A Short Note on Spector's Proof of Consistency of Analysis. 222-227 - Mark Alan Finlayson:
Sets of Signals, Information Flow, and Folktales. 228-236 - Amos Golan:
On the Foundations and Philosophy of Info-metrics. 237-244 - Ivor Grattan-Guinness:
On Mathematicians Who Liked Logic - The Case of Max Newman. 245-252 - Pierre Guillon, Charalampos Zinoviadis:
Densities and Entropies in Cellular Automata. 253-263 - Yuri Gurevich:
Foundational Analyses of Computation. 264-275 - Juris Hartmanis:
Turing Machine-Inspired Computer Science Results. 276-282 - Sepp Hartung, André Nichterlein:
NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs. 283-292 - Matthew Hendtlass, Peter Schuster:
A Direct Proof of Wiener's Theorem. 293-302 - Kojiro Higuchi, Takayuki Kihara:
Effective Strong Nullness and Effectively Closed Sets. 303-312 - Martin Huschenbett:
Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable. 313-322 - Wiebe van der Hoek, Petar Iliev, Barteld P. Kooi:
On the Relative Succinctness of Two Extensions by Definitions of Multimodal Logic. 323-333 - Emmanuel Jeandel:
On Immortal Configurations in Turing Machines. 334-343 - Anders Johannson, James Y. Zou:
A Slime Mold Solver for Linear Programming Problems. 344-354 - Jaap A. Kaandorp, Daniel Botman, Carlos Tamulonis, Roland Dries:
Multi-scale Modeling of Gene Regulation of Morphogenesis. 355-362 - Alexander Kartzow, Jiamou Liu, Markus Lohrey:
Tree-Automatic Well-Founded Trees. 363-373 - Keisuke Yoshii, Kazuyuki Tanaka:
Infinite Games and Transfinite Recursion of Multiple Inductive Definitions. 374-383 - Takayuki Kihara:
A Hierarchy of Immunity and Density for Sets of Reals. 384-394 - Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen:
How Much Randomness Is Needed for Statistics? 395-404 - Peter Koepke, Benjamin Seyfferth:
Towards a Theory of Infinite Time Blum-Shub-Smale Machines. 405-415 - Shigeru Kondo:
Turing Pattern Formation without Diffusion. 416-421 - Lars Kristiansen:
Degrees of Total Algorithms versus Degrees of Honest Functions. 422-431 - Alexander S. Kulikov, Olga Melanich, Ivan Mihajlin:
A 5n - o(n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function. 432-439 - Andrés Cordón-Franco, Francisco Félix Lara Martín:
Local Induction and Provably Total Computable Functions: A Case Study. 440-449 - Jean Lassègue, Giuseppe Longo:
What is Turing's Comparison between Mechanism and Writing Worth? 450-461 - Bastien Le Gloannec, Nicolas Ollinger:
Substitutions and Strongly Deterministic Tilesets. 462-471 - Fotini Markopoulou:
The Computing Spacetime. 472-484 - George Metcalfe, Christoph Röthlisberger:
Unifiability and Admissibility in Finite Algebras. 485-495 - Ruth Garrett Millikan:
Natural Signs. 496-506 - Samuel E. Moelius III:
Characteristics of Minimal Effective Programming Systems. 507-516 - James D. Murray:
After Turing: Mathematical Modelling in the Biomedical and Social Sciences - From Animal Coat Patterns to Brain Tumours to Saving Marriages. 517-527 - Péter Németi, Gergely Székely:
Existence of Faster than Light Signals Implies Hypercomputation already in Special Relativity. 528-538 - Víctor A. Ocasio-González:
Turing Computable Embeddings and Coding Families of Sets. 539-548 - Shinnosuke Seki, Yasushi Okuno:
On the Behavior of Tile Assembly System at High Temperatures. 549-559 - Grant Olney Passmore, Paul B. Jackson:
Abstract Partial Cylindrical Algebraic Decomposition I: The Lifting Phase. 560-570 - Arno Pauly:
Multi-valued Functions in Computability Theory. 571-580 - NingNing Peng, Kojiro Higuchi, Takeshi Yamazaki, Kazuyuki Tanaka:
Relative Randomness for Martin-Löf Random Sets. 581-588 - Mikhail G. Peretyat'kin:
On the Tarski-Lindenbaum Algebra of the Class of all Strongly Constructivizable Prime Models. 589-598 - Vladimir V. Podolskii:
Lower Bound on Weights of Large Degree Threshold Functions. 599-608 - John Preston:
What Are Computers (If They're not Thinking Things)? 609-615 - Robert Rettinger:
Compactness and the Effectivity of Uniformization. 616-625 - Shankara Narayanan Krishna, Bogdan Aman, Gabriel Ciobanu:
On the Computability Power of Membrane Systems with Controlled Mobility. 626-635 - Ville Salo, Ilkka Törmä:
On Shift Spaces with Algebraic Structure. 636-645 - A. C. Cem Say, Abuzer Yakaryilmaz:
Finite State Verifiers with Constant Randomness. 646-654 - Alexander Shen:
Game Arguments in Computability Theory and Algorithmic Information Theory. 655-666 - Jonathan A. Sherratt:
Turing Patterns in Deserts. 667-674 - Paul Smolensky:
Subsymbolic Computation Theory for the Human Intuitive Processor. 675-685 - Ludwig Staiger:
A Correspondence Principle for Exact Constructive Dimension. 686-695 - Rebecca M. Steiner:
Low n Boolean Subalgebras. 696-702 - Susan G. Sterrett:
Bringing Up Turing's 'Child-Machine'. 703-713 - Matthew P. Szudzik:
Is Turing's Thesis the Consequence of a More General Physical Principle? 714-722 - Andreas Weiermann, Alan R. Woods:
Some Natural Zero One Laws for Ordinals Below ε 0. 723-732 - Jirí Wiedermann:
On the Road to Thinking Machines: Insights and Ideas. 733-744 - Jörg Zimmermann, Armin B. Cremers:
Making Solomonoff Induction Effective - Or: You Can Learn What You Can Bound. 745-754
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-01-31 22:54 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:
