10. UC 2011:
Turku, Finland
Cristian S. Calude, Jarkko Kari, Ion Petre, Grzegorz Rozenberg (Eds.):
Unconventional Computation - 10th International Conference, UC 2011, Turku, Finland, June 6-10, 2011. Proceedings.
Lecture Notes in Computer Science 6714 Springer 2011, ISBN 978-3-642-21340-3
Invited Lectures and Tutorials
Regular Contributions
- Alastair A. Abbott, Cristian S. Calude:
Von Neumann Normalisation and Symptoms of Randomness: An Application to Sequences of Quantum Random Bits.
40-51

- Olivier Bouré, Nazim Fatès, Vincent Chevrier:
Robustness of Cellular Automata in the Light of Asynchronous Information Transmission.
52-63

- Adán Cabello, Joost J. Joosten:
Hidden Variables Simulating Quantum Contextuality Increasingly Violate the Holevo Bound.
64-76

- Silvio Capobianco, Tommaso Toffoli:
Can Anything from Noether's Theorem Be Salvaged for Discrete Dynamical Systems?
77-88

- Jürgen Dassow, Florin Manea, Bianca Truthe:
On Normal Forms for Networks of Evolutionary Processors.
89-100

- Jérôme Durand-Lose:
Geometrical Accumulations and Computably Enumerable Real Numbers.
101-112

- Viv Kendon, Angelika Sebald, Susan Stepney, Matthias Bechmann, Peter Hines, Robert C. Wagner:
Heterotic Computing.
113-124

- Takahiro Kubota, Yoshihiko Kakutani, Go Kato, Yasuhito Kawano:
A Formal Approach to Unconditional Security Proofs for Quantum Key Distribution.
125-137

- Russell Martin, Thomas Nickson, Igor Potapov:
Geometric Computations by Broadcasting Automata on the Integer Grid.
138-151

- Naya Nagy, Selim G. Akl:
Computations with Uncertain Time Constraints: Effects on Parallelism and Universality.
152-163

- Radu Nicolescu, Huiling Wu:
BFS Solution for Disjoint Paths in P Systems.
164-176

- Primoz Pecar, Iztok Lebar Bajec:
The Key Elements of Logic Design in Ternary Quantum-Dot Cellular Automata.
177-188

- Lukás Petru, Jirí Wiedermann:
A Universal Flying Amorphous Computer.
189-200

- A. C. Cem Say, Abuzer Yakaryilmaz:
Computation with Narrow CTCs.
201-211

- David Sears, Kai Salomaa:
Extended Watson-Crick L Systems with Regular Trigger Languages.
212-223

- William M. Stevens:
Computing with Planar Toppling Domino Arrangements.
224-233

- Ludek Zaloudek, Lukás Sekanina:
Increasing Fault-Tolerance in Cellular Automata-Based Systems.
234-245

Last update Thu May 23 18:03:47 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page