×

The nature of computation. Logic, algorithms, applications. 9th conference on computability in Europe, CiE 2013, Milan, Italy, July 1–5, 2013. Proceedings. (English) Zbl 1268.68007

Lecture Notes in Computer Science 7921. Berlin: Springer (ISBN 978-3-642-39052-4/pbk). xviii, 446 p. (2013).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 1243.68017].
Indexed articles:
Ambos-Spies, Klaus; Brandt, Ulrike; Ziegler, Martin, Real benefit of promises and advice, 1-11 [Zbl 1315.03066]
Bournez, Olivier; Graça, Daniel S.; Pouly, Amaury; Zhong, Ning, Computability and computational complexity of the evolution of nonlinear dynamical systems, 12-21 [Zbl 1387.68131]
Braga, Marília D. V., An overview of genomic distances modeled with indels, 22-31 [Zbl 1388.92021]
Böcker, Sebastian; Baumbach, Jan, Cluster editing, 33-44 [Zbl 1387.68177]
Case, John; Ralston, Michael, Beyond Rogers’ non-constructively computable function, 45-54 [Zbl 1433.03121]
Cervelle, Julien, Constructing continuous systems from discrete cellular automata, 55-64 [Zbl 1390.37023]
Cicalese, Ferdinando; Cordasco, Gennaro; Gargano, Luisa; Milanič, Martin; Vaccaro, Ugo, Latency-bounded target set selection in social networks, 65-77 [Zbl 1390.91262]
Cormode, Graham, Summary data structures for massive data, 78-86 [Zbl 1387.68082]
de Rugy-Altherre, Nicolas, Determinant versus permanent: salvation via generalization?, 87-96 [Zbl 1387.68128]
Dondi, Riccardo; El-Mabrouk, Nadia, Aligning and labeling genomes under the duplication-loss model, 97-107 [Zbl 1387.68123]
Durand-Lose, Jérôme, Irrationality is needed to compute with signal machines with only three speeds, 108-119 [Zbl 1387.68110]
Fischbach, Tim; Seyfferth, Benjamin, On \(\lambda \)-definable functions on ordinals, 135-146 [Zbl 1433.03037]
Franklin, Johanna N. Y.; Kach, Asher M.; Miller, Russell; Solomon, Reed, Local computability for ordinals, 161-170 [Zbl 1433.03118]
Fujiwara, Makoto; Yokoyama, Keita, A note on the sequential version of \(\Pi^1_2\) statements, 171-180 [Zbl 1388.03057]
Gao, Ziyuan; Jain, Sanjay; Stephan, Frank, On conservative learning of recursively enumerable languages, 181-190 [Zbl 1387.68139]
Gasperin, Anthony, Topology of asymptotic cones and non-deterministic polynomial time computations, 191-199 [Zbl 1390.68317]
Gavruskin, Alexander; Khoussainov, Bakhadyr, On decidable and computable models of theories, 200-209 [Zbl 1433.03084]
Gawrychowski, Paweł; Manea, Florin; Nowotka, Dirk, Discovering hidden repetitions in words, 210-219 [Zbl 1387.68190]
Genova, Daniela, Language forbidding-enforcing systems defining DNA codewords, 220-229 [Zbl 1387.68111]
Habič, Miha E., Cardinal-recognizing infinite time Turing machines, 231-240 [Zbl 1433.03106]
Haigh, Thomas, ‘Stored program concept’ considered harmful: history and historiography, 241-251 [Zbl 1387.68006]
Hansen, Thomas Dueholm; Ibsen-Jensen, Rasmus, The complexity of interior point methods for solving discounted turn-based stochastic games, 252-262 [Zbl 1390.68346]
Kartzow, Alexander; Schlicht, Philipp, Structures without scattered-automatic presentation, 273-283 [Zbl 1433.03100]
Krishna, Shankara Narayanan; Gheorghe, Marian; Dragomir, Ciprian, Some classes of generalised communicating P systems and simple kernel P systems, 284-293 [Zbl 1387.68114]
Le Roux, Stéphane; Pauly, Arno, Closed choice for finite and for convex sets, 294-305 [Zbl 1433.03151]
Lubarsky, Robert S.; Rathjen, Michael, Realizability models separating various fan theorems, 306-315 [Zbl 1433.03152]
Melnikov, Alexander G.; Nies, André, The classification problem for compact computable metric spaces, 320-328 [Zbl 1433.03153]
Pardini, Giovanni; Barbuti, Roberto; Maggiolo-Schettini, Andrea; Milazzo, Paolo; Tini, Simone, A compositional semantics of reaction systems with restriction, 330-339 [Zbl 1387.68115]
Peretyat’kin, Mikhail G., The Tarski-Lindenbaum algebra of the class of all strongly constructivizable countable saturated models, 342-352 [Zbl 1433.03086]
Rosone, Giovanna; Sciortino, Marinella, The Burrows-Wheeler transform between data compression and combinatorics on words, 353-364 [Zbl 1370.68088]
Soskov, Ivan N., A note on \(\omega \)-jump inversion of degree spectra of structures, 365-370 [Zbl 1433.03111]
Soskova, Mariya I., The Turing universe in the context of enumeration reducibility, 371-382 [Zbl 1433.03113]
Stukachev, Alexey, On processes and structures, 393-402 [Zbl 1433.03119]
Tedre, Matti, Three debates about computing, 404-413 [Zbl 1387.68008]
Vatev, Stefan, Another jump inversion theorem for structures, 414-423 [Zbl 1433.03112]
Vereshchagin, Nikolay, On algorithmic strong sufficient statistics, 424-433 [Zbl 1362.68117]
Yap, Chee; Sagraloff, Michael; Sharma, Vikram, Analytic root clustering: a complete algorithm using soft zero tests, 434-444 [Zbl 1416.65068]

MSC:

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
03-06 Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations
03Dxx Computability and recursion theory
68Qxx Theory of computing
00B25 Proceedings of conferences of miscellaneous specific interest

Citations:

Zbl 1243.68017
PDFBibTeX XMLCite
Full Text: DOI