default search action
7. CiE 2011: Sofia, Bulgaria
- Benedikt Löwe, Dag Normann, Ivan N. Soskov, Alexandra A. Soskova:
Models of Computation in Context - 7th Conference on Computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 - July 2, 2011. Proceedings. Lecture Notes in Computer Science 6735, Springer 2011, ISBN 978-3-642-21874-3 - Pablo Arrighi, Renan Fargetton, Vincent Nesme, Eric Thierry:
Applying Causality Principles to the Axiomatization of Probabilistic Cellular Automata. 1-10 - Mingzhong Cai:
Three Theorems on n-REA Degrees: Proof-Readers and Verifiers. 11-20 - Merlin Carl:
A Computational Approach to an Alternative Working Environment for the Constructible Universe. 21-30 - John Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukhin, Frank Stephan:
Automatic Learners with Feedback Queries. 31-40 - Juan Castellanos, Victor Mitrana, Eugenio Santos:
Splicing Systems: Accepting Versus Generating. 41-50 - Douglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel:
Effective Categoricity of Injection Structures. 51-60 - Yijia Chen, Jörg Flum, Moritz Müller:
Consistency and Optimality. 61-70 - Chengling Fang, Jiang Liu, Guohua Wu:
Cupping and Diamond Embeddings: A Unifying Approach. 71-80 - Amin Farjudian:
On the Kolmogorov Complexity of Continuous Real Functions. 81-91 - Daniela Genova:
Defining Languages by Forbidding-Enforcing Systems. 92-101 - Xiaoyang Gu, Jack H. Lutz, Satyadev Nandakumar, James S. Royer:
Axiomatizing Resource Bounds for Measure. 102-111 - Peter Hertling, Victor L. Selivanov:
Complexity Issues for Preorders on Finite Labeled Forests. 112-121 - Mathieu Hoyrup:
Randomness and the Ergodic Decomposition. 122-131 - Mathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch:
Computability of the Radon-Nikodym Derivative. 132-141 - Imran Khaliq, Bakhadyr Khoussainov, Jiamou Liu:
Extracting Winning Strategies in Update Games. 142-151 - Peter Koepke, Philip D. Welch:
A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0. 152-159 - Shankara Narayanan Krishna, Gabriel Ciobanu:
Computability Power of Mobility in Enhanced Mobile Membranes. 160-170 - Martin Kutrib:
Nature-Based Problems in Cellular Automata. 171-180 - James I. Lathrop, Jack H. Lutz, Brian Patterson:
Multi-Resolution Cellular Automata for Real Computation. 181-190 - Florin Manea:
Deciding According to the Shortest Computations. 191-200 - Stoyan Mihov, Klaus U. Schulz:
Computation of Similarity - Similarity Search as Computation. 201-210 - Russell Miller, Alexey Ovchinnikov:
Adapting Rabin's Theorem for Differential Fields. 211-220 - Prakash Panangaden:
Quantum Information Channels in Curved Spacetime. 221-229 - Elena V. Pribavkina, Emanuele Rodaro:
Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete. 230-238 - Mathieu Raffinot:
Consecutive Ones Property Testing: Cut or Swap. 239-249 - Agustin Riscos-Núñez:
Current Developments on Computational Modeling Using P Systems. 250-251 - Philipp Schlicht, Frank Stephan:
Automata on Ordinals and Linear Orders. 252-259 - Victor L. Selivanov:
A Fine Hierarchy of ω-Regular k-Partitions. 260-269 - Dimiter Skordev, Ivan Georgiev:
On a Relative Computability Notion for Real Functions. 270-279 - Antoine Taveneaux:
Towards an Axiomatic System for Kolmogorov Complexity. 280-289 - Hiroshi Umeo, Kinuo Nishide, Takuya Yamawaki:
A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving Based. 290-299 - Stefan V. Vatev:
Conservative Extensions of Abstract Structures. 300-309 - Shengling Wang, Guohua Wu:
On a Hierarchy of Plus-Cupping Degrees. 310-318
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.