Show indexed articles as search result.

The articles of this volume will be reviewed individually.
Indexed articles:
Zenil, Hector, Introducing the computable universe, 1-20 [Zbl 1256.68002]
Swade, Doron, Origins of digital computing: Alan Turing, Charles Babbage, and Ada Lovelace, 23-43 [Zbl 1256.68001]
De Mol, Liesbeth, Generating, solving and the mathematics of Homo Sapiens: Emil Post’s views on computation, 45-62 [Zbl 1256.68060]
Turner, Raymond, Machines, 63-76 [Zbl 1256.68065]
Dershowitz, Nachum; Falkovich, Evgenia, Effectiveness, 77-97 [Zbl 1256.68061]
Sieg, Wilfried, Axioms for computability: do they allow a proof of Church’s thesis?, 99-123 [Zbl 1256.68062]
Cooper, S. Barry, The mathematician’s bias – and the return to embodied computation, 125-142 [Zbl 1256.68059]
Bauer, Andrej, Intuitionistic mathematics and realizability in the physical world, 143-157 [Zbl 1257.03014]
Hewitt, Carl, What is computation? Actor model versus Turing’s model, 159-185 [Zbl 1256.68069]
Ehrenfeucht, Andrzej; Kleijn, Jetty; Koutny, Maciej; Rozenberg, Grzegorz, Reaction systems: a natural computing approach to the functioning of living cells, 189-208 [Zbl 1256.68071]
Margenstern, Maurice, Bacteria, Turing machines and hyperbolic cellular automata, 209-230 [Zbl 1256.68070]
Teuscher, Christof, Computation and communication in unorganized systems, 231-242 [Zbl 1256.68064]
Wiedermann, Jiří, The many forms of amorphous computational systems, 243-256 [Zbl 1256.68072]
Martínez, Genaro J.; Adamatzky, Andrew; Mcintosh, Harold V., Computing on rings, 257-276 [Zbl 1256.68125]
Chaitin, Gregory, Life as evolving software, 277-302 [Zbl 1257.92003]
Velupillai, K. Vela; Zambelli, Stefano, Computability and algorithmic complexity in economics, 303-331 [Zbl 1257.91013]
Doria, Francisco Antonio, Blueprint for a hypercomputer, 333-344 [Zbl 1256.68068]
Beavers, Anthony F.; Harrison, Christopher D., Information-theoretic teleodynamics in natural and artificial systems, 347-363 [Zbl 1256.68013]
Fredkin, Edward, Discrete theoretical processes (DTP), 365-380 [Zbl 1256.00013]
Schmidhuber, Jürgen, The fastest way of computing all universes, 381-398 [Zbl 1256.03014]
Hutter, Marcus, The subjective computable universe, 399-416 [Zbl 1256.00014]
Wolfram, Stephen, What is ultimately possible in physics?, 417-433 [Zbl 1256.68066]
Sutner, Klaus, Universality, Turing incompleteness and observers, 435-449 [Zbl 1256.68063]
Bolognesi, Tommaso, Algorithmic causal sets for a computational spacetime, 451-477 [Zbl 1256.68067]
Szudzik, Matthew P., The computable universe hypothesis, 479-523 [Zbl 1257.03075]
Calude, Cristian S.; Meyerstein, F. Walter; Salomaa, Arto, The universe is lawless or “Pantôn chrêmatôn metron anthrôpon einai”, 525-537 [Zbl 1257.03002]
Calude, Cristian S.; Svozil, Karl, Is feasibility in physics limited by fantasy alone?, 539-547 [Zbl 1256.68087]
Deutsch, David, What is computation? (How) does nature compute?, 551-565 [Zbl 1256.68088]
Lloyd, Seth, The universe as quantum computer, 567-581 [Zbl 1256.68076]
Żukowski, Marek, Quantum speedup and temporal inequalities for sequential actions, 583-594 [Zbl 1256.68073]
Cabello, Adán, The contextual computer, 595-604 [Zbl 1256.68075]
Breuer, Thomas, A Gödel-Turing perspective on quantum states indistinguishable from inside, 605-616 [Zbl 1256.68074]
Zizzi, Paola, When humans do compute quantum, 617-628 [Zbl 1256.68077]