×

zbMATH — the first resource for mathematics

Machines, computations, and universality. 5th international conference, MCU 2007, Orléans, France, September 10–13, 2007. Proceedings. (English) Zbl 1129.68003
Lecture Notes in Computer Science 4664. Berlin: Springer (ISBN 978-3-540-74592-1/pbk). x, 325 p. (2007).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1067.68007).
Indexed articles:
Bournez, Olivier; Hainry, Emmanuel, On the computational capabilities of several models, 12-23 [Zbl 1211.68196]
Burgin, Mark, Universality, reducibility, and completeness, 24-38 [Zbl 1211.68197]
Campagnolo, Manuel L.; Ojakian, Kerry, Using approximation to relate computational classes over the reals, 39-61 [Zbl 1211.68198]
Hamkins, Joel David, A survey of infinite time Turing machines, 62-71 [Zbl 1211.03060]
Kari, Jarkko, The tiling problem revisited (extended abstract), 72-79 [Zbl 1211.03062]
Koiran, Pascal, Decision versus evaluation in algebraic complexity, 80-89 [Zbl 1211.68219]
Morita, Kenichi; Yamaguchi, Yoshikazu, A universal reversible Turing machine, 90-98 [Zbl 1211.68202]
Subramanian, K. G., P systems and picture languages, 99-109 [Zbl 1211.68203]
Alhazov, Artiom; Freund, Rudolf; Oswald, Marion; Verlan, Sergey, Partial halting in P systems using membrane rules with permitting contexts, 110-121 [Zbl 1159.68463]
Alhazov, Artiom; Pérez-Jiménez, Mario J., Uniform solution of QSAT using polarizationless active membranes, 122-133 [Zbl 1211.68194]
Baumeister, Dorothea; Rothe, Jörg, Satisfiability parsimoniously reduces to the Tantrix\(^{\text{TM}}\) rotation puzzle problem, 134-145 [Zbl 1159.68469]
Bolognesi, Tommaso, Planar trivalent network computation, 146-157 [Zbl 1211.68195]
Dassow, Jürgen; Truthe, Bianca, On the power of networks of evolutionary processors, 158-169 [Zbl 1159.68464]
De Mol, Liesbeth, Study of limits of solvability in tag systems, 170-181 [Zbl 1211.03058]
Fisher, John; Bezem, Marc, Query completeness of Skolem machine computations, 182-192 [Zbl 1159.68460]
Gruber, Hermann; Holzer, Markus; Kutrib, Martin, More on the size of Higman-Haines sets: Effective constructions, 193-204 [Zbl 1159.68475]
Matveevici, Artiom; Rogozhin, Yurii; Verlan, Sergey, Insertion-deletion systems with one-sided contexts, 205-217 [Zbl 1155.68419]
Castellanos, Juan; Manea, Florin; de Mingo López, Luis Fernando; Mitrana, Victor, Accepting networks of splicing processors with filtered connections, 218-229 [Zbl 1211.68199]
Mráz, F.; Otto, F.; Plátek, M., Hierarchical relaxations of the correctness preserving property for restarting automata, 230-241 [Zbl 1211.68235]
Neary, Turlough; Woods, Damien, Four small universal Turing machines, 242-254 [Zbl 1159.68461]
Nishio, Hidenosuke, Changing the neighborhood of cellular automata, 255-266 [Zbl 1211.68263]
Okhotin, Alexander, A simple P-complete problem and its representations by language equations, 267-278 [Zbl 1211.68237]
Teytaud, Olivier, Slightly beyond Turing’s computability for studying genetic programming, 279-290 [Zbl 1211.68204]
Umeo, Hiroshi; Yanagihara, Takashi, A smallest five-state solution to the firing squad synchronization problem, 291-302 [Zbl 1159.68509]
Woods, Damien; Neary, Turlough, Small semi-weakly universal Turing machines, 303-315 [Zbl 1159.68462]
Yunès, Jean-Baptiste, Simple new algorithms which solve the firing squad synchronization problem: a \(7\)-states \(4n\)-steps solution, 316-324 [Zbl 1211.68264]

MSC:
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Q05 Models of computation (Turing machines, etc.) (MSC2010)
00B25 Proceedings of conferences of miscellaneous specific interest
PDF BibTeX XML Cite
Full Text: DOI