Abstract is missing.
- Applying Causality Principles to the Axiomatization of Probabilistic Cellular AutomataPablo Arrighi, Renan Fargetton, Vincent Nesme, Eric Thierry. 1-10 [doi]
- Three Theorems on n-REA Degrees: Proof-Readers and VerifiersMingzhong Cai. 11-20 [doi]
- A Computational Approach to an Alternative Working Environment for the Constructible UniverseMerlin Carl. 21-30 [doi]
- Automatic Learners with Feedback QueriesJohn Case, Sanjay Jain, Yuh Shin Ong, Pavel Semukhin, Frank Stephan. 31-40 [doi]
- Splicing Systems: Accepting Versus GeneratingJuan Castellanos, Victor Mitrana, Eugenio Santos. 41-50 [doi]
- Effective Categoricity of Injection StructuresDouglas Cenzer, Valentina S. Harizanov, Jeffrey B. Remmel. 51-60 [doi]
- Consistency and OptimalityYijia Chen, Jörg Flum, Moritz Müller. 61-70 [doi]
- Cupping and Diamond Embeddings: A Unifying ApproachChengling Fang, Jiang Liu 0002, Guohua Wu. 71-80 [doi]
- On the Kolmogorov Complexity of Continuous Real FunctionsAmin Farjudian. 81-91 [doi]
- Defining Languages by Forbidding-Enforcing SystemsDaniela Genova. 92-101 [doi]
- Axiomatizing Resource Bounds for MeasureXiaoyang Gu, Jack H. Lutz, Satyadev Nandakumar, James S. Royer. 102-111 [doi]
- Complexity Issues for Preorders on Finite Labeled ForestsPeter Hertling, Victor L. Selivanov. 112-121 [doi]
- Randomness and the Ergodic DecompositionMathieu Hoyrup. 122-131 [doi]
- Computability of the Radon-Nikodym DerivativeMathieu Hoyrup, Cristobal Rojas, Klaus Weihrauch. 132-141 [doi]
- Extracting Winning Strategies in Update GamesImran Khaliq, Bakhadyr Khoussainov, Jiamou Liu. 142-151 [doi]
- A Generalised Dynamical System, Infinite Time Register Machines, and $\Pi^1_1$ -CA0Peter Koepke, Philip D. Welch. 152-159 [doi]
- Computability Power of Mobility in Enhanced Mobile MembranesShankara Narayanan Krishna, Gabriel Ciobanu. 160-170 [doi]
- Nature-Based Problems in Cellular AutomataMartin Kutrib. 171-180 [doi]
- Multi-Resolution Cellular Automata for Real ComputationJames I. Lathrop, Jack H. Lutz, Brian Patterson. 181-190 [doi]
- Deciding According to the Shortest ComputationsFlorin Manea. 191-200 [doi]
- Computation of Similarity - Similarity Search as ComputationStoyan Mihov, Klaus U. Schulz. 201-210 [doi]
- Adapting Rabin's Theorem for Differential FieldsRussell Miller, Alexey Ovchinnikov. 211-220 [doi]
- Quantum Information Channels in Curved SpacetimePrakash Panangaden. 221-229 [doi]
- Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-CompleteElena V. Pribavkina, Emanuele Rodaro. 230-238 [doi]
- Consecutive Ones Property Testing: Cut or SwapMathieu Raffinot. 239-249 [doi]
- Current Developments on Computational Modeling Using P SystemsAgustin Riscos-Núñez. 250-251 [doi]
- Automata on Ordinals and Linear OrdersPhilipp Schlicht, Frank Stephan. 252-259 [doi]
- A Fine Hierarchy of ω-Regular k-PartitionsVictor L. Selivanov. 260-269 [doi]
- On a Relative Computability Notion for Real FunctionsDimiter Skordev, Ivan Georgiev. 270-279 [doi]
- Towards an Axiomatic System for Kolmogorov ComplexityAntoine Taveneaux. 280-289 [doi]
- A New Optimum-Time Firing Squad Synchronization Algorithm for Two-Dimensional Rectangle Arrays: One-Sided Recursive Halving BasedHiroshi Umeo, Kinuo Nishide, Takuya Yamawaki. 290-299 [doi]
- Conservative Extensions of Abstract StructuresStefan Vatev. 300-309 [doi]
- On a Hierarchy of Plus-Cupping DegreesShengling Wang, Guohua Wu. 310-318 [doi]