Computation as an Unbounded Process

van Leeuwen, J. - Wiedermann, Jiří
Computation as an Unbounded Process.
Theoretical Computer Science. Roč. 429, 20 April (2012), s. 202-212. ISSN 0304-3975. E-ISSN 1879-2294
Impakt faktor: 0.489, rok: 2012
http://hdl.handle.net/11104/0202642

Citováno: 8

--- CSUHAJ-VARJU, E. - FREUND, R. - VASZIL, G. A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems. MACHINES, COMPUTATIONS, AND UNIVERSALITY, MCU 2015. ISSN 0302-9743, 2015, vol. 9288, p. 31-44. [WOS]
--- AMAN, B. - CSUHAJ-VARJU, E. - FREUND, R. Red-Green P Automata. MEMBRANE COMPUTING (CMC 2014). ISSN 0302-9743, 2014, vol. 8961, p. 139-157. [WOS]
--- AMIDEI, J. - PIANIGIANI, D. - SAN MAURO, L. - SIMI, G. - SORBI, A. TRIAL AND ERROR MATHEMATICS I: DIALECTICAL AND QUASIDIALECTICAL SYSTEMS. REVIEW OF SYMBOLIC LOGIC. ISSN 1755-0203, JUN 2016, vol. 9, no. 2, p. 299-324. [WOS]
--- FREUND, R. - IVANOV, S. - STAIGER, L. Going Beyond Turing with P Automata: Regular Observer omega-Languages and Partial Adult Halting. INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING. ISSN 1548-7199, 2016, vol. 12, no. 1, SI, p. 51-69. [WOS]
--- NARDELLI, E. Viewpoint Do We Really Need Computational Thinking?. COMMUNICATIONS OF THE ACM. ISSN 0001-0782, FEB 2019, vol. 62, no. 2, p. 32-35. [WOS]
--- ALHAZOV, A. - FREUND, R. - IVANOV, S. - OSWALD, M. - VERLAN, S. Extended spiking neural P systems with white hole rules and their red-green variants. NATURAL COMPUTING. ISSN 1567-7818, JUN 2018, vol. 17, no. 2, 1, SI, p. 297-310. [WOS]
--- NAGY, B. - VALYI, S. An Extension of Interval-Valued Computing Equivalent to Red-Green Turing Machines. MACHINES, COMPUTATIONS, AND UNIVERSALITY, MCU 2018. ISSN 0302-9743, 2018, vol. 10881, p. 137-152. [WOS]
--- CSUHAJ-VARJU, E. - FREUND, R. - VASZIL, G. Watson-Crick T0L Systems and Red-Green Register Machines. FUNDAMENTA INFORMATICAE. ISSN 0169-2968, 2017, vol. 155, no. 1-2, p. 111-129. [WOS]