|
|
|
|
Computers and the Mechanics of Communication: Outline of a Vision from the Work of Petri and Holt |
|
|
3 | (10) |
|
|
|
|
|
13 | (10) |
|
|
|
Is Human Mind Fully Algorithmic? Remarks on Kurt Godel's Incompleteness Theorems |
|
|
23 | (11) |
|
|
|
A New Approach to the Paperfolding Sequences |
|
|
34 | (10) |
|
|
|
|
|
|
|
|
|
Covering the Recursive Sets |
|
|
44 | (10) |
|
|
|
|
|
|
|
On Distributed Monitoring and Synthesis |
|
|
54 | (9) |
|
|
|
Unconventional Computing: Do We Dream Too Much? |
|
|
63 | (8) |
|
|
|
Newton's Forward Difference Equation for Functions from Words to Words |
|
|
71 | (12) |
|
|
|
Degrees of Unsolvability: A Tutorial |
|
|
83 | (12) |
|
|
|
Universality in Molecular and Cellular Computing |
|
|
95 | (12) |
|
|
|
|
|
|
Some Results on Interactive Proofs for Real Computations |
|
|
107 | (10) |
|
|
|
|
|
Prime Model with No Degree of Autostability Relative to Strong Constructivizations |
|
|
117 | (10) |
|
|
|
Immune Systems in Computer Virology |
|
|
127 | (10) |
|
|
|
|
|
|
|
|
|
ITRM-Recognizability from Random Oracles |
|
|
137 | (8) |
|
|
|
P Systems with Parallel Rewriting for Chain Code Picture Languages |
|
|
145 | (11) |
|
|
|
|
|
|
|
Base-Complexity Classifications of QCB0-Spaces |
|
|
156 | (11) |
|
|
|
|
|
|
|
New Bounds on Optimal Sorting Networks |
|
|
167 | (10) |
|
|
|
|
|
Nonexistence of Minimal Pairs in L[ d] |
|
|
177 | (9) |
|
|
|
|
|
|
|
|
|
Intuitionistic Provability versus Uniform Provability in RCA |
|
|
186 | (10) |
|
|
|
Randomness and Differentiability of Convex Functions |
|
|
196 | (10) |
|
|
|
Weighted Automata on Infinite Words in the Context of Attacker-Defender Games |
|
|
206 | (10) |
|
|
|
|
|
|
|
|
|
Turing Jumps Through Provability |
|
|
216 | (10) |
|
|
|
Rice's Theorem in Effectively Enumerable Topological Spaces |
|
|
226 | (10) |
|
|
|
|
|
Decidability of Termination Problems for Sequential P Systems with Active Membranes |
|
|
236 | (10) |
|
|
|
Weihrauch Degrees of Finding Equilibria in Sequential Games |
|
|
246 | (12) |
|
|
|
|
|
Prefix and Right-Partial Derivative Automata |
|
|
258 | (10) |
|
|
|
|
|
|
|
A Note on the Computable Categoricity of lp Spaces |
|
|
268 | (8) |
|
|
|
On the Computational Content of Termination Proofs |
|
|
276 | (10) |
|
|
|
|
|
Local Compactness for Computable Polish Metric Spaces is Π11-complete |
|
|
286 | (5) |
|
|
|
|
|
Iterative Forcing and Hyperimmunity in Reverse Mathematics |
|
|
291 | (11) |
|
|
|
Completely Regular Bishop Spaces |
|
|
302 | (11) |
|
|
|
Computing Equality-Free String Factorisations |
|
|
313 | (11) |
|
|
|
Towards the Effective Descriptive Set Theory |
|
|
324 | (10) |
|
|
|
On Computability of Navier-Stokes' Equation |
|
|
334 | (9) |
|
|
|
|
|
|
|
Kalmar and Peter: Undecidability as a Consequence of Incompleteness |
|
|
343 | (10) |
|
|
|
How to Compare Buchholz-Style Ordinal Notation Systems with Gordeev-Style Notation Systems |
|
|
353 | (10) |
|
|
|
|
| Author Index |
|
363 | |
Lisainfo e-raamatute kohta