C. S. Calude Citations

February 18, 2016

Web of Science

References

[1] Philosophy and The Hitchhiker’s Guide to the Galaxy Preface. In PHILOSO-PHY AND THE HITCHHIKER’S GUIDE TO THE GALAXY, Joll, N, Ed. 2012,pp. XI+.

[2] Abbott, A., Calude, C., and Svozil, K. Alastair Abbott, Cristian Calude andKarl Svozil describe - A QUANTUM RANDOM ORACLE. In ALAN TURING:HIS WORK AND IMPACT, Cooper, SB and VanLeeuwen, J, Ed. 2013, pp. 206–210.

[3] Abbott, A. A. De-quantisation of the quantum Fourier transform. APPLIEDMATHEMATICS AND COMPUTATION 219, 1 (SEP 15 2012), 3–13. 3rd In-ternational Workshop on Physics and Computation, EGYPT, AUG 30-SEP 06,2010.

[4] Abbott, A. A. The Deutsch-Jozsa problem: de-quantisation and entanglement.NATURAL COMPUTING 11, 1, SI (MAR 2012), 3–11.

[5] Abbott, A. A., Bechmann, M., Calude, C. S., and Sebald, A. A Nu-clear Magnetic Resonance Implementation of a Classical Deutsch-Jozsa Algorithm.INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING 8, 2(2012), 161–175.

[6] Abbott, A. A., Calude, C. S., Conder, J., and Svozil, K. Strong Kochen-Specker theorem and incomputability of quantum randomness. PHYSICAL RE-VIEW A 86, 6 (DEC 17 2012).

[7] Abbott, A. A., Calude, C. S., and Svozil, K. A quantum random numbergenerator certified by value indefiniteness. MATHEMATICAL STRUCTURES INCOMPUTER SCIENCE 24, 3, SI (JUN 2014).

[8] Abbott, A. A., Calude, C. S., and Svozil, K. Value-indefinite observablesare almost everywhere. PHYSICAL REVIEW A 89, 3 (MAR 10 2014).

[9] Abbott, A. A., Calude, C. S., and Svozil, K. A variant of the Kochen-Specker theorem localising value indefiniteness. JOURNAL OF MATHEMATICALPHYSICS 56, 10 (OCT 2015).

[10] Abbott, A. A., Calude, C. S., and Svozil, K. On the Unpredictabilityof Individual Quantum Measurement Outcomes. In FIELDS OF LOGIC ANDCOMPUTATION II: ESSAYS DEDICATED TO YURI GUREVICH ON THEOCCASION OF HIS 75TH BIRTHDAY (2015), Beklemishev, LD and Blass, Aand Dershowitz, N and Finkbeiner, B and Schulte, W, Ed., vol. 9300 of LectureNotes in Computer Science, pp. 69–86. Symposium on Logic in Computer Science

1

Celebrating Yuri Gurevich’s 75th Birthday (YuriFest), Tech Univ Berlin, Berlin,GERMANY, SEP 11-12, 2015.

[11] Adamatzky, A. Encapsulating reaction-diffusion computers. In MACHINES,COMPUTATIONS, AND UNIVERSALITY, PROCEEDINGS (2007), Durand-Lose, J and Margenstern, M, Ed., vol. 4664 of Lecture Notes in Computer Science,Lab Informat Fond Orleans; Univ Orleans; Univ Meta, LITA; Conseil Reg, RegCtr; Conseil Gen Loiret; Mairie Orleans; GDR 673 CNRS Informat Math, pp. 1–11. 5th International Conference on Machines, Computations, and Universality,Orleans, FRANCE, SEP 10-13, 2007.

[12] Adamatzky, A. Hot ice computer. PHYSICS LETTERS A 374, 2 (DEC 282009), 264–271.

[13] Adamatzky, A. Advances in Physarum Machines Gates, Hulls, Mazes and Rout-ing with Slime Mould. In APPLICATIONS, TOOLS AND TECHNIQUES ONTHE ROAD TO EXASCALE COMPUTING (2012), DeBosschere, K and DHol-lander, EH and Joubert, GR and Padua, D and Peters, F, Ed., vol. 22 of Advancesin Parallel Computing, pp. 41–54. 14th Biennial ParCo Conference (ParCo), Ghent,BELGIUM, AUG 31-SEP 03, 2011.

[14] Adamatzky, A. Towards plant wires. BIOSYSTEMS 122 (AUG 2014), 1–6.

[15] Adamatzky, A., and Martinez, G. J. Bio-Imitation of Mexican MigrationRoutes to the USA with Slime Mould on 3D Terrains. JOURNAL OF BIONICENGINEERING 10, 2 (APR 2013), 242–250.

[16] Adamatzky, A. I. Route 20, Autobahn 7, and Slime Mold: Approximating theLongest Roads in USA and Germany With Slime Mold on 3-D Terrains. IEEETRANSACTIONS ON CYBERNETICS 44, 1 (JAN 2014), 126–136.

[17] Akl, S. G. Even accelerating machines are not universal. INTERNATIONALJOURNAL OF UNCONVENTIONAL COMPUTING 3, 2 (2007), 105–121.

[18] Akl, S. G. Evolving Computational Systems. In HANDBOOK OF PARALLELCOMPUTING: MODELS, ALGORITHMS AND APPLICATIONS, Rajasekaran,S and Reif, J, Ed., Chapman & Hall-CRC Computer and Information ScienceSeries. 2008.

[19] Alexandru, A., and Ciobanu, G. Algebraic Properties of Generalized Mul-tisets. In 2013 15TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC ANDNUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2013)(2014), Bjorner, N and Negru, V and Ida, T and Jebelean, T and Petcu, D andWatt, S and Zaharie, D, Ed., IEEE; IEEE Comp Soc, pp. 367–374. 15th Interna-tional Symposium on Symbolic and Numeric Algorithms for Scientific Computing(SYNASC), Timisoara, ROMANIA, SEP 23-26, 2013.

[20] Alford, G. Explicitly constructing universal extended H systems. In UNCON-VENTIONAL MODELS OF COMPUTATION (1998), Calude, CS and Casti, Jand Dinneen, MJ, Ed., SPRINGER SERIES IN DISCRETE MATHEMATICSAND THEORETICAL COMPUTER SCIENCE, Univ Auckland; Ctr Discrete

2

Math & Theoret Comp Sci; Santa Fe Inst, pp. 108–117. 1st International Confer-ence on Unconventional Models of Computation (UMC 98), UNIV AUCKLAND,AUCKLAND, NEW ZEALAND, JAN 05-09, 1998.

[21] Alhazov, A., Freund, R., and Morita, K. Reversibility and Determinism inSequential Multiset Rewriting. In UNCONVENTIONAL COMPUTATION, PRO-CEEDINGS (2010), Calude, CS and Hagiya, M and Morita, K and Rozenberg, Gand Timmis, J, Ed., vol. 6079 of Lecture Notes in Computer Science, EATCS; AcadEuropaea; Ctr Discrete Math & Theoret Comp Sci, pp. 21–31. 9th InternationalConference on Unconventional Computation, Univ Tokyo, Hongo Campus, Tokyo,JAPAN, JUN 21-25, 2010.

[22] Alhazov, A., Freund, R., and Morita, K. Sequential and maximally parallelmultiset rewriting: reversibility and determinism. NATURAL COMPUTING 11,1, SI (MAR 2012), 95–106.

[23] Alhazov, A., and Morita, K. On Reversibility and Determinism in P Systems.In MEMBRANE COMPUTING (2010), Paun, G and Perez Jimenez, MJ andRiscos Nunez, A and Rozenberg, G and Salomaa, A, Ed., vol. 5957 of Lecture Notesin Computer Science, Int Assoc Pattern Recognit; Informat Technol Ind Dev Agcy;Microsoft Innovat Lab Cairo; Nile Univ; Univ Surrey; Univ Cagliari, pp. 158–168.10th International Workshop on Membrane Computing9th International Workshopon Multiple Classifier Systems, Natl Coll Valaicu Voda Curtea de Arges, Curteade Arges, ROMANIACairo, EGYPT, AUG 24-27, 2009APR 07-09, 2010.

[24] Aman, B., and Ciobanu, G. Verification of membrane systems with delays viaPetri nets with delays. THEORETICAL COMPUTER SCIENCE 598 (SEP 202015), 87–101.

[25] Aman, B., Csuhaj-Varju, E., and Freund, R. Red-Green P Automata. InMEMBRANE COMPUTING (CMC 2014) (2014), Gheorghe, M and Rozenberg,G and Salomaa, A and Sosik, P and Zandron, C, Ed., vol. 8961 of Lecture Notes inComputer Science, Silesian Univ, Fac Philosophy & Sci, Inst Comp Sci, pp. 139–157. 15th International Conference on Membrane Computing (CMC), Prague,CZECH REPUBLIC, AUG 20-22, 2014.

[26] Ambos-Spies, K., Weihrauch, K., and Zheng, X. Weakly computable realnumbers. JOURNAL OF COMPLEXITY 16, 4 (DEC 2000), 676–690.

[27] An, L., Tong, L., and Fan, W. Mining decision rules based on in-sim-dominancerelations. In PROGRESS IN INTELLIGENCE COMPUTATION AND APPLI-CATIONS, PROCEEDINGS (2007), Zeng, S and Liu, Y and Zhang, Q and Kang,L, Ed., pp. 448–452. 2nd International Symposium on Intelligence Computationand Application (ISICA 2007), Wuhan, PEOPLES R CHINA, SEP 21-23, 2007.

[28] Andreka, H., Madarasz, J. X., Nemeti, I., Stannett, M., and Szekely,G. Faster than light motion does not imply time travel. CLASSICAL AND QUAN-TUM GRAVITY 31, 9 (MAY 7 2014).

[29] Androutsopoulos, K., Clark, D., Harman, M., Hierons, R. M., Li, Z.,and Tratt, L. Amorphous Slicing of Extended Finite State Machines. IEEETRANSACTIONS ON SOFTWARE ENGINEERING 39, 7 (JUL 2013), 892–909.

3

[30] Apolloni, B., and Gentile, C. Sample size lower bounds in PAC learning byAlgorithmic Complexity Theory. THEORETICAL COMPUTER SCIENCE 209,1-2 (DEC 6 1998), 141–162.

[31] Archibald, M., Brattka, V., and Heuberger, C. Randomness with respectto the signed-digit representation. FUNDAMENTA INFORMATICAE 83, 1-2(2008), 1–19.

[32] Arrighi, P., and Dowek, G. THE PHYSICAL CHURCH-TURING THESISAND THE PRINCIPLES OF QUANTUM THEORY. INTERNATIONAL JOUR-NAL OF FOUNDATIONS OF COMPUTER SCIENCE 23, 5, SI (AUG 2012),1131–1145.

[33] Artacho, F. J. A., Bailey, D. H., Borwein, J. M., and Borwein, P. B.Walking on Real Numbers. MATHEMATICAL INTELLIGENCER 35, 1 (MAR2013), 42–60.

[34] Arugula, M. A., Shroff, N., Katz, E., and He, Z. Molecular AND logicgate based on bacterial anaerobic respiration. CHEMICAL COMMUNICATIONS48, 82 (2012), 10174–10176.

[35] Arulanandham, J. Implementing bead-sort with P systems. In UNCONVEN-TIONAL MODELS IN COMPUTATION, PROCEEDINGS (2002), Calude, C andDinneen, MJ and Peper, F, Ed., vol. 2509 of LECTURE NOTES IN COMPUTERSCIENCE, Ctr Discrete Math & Theoret Comp Sci; Adv Res Ctr Commun ResLab, pp. 115–125. 3rd International Conference on Unconventional Models of Com-putation, KOBE, JAPAN, OCT 15-19, 2002.

[36] Aur, D., Jog, M., and Poznanski, R. R. Computing by physical interactionin neurons. JOURNAL OF INTEGRATIVE NEUROSCIENCE 10, 4 (DEC 2011),413–422.

[37] Aur, D., and Jog, M. S. Models of Brain Computation. In NEUROELECTRO-DYNAMICS: UNDERSTANDING THE BRAIN LANGUAGE, vol. 74 of Biomed-ical and Health Research. 2010, pp. 95–166.

[38] Baez, J., and Stay, M. Algorithmic thermodynamics. MATHEMATICALSTRUCTURES IN COMPUTER SCIENCE 22, 5, SI (OCT 2012), 771–787.

[39] Bailey, D. H., Barrio, R., and Borwein, J. M. High-precision computation:Mathematical physics and dynamics. APPLIED MATHEMATICS AND COMPU-TATION 218, 20 (JUN 15 2012), 10106–10121.

[40] Bailey, D. H., and Borwein, J. Pi Day Is Upon Us Again and We Still Do NotKnow if Pi Is Normal. AMERICAN MATHEMATICAL MONTHLY 121, 3 (MAR2014), 191–206.

[41] Bailey, D. H., and Borwein, J. M. Nonnormality of Stoneham constants.RAMANUJAN JOURNAL 29, 1-3 (DEC 2012), 409–422.

[42] Bailey, D. H., Borwein, J. M., Calude, C. S., Dinneen, M. J., Du-mitrescu, M., and Yee, A. An Empirical Approach to the Normality of pi.EXPERIMENTAL MATHEMATICS 21, 4 (2012), 375–384.

4

[43] Bailly, F., and Longo, G. Phenomenology of incompleteness: From formaldeductions to mathematics and physics. In DEDUCTION, COMPUTATION, EX-PERIMENT: EXPLORING THE EFFECTIVENESS OF PROOF (2008), Lupac-chini, R and Corsi, G, Ed., Univ Bologna, pp. 243–271. Workshop on Deduction,Computation, Experiment - Exploring the Effectiveness of Proof‘, Bologna, ITALY,APR 03-04, 2007.

[44] Bakshi, S., Zavalov, O., Halamek, J., Privman, V., and Katz, E. Mod-ularity of Biochemical Filtering for Inducing Sigmoid Response in Both Inputs inan Enzymatic AND Gate. JOURNAL OF PHYSICAL CHEMISTRY B 117, 34(AUG 29 2013), 9857–9865.

[45] Balanescu, T., Gheorghe, M., Holcombe, M., and Ipate, F. EilenbergP systems. In MEMBRANE COMPUTING (2003), Paun, G and Rozenberg, Gand Salomaa, A and Zandron, C, Ed., vol. 2597 of LECTURE NOTES IN COM-PUTER SCIENCE, pp. 43–57. International Workshop on Membrane Computing,CURTEA DE ARGES, ROMANIA, AUG 19-23, 2002.

[46] Banatre, J. P., Fradet, P., and Radenac, Y. Generalised multisets forchemical programming. MATHEMATICAL STRUCTURES IN COMPUTER SCI-ENCE 16, 4 (AUG 2006), 557–580. 1st International Workshop on Developmentsin Computational Models (DCM), Lisbon, PORTUGAL, JUL 10, 2005.

[47] Barbagallo, S., Consoli, S., Pappalardo, N., Greco, S., and Zimbone,S. Discovering reservoir operating rules by a Rough Set approach. WATER RE-SOURCES MANAGEMENT 20, 1 (FEB 2006), 19–36.

[48] Barbuti, R., Maggiolo-Schettini, A., Milazzo, P., and Tini, S. Mem-brane Systems Working in Generating and Accepting Modes: Expressiveness andEncodings. In MEMBRANE COMPUTING (2010), Gheorghe, M and Hinze, Tand Paun, G and Rozenberg, G and Salomaa, A, Ed., vol. 6501 of Lecture Notesin Computer Science, pp. 103–118. 11th International Conference on MembraneComputing, Jena, GERMANY, AUG 24-27, 2010.

[49] Barmpalias, G. ALGORITHMIC RANDOMNESS AND MEASURES OF COM-PLEXITY. BULLETIN OF SYMBOLIC LOGIC 19, 3 (SEP 2013), 318–350.

[50] Barmpalias, G., Brodhead, P., Cenzer, D., Dashti, S., and Weber, R.Algorithmic randomness of closed sets. JOURNAL OF LOGIC AND COMPU-TATION 17, 6 (DEC 2007), 1041–1062. Conference on Logical Approaches toComputational Barriers, Univ Wales Swansea, Swansea, WALES, JUL, 2006.

[51] Barmpalias, G., and Dowe, D. L. Universality probability of a prefix-freemachine. PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES 370, 1971, SI(JUL 28 2012), 3488–3511.

[52] Barmpalias, G., and Downey, R. G. EXACT PAIRS FOR THE IDEAL OFTHE K-TRIVIAL SEQUENCES IN THE TURING DEGREES. JOURNAL OFSYMBOLIC LOGIC 79, 3 (SEP 2014), 676–692.

5

[53] Barmpalias, G., Hoelzl, R., Lewis, A. E. M., and Merkle, W. Analoguesof Chaitin’s Omega in the computably enumerable sets. INFORMATION PRO-CESSING LETTERS 113, 5-6 (MAR 2013), 171–178.

[54] Barmpalias, G., and Lewis, A. The ibT degrees of computably enumerablesets are not dense. ANNALS OF PURE AND APPLIED LOGIC 141, 1-2 (AUG2006), 51–60.

[55] Barmpalias, G., and Li, A. Kolmogorov complexity and computably enumer-able sets. ANNALS OF PURE AND APPLIED LOGIC 164, 12, SI (DEC 2013),1187–1200.

[56] Barnett, N. S., and Dragomir, S. S. Some remarks on the noiseless cod-ing theorem. In Inequality Theory and Applications, Vol 4 (2007), Kim, JK andDragomir, SS, Ed., vol. 4 of Inequality Theory and Applications, Kyungnam Univ,Inst Basic Sci Res; GNU Res, Inst Natl Sci; Korean Math Soc; Nova Sci Publish-ers, pp. 11–14. 8th International Conference on Nonlinear Functional Analysis andApplications, Gyeongsang Natl Univ, Chinju, SOUTH KOREA, AUG 09-13, 2004.

[57] Barnsley, M. F., and Lesniak, K. The Chaos Game on a General IteratedFunction System from a Topological Point of View. INTERNATIONAL JOURNALOF BIFURCATION AND CHAOS 24, 11 (NOV 2014).

[58] Basic, B. ON “VERY PALINDROMIC” SEQUENCES. JOURNAL OF THEKOREAN MATHEMATICAL SOCIETY 52, 4 (JUL 2015), 765–780.

[59] Becher, V., Daicz, S., and Chaitin, G. A highly random number. In COMBI-NATORICS, COMPUTABILITY AND LOGIC (2001), Calude, CS and Dinneen,MJ and Sburlan, S, Ed., DISCRETE MATHEMATICS AND THEORETICALCOMPUTER SCIENCE (SERIES), Fac Math & Comp Sci; Ovidius Univ; UnivAuckland, Ctr Discrete Math & Theoret Sci, pp. 55–68. 3rd International Con-ference on Discrete Mathematics and Theoretical Computer Science (DMTCS 01),CONSTANTA, ROMANIA, 2001.

[60] Becher, V., Figueira, S., Grigorieff, S., and Miller, J. S. Randomnessand halting probabilities. JOURNAL OF SYMBOLIC LOGIC 71, 4 (DEC 2006),1411–1430.

[61] Becher, V., and Grigorieff, S. Random reals a la Chaitin with or withoutprefix-freeness. THEORETICAL COMPUTER SCIENCE 385, 1-3 (OCT 15 2007),193–201.

[62] Becher, V., and Heiber, P. A. A linearly computable measure of string com-plexity. THEORETICAL COMPUTER SCIENCE 438 (JUN 22 2012), 62–73.

[63] Bechmann, M., Sebald, A., and Stepney, S. Boolean Logic Gate Design Prin-ciples in Unconventional Computers: an NMR Case Study. INTERNATIONALJOURNAL OF UNCONVENTIONAL COMPUTING 8, 2 (2012), 139–159.

[64] Beggs, E., Costa, J. F., Loff, B., and Tucker, J. V. Oracles and adviceas measurements. In UNCONVENTIONAL COMPUTATION, PROCEEDINGS(2008), Calude, CS and Costa, JF and Freund, R and Oswald, M and Rozenberg,

6

G, Ed., vol. 5204 of LECTURE NOTES IN COMPUTER SCIENCE, EATCS;Vienna Univ Technol; Ctr Discrete Math & Theoret Comp Sci, pp. 33–50. 7th In-ternational Conference on Unconventional Computation, Vienna, AUSTRIA, AUG25-28, 2008.

[65] Beggs, E. J., Costa, J. F., and Tucker, J. V. Axiomatizing physical ex-periments as oracles to algorithms. PHILOSOPHICAL TRANSACTIONS OFTHE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEER-ING SCIENCES 370, 1971, SI (JUL 28 2012), 3359–3384.

[66] Bel-Enguix, G., and Jimenez-Lopez, M. D. Dynamic meaning membranesystems: An application to the description of semantic change. FUNDAMENTAINFORMATICAE 76, 3 (MAR 2007), 219–237.

[67] Benatti, F., Oskouei, S. K., and Abad, A. S. D. Gacs quantum algorithmicentropy in infinite dimensional Hilbert spaces. JOURNAL OF MATHEMATICALPHYSICS 55, 8 (AUG 2014).

[68] Bergeron, A., and Hamel, S. Fast implementations of automata computations.In IMPLEMENTATION AND APPLICATION OF AUTOMATA (2001), Yu, Sand Paun, A, Ed., vol. 2088 of LECTURE NOTES IN COMPUTER SCIENCE,EATCS; ACM SIGACT, pp. 47–56. 5th International Conference on Implemen-tation and Application of Automata, UNIV WESTERN ONTARIO, LONDON,CANADA, JUL 24-25, 2000.

[69] Bienvenu, L., Desfontaines, D., and Shen, A. What Percentage of ProgramsHalt? In Automata, Languages, and Programming, Pt I (2015), Halldorsson, MMand Iwama, K and Kobayashi, N and Speckmann, B, Ed., vol. 9134 of Lecture Notesin Computer Science, pp. 219–230. 42nd International Colloquium on Automata,Languages and Programming (ICALP), Kyoto, JAPAN, JUL 06-10, 2015.

[70] Bienvenu, L., Doty, D., and Stephan, F. Constructive Dimension and TuringDegrees. THEORY OF COMPUTING SYSTEMS 45, 4 (NOV 2009), 740–755. 3rdComputability in Europe Conference 2007, Univ Siena, Siena, ITALY, 2007.

[71] Bienvenu, L., Romashchenko, A., Shen, A., Taveneaux, A., and Ver-meeren, S. The axiomatic power of Kolmogorov complexity. ANNALS OF PUREAND APPLIED LOGIC 165, 9, SI (SEP 2014), 1380–1402.

[72] Bienvenu, L., and Sablik, M. The dynamics of cellular automata in shift-invariant topologies. In Developments in Language Theory, Proceedings (2007),Harju, T and Karhumaki, J and Lepisto, A, Ed., vol. 4588 of LECTURE NOTESIN COMPUTER SCIENCE, Acak Finland; Finnish Cultural Fdn; Finnish AcadSci & Letters; Nokia Fdn; Turku Univ Fdn; Ctr Hotel; Univ Turku, Dept Math &Ctr Fundamentals Comp & Discrete Math, pp. 84–95. 11th International Confer-ence on Developments in Language Theory, Univ Turku, Turku, FINLAND, JUL03-06, 2007.

[73] Blanchard, F., Cervelle, J., and Formenti, E. Periodicity and transitivityfor cellular automata in Besicovitch topologies. In MATHEMATICAL FOUN-DATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS (2003), Rovan, Band Vojtas, P, Ed., vol. 2747 of LECTURE NOTES IN COMPUTER SCIENCE,

7

Slovak Soc Comp Sci; Comenius Univ, Fac Math, Phys & Informat, pp. 228–238.28th International Symposium on Mathematical Foundations of Computer Science,BRATISLAVA, SLOVAKIA, AUG 25-29, 2003.

[74] Bocharova, V., MacVittie, K., Chinnapareddy, S., Halamek, J., Priv-man, V., and Katz, E. Realization of Associative Memory in an EnzymaticProcess: Toward Biomolecular Networks with Learning and Unlearning Function-alities. JOURNAL OF PHYSICAL CHEMISTRY LETTERS 3, 10 (MAY 17 2012),1234–1237.

[75] Bocharova, V., Zavalov, O., MacVittie, K., Arugula, M. A., Guz, N. V.,Dokukin, M. E., Halamek, J., Sokolov, I., Privman, V., and Katz, E.A biochemical logic approach to biomarker-activated drug release. JOURNAL OFMATERIALS CHEMISTRY 22, 37 (2012), 19709–19717.

[76] Borwein, J. M. The Future of Mathematics 1965 to 2065. In CENTURY OFADVANCING MATHEMATICS, Kennedy, SF, Ed. 2015, pp. 313–329.

[77] Boschetti, F., and Gray, R. A Turing Test for Emergence. In ADVANCESIN APPLIED SELF-ORGANIZING SYSTEMS, Prokopenko, M, Ed., AdvancedInformation and Knowledge Processing. 2008, pp. 349–364.

[78] BRIDGES, D. CONSTRUCTIVE MATHEMATICS AND UNBOUNDED OP-ERATORS - A REPLY TO HELLMAN. JOURNAL OF PHILOSOPHICALLOGIC 24, 5 (OCT 1995), 549–561.

[79] BRIDGES, D., and CALUDE, C. ON RECURSIVE BOUNDS FOR THEEXCEPTIONAL VALUES IN SPEED-UP. THEORETICAL COMPUTER SCI-ENCE 132, 1-2 (SEP 26 1994), 387–394.

[80] Bridges, D., Ishihara, H., Mines, R., Richman, F., Schuster, P., andVita, L. Almost locatedness in uniform spaces. CZECHOSLOVAK MATHE-MATICAL JOURNAL 57, 1 (2007), 1–12.

[81] Bridges, D., Schuster, P., and Vita, L. Apartness, topology, and uniformity:a constructive view. MATHEMATICAL LOGIC QUARTERLY 48, 1 (2002), 16–28. Dagstuhl Seminar on Computability and Complexity in Analysis, SCHLOSSDAGSTUHL, GERMANY, NOV 11-16, 2001.

[82] Brown, S. R. Emergence in the central nervous system. COGNITIVE NEURO-DYNAMICS 7, 3 (JUN 2013), 173–195.

[83] Brukner, C. Quantum experiments can test mathematical undecidability. In UN-CONVENTIONAL COMPUTATION, PROCEEDINGS (2008), Calude, CS andCosta, JF and Freund, R and Oswald, M and Rozenberg, G, Ed., vol. 5204 ofLecture Notes in Computer Science, EATCS; Vienna Univ Technol; Ctr DiscreteMath & Theoret Comp Sci, pp. 1–5. 7th International Conference on Uncon-ventional Computation/International Workshop on Computing with Biomolecules,Vienna, AUSTRIA, AUG 25-28, 2008.

[84] Brunet, O. A priori knowledge and the Kochen-Specker theorem. PHYSICSLETTERS A 365, 1-2 (MAY 21 2007), 39–43.

8

[85] Buhagiar, D., Chetcuti, E., and Dvurecenskij, A. On Gleason’s Theoremwithout Gleason. FOUNDATIONS OF PHYSICS 39, 6 (JUN 2009), 550–558.

[86] Burgin, M. Measuring Power of Algorithms, Computer Programs and Informa-tion Automata. In MEASURING POWER OF ALGORITHMS, COMPUTERPROGRAMS AND INFORMATION AUTOMATA. 2010, pp. 1–347.

[87] Burgin, M., Calude, C. S., and Calude, E. INDUCTIVE COMPLEXITYMEASURES FOR MATHEMATICAL PROBLEMS. INTERNATIONAL JOUR-NAL OF FOUNDATIONS OF COMPUTER SCIENCE 24, 4 (JUN 2013), 487–500.

[88] Busi, N. Causality in membrane systems. In MEMBRANE COMPUTING (2007),Eleftherakis, G and Kefalas, P and Paun, G and Rozenberg, G and Salomaa, A,Ed., vol. 4860 of Lecture Notes in Computer Science, pp. 160–171. 8th InternationalWorkshop on Membrane Computing, Thessaloniki, GREECE, JUN 25-28, 2007.

[89] Busi, N. Using well-structured transition systems to decide divergence for catalyticP systems. THEORETICAL COMPUTER SCIENCE 372, 2-3 (MAR 15 2007),125–135. 4th Brainstorming Week on Membrane Computing, Seville, SPAIN, JAN30-FEB 03, 2006.

[90] Calu, D. J., Stalnaker, T. A., Franz, T. M., Singh, T., Shaham, Y., andSchoenbaum, G. Withdrawal from cocaine self-administration produces long-lasting deficits in orbitofrontal-dependent reversal learning in rats. LEARNING &MEMORY 14, 5 (MAY 2007), 325–328.

[91] CALUDE, C. METRIZABILITY OF FREE MONOIDS. DISCRETE MATHE-MATICS 15, 4 (1976), 307–310.

[92] CALUDE, C. DARBOUX PROPERTY AND PRIMITIVE RECURSIVEFUNCTIONS. REVUE ROUMAINE DE MATHEMATIQUES PURES ET AP-PLIQUEES 26, 9 (1981), 1187–1192.

[93] CALUDE, C. NOTE ON A HIERARCHY OF PRIMITIVE RECURSIVEFUNCTIONS. REVUE ROUMAINE DE MATHEMATIQUES PURES ET AP-PLIQUEES 27, 9 (1982), 935–936.

[94] CALUDE, C. SUPER-EXPONENTIALS NONPRIMITIVE RECURSIVE, BUTRUDIMENTARY. INFORMATION PROCESSING LETTERS 25, 5 (JUL 101987), 311–315.

[95] CALUDE, C. RELATIVIZED TOPOLOGICAL SIZE OF SETS OF PARTIALRECURSIVE FUNCTIONS. THEORETICAL COMPUTER SCIENCE 87, 2(SEP 23 1991), 347–352.

[96] Calude, C., Calude, E., Svozil, K., and Yu, S. Physical versus computa-tional complementarity .1. INTERNATIONAL JOURNAL OF THEORETICALPHYSICS 36, 7 (JUL 1997), 1495–1523.

[97] CALUDE, C., and CAMPEANU, C. NOTE ON THE TOPOLOGICAL-STRUCTURE OF RANDOM STRINGS. THEORETICAL COMPUTER SCI-ENCE 112, 2 (MAY 10 1993), 383–390.

9

[98] CALUDE, C., and CHITESCU, I. STRONG NON-COMPUTABILITY OFRANDOM STRINGS. INTERNATIONAL JOURNAL OF COMPUTER MATH-EMATICS 11, 1 (1982), 43–45.

[99] CALUDE, C., and CHITESCU, I. ON REPRESENTABILITY OF P-MARTIN-LOF TESTS. KYBERNETIKA 19, 1 (1983), 42–47.

[100] CALUDE, C., and CHITESCU, I. REPRESENTABILITY OF RECURSIVEMARTINLOF,P. TESTS. KYBERNETIKA 19, 6 (1983), 526–536.

[101] CALUDE, C., and CHITESCU, I. A COMBINATORIAL CHARACTERIZA-TION OF SEQUENTIAL MARTINLOF,P TESTS. INTERNATIONAL JOUR-NAL OF COMPUTER MATHEMATICS 17, 1 (1985), 53–64.

[102] CALUDE, C., and CHITESCU, I. QUALITATIVE PROPERTIES OFMARTIN-LOF,P. RANDOM SEQUENCES. BOLLETTINO DELLA UNIONEMATEMATICA ITALIANA 3B, 1 (MAR 1989), 229–240.

[103] CALUDE, C., and CHITESCU, I. UPPER LIMITATION OF KOL-MOGOROV COMPLEXITY AND UNIVERSAL MARTINLOF,P. TESTS.JOURNAL OF COMPUTATIONAL MATHEMATICS 7, 1 (JAN 1989), 61–70.

[104] CALUDE, C., and ISTRATE, G. DETERMINING AND STATIONARY SETSFOR SOME CLASSES OF PARTIAL RECURSIVE FUNCTIONS. THEORETI-CAL COMPUTER SCIENCE 82, 1 (MAY 22 1991), 151–155.

[105] CALUDE, C., ISTRATE, G., and ZIMAND, M. RECURSIVE BAIRE CLAS-SIFICATION AND SPEEDABLE FUNCTIONS. ZEITSCHRIFT FUR MATH-EMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK 38, 2 (1992),169–178.

[106] CALUDE, C., JURGENSEN, H., and ZIMAND, M. IS INDEPENDENCEAN EXCEPTION. APPLIED MATHEMATICS AND COMPUTATION 66, 1(NOV 1994), 63–76.

[107] CALUDE, C., and SANTEAN, L. ON A THEOREM OF ASSER,GUNTER.ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DERMATHEMATIK 36, 2 (1990), 143–147.

[108] Calude, C., Staiger, L., and Stay, M. Cristian Calude, Ludwig Staiger andMichael Stay on - HALTING AND NON-HALTING TURING COMPUTATIONS.In ALAN TURING: HIS WORK AND IMPACT, Cooper, SB and VanLeeuwen,J, Ed. 2013, pp. 105–109.

[109] CALUDE, C., and TATARAM, M. UNIVERSAL SEQUENCES OF PRIM-ITIVE RECURSIVE FUNCTIONS. REVUE ROUMAINE DE MATHEMA-TIQUES PURES ET APPLIQUEES 28, 5 (1983), 381–389.

[110] CALUDE, C., and VAIDA, D. EHRENFEUCHT TEST SET THEOREMAND HILBERT BASIS THEOREM - A CONSTRUCTIVE GLIMPSE. LEC-TURE NOTES IN COMPUTER SCIENCE 379 (1989), 177–184.

10

[111] CALUDE, C., and ZIMAND, M. A RELATION BETWEEN CORRECTNESSAND RANDOMNESS IN THE COMPUTATION OF PROBABILISTIC ALGO-RITHMS. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 16,1 (1984), 47–53.

[112] Calude, C., and Zimand, M. Effective category and measure in abstract com-plexity theory. THEORETICAL COMPUTER SCIENCE 154, 2 (FEB 5 1996),307–327.

[113] Calude, C. S., and Calude, E. Algorithmic Complexity of Mathematical Prob-lems: An Overview of Results and Open Problems. INTERNATIONAL JOURNALOF UNCONVENTIONAL COMPUTING 9, 3-4 (2013), 327–343.

[114] Calude, C. S., Calude, E., and Queen, M. S. The complexity of Euler’sinteger partition theorem. THEORETICAL COMPUTER SCIENCE 454 (OCT5 2012), 72–80.

[115] Calude, C. S., and Cooper, S. B. Introduction: computability of the physical.MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE 22, 5, SI (OCT2012), 723–728.

[116] Calude, C. S., and Desfontaines, D. Anytime Algorithms for Non-EndingComputations. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COM-PUTER SCIENCE 26, 4 (JUN 2015), 465–475.

[117] Calude, C. S., and Desfontaines, D. Universality and Almost Decidability.FUNDAMENTA INFORMATICAE 138, 1-2, SI (2015), 77–84.

[118] Calude, C. S., and Gheorghe, M. Formal Models - Computability, Complexity,Applications Preface. FUNDAMENTA INFORMATICAE 131, 3-4 (2014), I–IV.

[119] Calude, C. S., and Lewis, J. P. Is there a universal image generator? AP-PLIED MATHEMATICS AND COMPUTATION 218, 16, SI (APR 15 2012),8151–8159. International Workshop on Infinite and Infinitesimal in Mathemat-ics, Computing and Natural Sciences (INFINITY), Cetraro, ITALY, MAY 17-21,2010.

[120] Calude, C. S., Staiger, L., and Stephan, F. Finite State IncompressibleInfinite Sequences. In THEORY AND APPLICATIONS OF MODELS OF COM-PUTATION (TAMC 2014) (2014), Gopal, TV and Agrawal, M and Li, A andCooper, SB, Ed., vol. 8402 of Lecture Notes in Computer Science, Anna Univ, CollEngn Guindy, Vivekananda Auditorium, pp. 50–66. 11th Annual Conference onTheory and Applications of Models of Computation (TAMC), Chennai, INDIA,APR 11-13, 2014.

[121] Calude, C. S., and Svozil, K. Is Feasibility in Physics Limited by FantasyAlone? In COMPUTABLE UNIVERSE: UNDERSTANDING AND EXPLORINGNATURE AS COMPUTATION, Zenil, H, Ed. 2013, pp. 539–547.

[122] Calude, C. S., and Tadaki, K. Spectral Representation of Some ComputablyEnumerable Sets with an Application to Quantum Provability. In UNCONVEN-TIONAL COMPUTATION AND NATURAL COMPUTATION (2013), Mauri, G

11

and Dennunzio, A and Manzoni, L and Porreca, AE, Ed., vol. 7956 of Lecture Notesin Computer Science, Univ Milano Bicocca; European Assoc Theoret Comp Sci,Italian Chapter; Micron Fdn; Dipartimento Informatica, Sistemistica & Comuni-cazione, pp. 43–54. 12th International Conference on Unconventional Computationand Natural Computation (UCNC), Milan, ITALY, JUL 01-05, 2013.

[123] Calude, C. S., Walter Meyerstein, F., and Salomaa, A. The Universeis Lawless or “Panton chrematon metron anthropon einai”. In COMPUTABLEUNIVERSE: UNDERSTANDING AND EXPLORING NATURE AS COMPUTA-TION, Zenil, H, Ed. 2013, pp. 525–537.

[124] Calude, E. Fermat’s last theorem and chaoticity. NATURAL COMPUTING 11,2, SI (JUN 2012), 241–245.

[125] Calude, E. The Complexity of Riemann’s Hypothesis. JOURNAL OFMULTIPLE-VALUED LOGIC AND SOFT COMPUTING 18, 3-4 (2012), 257–265.

[126] Calude, E., and Lipponen, M. Deterministic incomplete automats: Simulation,universality and complementarity. In UNCONVENTIONAL MODELS OF COM-PUTATION (1998), Calude, CS and Casti, J and Dinneen, MJ, Ed., SPRINGERSERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTERSCIENCE, Univ Auckland; Ctr Discrete Math & Theoret Comp Sci; Santa Fe Inst,pp. 131–149. 1st International Conference on Unconventional Models of Computa-tion (UMC 98), UNIV AUCKLAND, AUCKLAND, NEW ZEALAND, JAN 05-09,1998.

[127] Campeanu, C. DESCRIPTIONAL COMPLEXITY IN ENCODED BLUMSTATIC COMPLEXITY SPACES. INTERNATIONAL JOURNAL OF FOUN-DATIONS OF COMPUTER SCIENCE 25, 7, SI (NOV 2014), 917–932.

[128] Campeanu, C., and Paun, A. Computing beyond the turing limit using the Hsystems. In DNA COMPUTING (2005), Ferretti, C and Mauri, G and Zandron,C, Ed., vol. 3384 of LECTURE NOTES IN COMPUTER SCIENCE, Univ MilanoBicocca, Dept Informat; Brainspark plc Comerson; Etnoteam; European Commiss;STMicroelectronics, pp. 24–34. 10th International Workshop on DNA Computing(DNA10), Univ Milano Bicocca, Milan, ITALY, JUN 07-10, 2004.

[129] Capobianco, S., Guillon, P., and Kari, J. Surjective cellular automata farfrom the Garden of Eden. DISCRETE MATHEMATICS AND THEORETICALCOMPUTER SCIENCE 15, 3 (2013), 41–60.

[130] Cardelli, L., and Mardare, R. The Measurable Space of Stochastic Processes.FUNDAMENTA INFORMATICAE 131, 3-4 (2014), 351–371.

[131] Carsetti, A. Life, cognition and metabiology. COGNITIVE PROCESSING 15,4 (NOV 2014), 423–434.

[132] Casasnovas, J., and Vicente Riera, J. Aggregation of Bounded Fuzzy NaturalNumber-Valued Multisets. In MODELING DECISIONS FOR ARTIFICIAL IN-TELLIGENCE (MDAI) (2010), Torra, V and Narukawa, Y and Daumas, M, Ed.,vol. 6408 of Lecture Notes in Artificial Intelligence, pp. 67–78. 7th International

12

Conference on Modeling Decisions for Artificial Intelligence (MDAI), Perpignan,FRANCE, OCT 27-29, 2010.

[133] Case, J., Jain, S., Seah, S., and Stephan, F. AUTOMATIC FUNCTIONS,LINEAR TIME AND LEARNING. LOGICAL METHODS IN COMPUTER SCI-ENCE 9, 3 (2013).

[134] Castellanos, J., Paun, G., and Rodriguez-Paton, A. Computing withmembranes: P systems with Worm-Objects. In SPIRE 2000: SEVENTH INTER-NATIONAL SYMPOSIUM ON STRING PROCESSING AND INFORMATIONRETRIEVAL - PROCEEDINGS (2000), Cyted-Amyri Res Project; IEEE, pp. 65–74. 7th International Symposium on String Processing and Information Retrieval(SPIRE 2000), LA CORUNA, SPAIN, SEP 27-29, 2000.

[135] Cavaliere, M., Freund, R., Oswald, M., and Sburlan, D. Multiset randomcontext grammars, checkers, and transducers. THEORETICAL COMPUTER SCI-ENCE 372, 2-3 (MAR 15 2007), 136–151. 4th Brainstorming Week on MembraneComputing, Seville, SPAIN, JAN 30-FEB 03, 2006.

[136] Cervelle, J., Durand, B., and Formenti, E. Algorithmic information the-ory and cellular automata dynamics. In MATHEMATICAL FOUNDATIONS OFCOMPUTER SCIENCE 2001 (2001), Sgall, J and Pultr, A and Kolman, P, Ed.,vol. 2136 of LECTURE NOTES IN COMPUTER SCIENCE, Acad Sci Czech Re-public, Math Inst; Inst Theoret Comp Sci; Inst Comp Sci; Act M Agcy, pp. 248–259. 26th International Symposium on Mathematical Foundations of ComputerScience, MARIANSKE LAZNE, CZECH REPUBLIC, AUG 27-31, 2001.

[137] Chaitin, G. Probability and program-size for functions. FUNDAMENTA IN-FORMATICAE 71, 4 (JUN 2006), 367–370.

[138] Chaitin, G. An algebraic characterization of the halting probability. FUNDA-MENTA INFORMATICAE 79, 1-2 (2007), 17–23.

[139] Chaitin, G. How much information can there be in a real number? INTER-NATIONAL JOURNAL OF BIFURCATION AND CHAOS 17, 6 (JUN 2007),1933–1935.

[140] Chaitin, G. Life as Evolving Software. In COMPUTABLE UNIVERSE: UN-DERSTANDING AND EXPLORING NATURE AS COMPUTATION, Zenil, H,Ed. 2013, pp. 277–302.

[141] Chaplin, J. C., Krasnogor, N., and Russell, N. A. Photochromic molecularimplementations of universal computation. BIOSYSTEMS 126 (DEC 2014), 12–26.

[142] Chatelin, F. A computational journey into the mind. NATURAL COMPUTING11, 1, SI (MAR 2012), 67–79.

[143] Chen, S., Ma, B., and Zhang, K. On the similarity metric and the distancemetric. THEORETICAL COMPUTER SCIENCE 410, 24-25 (MAY 28 2009),2365–2376.

13

[144] Chevalier, G., Dvurecenskij, A., and Svozil, K. Piron’s and Bell’s geomet-ric Lemmas and Gleason’s theorem. FOUNDATIONS OF PHYSICS 30, 10 (OCT2000), 1737–1755.

[145] Chitescu, I., and Plavitu, A. Sugeno Measures on the Code Space. ROMA-NIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY 17, 3(2014), 289–301.

[146] Cho, F., and Squier, R. K. Religion as a Complex and Dynamic System.JOURNAL OF THE AMERICAN ACADEMY OF RELIGION 81, 2 (JUN 2013),357–398.

[147] Chong, C. T., Hoi, G., Stephan, F., and Turetsky, D. PARTIAL FUNC-TIONS AND DOMINATION. LOGICAL METHODS IN COMPUTER SCIENCE11, 3 (2015).

[148] Chown, M. The omega man - He shattered mathematics with a single number.And that was just for starters. NEW SCIENTIST 169, 2281 (MAR 10 2001),28–31.

[149] Ciobanu, G., and Rudeanu, S. Final and sequential behaviours of M-automata.ACTA INFORMATICA 46, 5 (AUG 2009), 361–374.

[150] Ciric, M., Ignjatovic, J., Basic, M., and Jancic, I. Nondeterministic au-tomata: Equivalence, bisimulations, and uniform relations. INFORMATION SCI-ENCES 261 (MAR 10 2014), 185–218.

[151] Ciric, M., Ignjatovic, J., Damljanovic, N., and Basic, M. Bisimulationsfor fuzzy automata. FUZZY SETS AND SYSTEMS 186, 1 (JAN 1 2012), 100–139.

[152] Ciric, M., Stamenkovic, A., Ignjatovic, J., and Petkovic, T. Factor-ization of fuzzy automate. In Fundamentals of Computation Theory, Proceedings(2007), CsuhajVarju, E and Esik, Z, Ed., vol. 4639 of LECTURE NOTES IN COM-PUTER SCIENCE, Hungarian Acad Sci, Comp & Automat Res Inst; Univ Szeged,Inst Comp Sci, pp. 213–225. 16th International Symposium on Fundamentals ofComputation Theory, Budapest, HUNGARY, AUG 27-30, 2007.

[153] Clark, G., and Teutsch, J. Maximizing T-complexity. FUNDAMENTA IN-FORMATICAE 139, 1 (2015), 1–19.

[154] Cockshott, P., and Michaelson, G. Are there new models of computation?Reply to Wegner and Eberbach. COMPUTER JOURNAL 50, 2 (MAR 2007),232–247.

[155] Cooper, S. B. Incomputability, Emergence and the Turing Universe. In CAUSAL-ITY, MEANINGFUL COMPLEXITY AND EMBODIED COGNITION, Carsetti,A, Ed., vol. 46 of Theory and Decision Library Series A Philosophy and Method-ology of the Social Sciences. 2010, pp. 135–153.

[156] Cooper, S. B. The Computational Roots of Hyper-Causality. INTERNATIONALJOURNAL OF UNCONVENTIONAL COMPUTING 6, 5, SI (2010), 437–449. 8thInternational Conference on Unconventional Computation, Ponta Delgada, POR-TUGAL, SEP 07-11, 2009.

14

[157] Cooper, S. B. Turing’s Titanic Machine? COMMUNICATIONS OF THE ACM55, 3 (MAR 2012), 74–83.

[158] Cooper, S. B. The Mathematician’s Bias - and the Return to Embodied Compu-tation. In COMPUTABLE UNIVERSE: UNDERSTANDING AND EXPLORINGNATURE AS COMPUTATION, Zenil, H, Ed. 2013, pp. 125–142.

[159] Copeland, B. Narrow versus wide mechanism: Including a re-examination ofTuring’s views on the mind-machine issue. JOURNAL OF PHILOSOPHY 97, 1(JAN 2000), 5–32.

[160] Copeland, B., and Sylvan, R. Beyond the universal Turing machine. AUS-TRALASIAN JOURNAL OF PHILOSOPHY 77, 1 (MAR 1999), 46–67.

[161] Copeland, B. J., and Shagrir, O. Physical computation: How general areGandy’s principles for mechanisms? MINDS AND MACHINES 17, 2 (SUM 2007),217–231.

[162] Copeland, B. J., and Shagrir, O. Do Accelerating Turing Machines Computethe Uncomputable? MINDS AND MACHINES 21, 2 (MAY 2011), 221–239.

[163] Cordy, B., and Salomaa, K. On the existence of regular approximations. THE-ORETICAL COMPUTER SCIENCE 387, 2 (NOV 12 2007), 125–135. 8th Inter-national Workshop on Descriptional Complexity of Forman Systems, Las Cruces,NM, JUN 21-23, 2006.

[164] Cornelis, C., Jensen, R., Hurtado, G., and Slezak, D. Attribute selectionwith fuzzy decision reducts. INFORMATION SCIENCES 180, 2 (JAN 15 2010),209–224.

[165] Corolli, L., Maj, C., Marini, F., Besozzi, D., and Mauri, G. An ex-cursion in reaction systems: From computer science to biology. THEORETICALCOMPUTER SCIENCE 454 (OCT 5 2012), 95–108.

[166] Crolard, T., Polonowski, E., and Valarcher, P. Extending the LoopLanguage with Higher-Order Procedural Variables. ACM TRANSACTIONS ONCOMPUTATIONAL LOGIC 10, 4 (AUG 2009).

[167] Csuhaj-Varju, E., Di Nola, A., Paun, G., Perez-Jimenez, M. J., andVaszil, G. Editing configurations of P systems. FUNDAMENTA INFORMATI-CAE 82, 1-2 (2008), 29–46.

[168] CsuhajVarju, E., Kari, L., and Paun, G. Test tube distributed systems basedon splicing. COMPUTERS AND ARTIFICIAL INTELLIGENCE 15, 2-3 (1996),211–232.

[169] D’Abramo, G. Asymptotic behavior and halting probability of Turing Machines.CHAOS SOLITONS & FRACTALS 37, 1 (JUL 2008), 210–214.

[170] Dal Negro, L., and Boriskina, S. V. Deterministic aperiodic nanostructuresfor photonics and plasmonics applications. LASER & PHOTONICS REVIEWS 6,2 (MAR 2012), 178–218.

15

[171] Dal Negro, L., Forestiere, C., Lawrence, N., Lee, S., Trevino, J., andWalsh, G. Aperiodic Order in Nanoplasmonics. In PLASMONICS: THEORYAND APPLICATIONS, Shahbazyan, TV and Stockman, MI, Ed., vol. 15 of Chal-lenges and Advances in Computational Chemistry and Physics. 2013, pp. 329–377.

[172] Dal Negro, L., Lawrence, N., Trevino, J., and Walsh, G. Aperiodic Orderfor Nanophotonics. In OPTICS OF APERIODIC STRUCTURES: FUNDAMEN-TALS AND DEVICE APPLICATIONS, DalNegro, L, Ed. 2014, pp. 1–56.

[173] Dassow, J., Paun, G., Thierrin, G., and Yu, S. Tree-systems of morphisms.ACTA INFORMATICA 38, 2 (NOV 2001), 131–153.

[174] Davie, G. Recursive events in random sequences. ARCHIVE FOR MATHEMAT-ICAL LOGIC 40, 8 (NOV 2001), 629–638.

[175] Davie, G. Kolmogorov complexity and noncomputability. MATHEMATICALLOGIC QUARTERLY 48, 4 (2002), 574–580.

[176] Davie, G., and Fouche, W. L. On the computability of a construction of Brow-nian motion. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE 23,6 (DEC 2013), 1257–1265.

[177] Delahaye, J.-P., and Zenil, H. Numerical evaluation of algorithmic complexityfor short strings: A glance into the innermost structure of randomness. APPLIEDMATHEMATICS AND COMPUTATION 219, 1 (SEP 15 2012), 63–77. 3rd In-ternational Workshop on Physics and Computation, EGYPT, AUG 30-SEP 06,2010.

[178] Devine, S. The Insights of Algorithmic Entropy. ENTROPY 11, 1 (MAR 2009),85–110. Conference on Concepts of Entropy and Their Applications, Melbourne,AUSTRALIA, NOV 26-DEC 12, 2007.

[179] Diacu, F. The solution of the n-body problem. MATHEMATICAL INTELLI-GENCER 18, 3 (SUM 1996), 66–70.

[180] Dickhaut, J., Lunawat, R., Pronin, K., and Stecher, J. Decision makingand trade without probabilities. ECONOMIC THEORY 48, 2-3 (OCT 2011), 275–288.

[181] Dinneen, M. J., Kim, Y.-B., and Nicolescu, R. Synchronization in P Modules.In UNCONVENTIONAL COMPUTATION, PROCEEDINGS (2010), Calude, CSand Hagiya, M and Morita, K and Rozenberg, G and Timmis, J, Ed., vol. 6079 ofLecture Notes in Computer Science, EATCS; Acad Europaea; Ctr Discrete Math& Theoret Comp Sci, pp. 32–44. 9th International Conference on UnconventionalComputation, Univ Tokyo, Hongo Campus, Tokyo, JAPAN, JUN 21-25, 2010.

[182] Dittrich, P., Ziegler, J., and Banzhaf, W. Artificial chemistries - A review.ARTIFICIAL LIFE 7, 3 (FAL 2001), 225–275.

[183] Downey, R., Hirschfeldt, D., and LaForte, G. Randomness and reducibil-ity. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001(2001), Sgall, J and Pultr, A and Kolman, P, Ed., vol. 2136 of LECTURE NOTESIN COMPUTER SCIENCE, Acad Sci Czech Republic, Math Inst; Inst Theoret

16

Comp Sci; Inst Comp Sci; Act M Agcy, pp. 316–327. 26th International Sympo-sium on Mathematical Foundations of Computer Science, MARIANSKE LAZNE,CZECH REPUBLIC, AUG 27-31, 2001.

[184] Downey, R., Hirschfeldt, D. R., and LaForte, G. Undecidability of thestructure of the Solovay degrees of c.e. reals. JOURNAL OF COMPUTER ANDSYSTEM SCIENCES 73, 5 (AUG 2007), 769–787.

[185] Downey, R., Hirschfeldt, D. R., Nies, A., and Terwijn, S. A. Calibratingrandomness. BULLETIN OF SYMBOLIC LOGIC 12, 3 (SEP 2006), 411–491.

[186] Downey, R., Merkle, W., and Reimann, J. Schnorr dimension. MATHE-MATICAL STRUCTURES IN COMPUTER SCIENCE 16, 5 (OCT 2006), 789–811. 1st Conference on Computability in Europe - New Computational Paradigms,Univ Amsterdam, Amsterdam, NETHERLANDS, JUN, 2005.

[187] Downey, R., and Terwijn, S. Computably enumerable reals and uniformlypresentable ideals. MATHEMATICAL LOGIC QUARTERLY 48, 1 (2002), 29–40. Dagstuhl Seminar on Computability and Complexity in Analysis, SCHLOSSDAGSTUHL, GERMANY, NOV 11-16, 2001.

[188] Downey, R. G., and Hirschfeldt, D. R. Algorithmic Randomness and Com-plexity. In ALGORITHMIC RANDOMNESS AND COMPLEXITY, Theory andApplications of Computability. 2010, pp. 401+.

[189] Dragomir, N., Dragomir, S., Pearce, C., and Sunde, J. Kraft’s numberand ideal word packing. In UNSOLVED PROBLEMS OF NOISE AND FLUC-TUATIONS (2000), Abbott, D and Kish, LB, Ed., vol. 511 of AIP CONFER-ENCE PROCEEDINGS, IEEE Electron Devoces Soc; Inst Phys; US Off NavalRes; USAF Res Labs; Ctr Biomed Engn, Adelaide; Natl Inst Theoret Phys; DeptInd Sci & Resources Australia; Defence Sci & Technol Org; Inst Engineers, Aus-tralia, pp. 347–352. 2nd International Conference on Unsolved Problems of Noiseand Fluctuations (UPoN 99), ADELAIDE, AUSTRALIA, JUL 12-15, 1999.

[190] Dubacq, J., Durand, B., and Formenti, E. Kolmogorov complexity andcellular automata classification. THEORETICAL COMPUTER SCIENCE 259,1-2 (MAY 28 2001), 271–285.

[191] Durand, A., Jones, N. D., Makowsky, J. A., and More, M. FIFTY YEARSOF THE SPECTRUM PROBLEM: SURVEY AND NEW RESULTS. BULLETINOF SYMBOLIC LOGIC 18, 4 (DEC 2012), 505–553.

[192] Durand, B., and Porrot, S. Comparison between the complexity of a func-tion and the complexity of its graph. In MATHEMATICAL FOUNDATIONS OFCOMPUTER SCIENCE 1998 (1998), Brim, L and Gruska, J and Zlatuska, J, Ed.,vol. 1450 of LECTURE NOTES IN COMPUTER SCIENCE, pp. 732–739. 23rdInternational Symposium on the Mathematical Foudations of Computer Science(MFCS 98), BRNO, CZECH REPUBLIC, AUG 24-28, 1998.

[193] Dyckhoff, R., and Negri, S. Decision methods for linearly ordered Heytingalgebras. ARCHIVE FOR MATHEMATICAL LOGIC 45, 4 (MAY 2006), 411–422.

17

[194] Emch, G. Probabilistic issues in statistical mechanics. STUDIES IN HISTORYAND PHILOSOPHY OF MODERN PHYSICS 36B, 2 (JUN 2005), 303–322. Con-ference on Philosophical and Foundational Issues in Statistical Physics, Utrecht,NETHERLANDS, NOV 28-30, 2003.

[195] Enguix, G. Preliminaries about some possible applications of P systems in lin-guistics. In MEMBRANE COMPUTING (2003), Paun, G and Rozenberg, G andSalomaa, A and Zandron, C, Ed., vol. 2597 of LECTURE NOTES IN COM-PUTER SCIENCE, pp. 74–89. International Workshop on Membrane Computing,CURTEA DE ARGES, ROMANIA, AUG 19-23, 2002.

[196] Esbelin, H., and More, M. Rudimentary relations and primitive recursion:A toolbox. THEORETICAL COMPUTER SCIENCE 193, 1-2 (FEB 28 1998),129–148.

[197] Estevez-Rams, E., Lora Serrano, R., Aragon Fernandez, B., andBrito Reyes, I. On the non-randomness of maximum Lempel Ziv complexitysequences of finite size. CHAOS 23, 2 (JUN 2013).

[198] Estevez-Rams, E., Lora-Serrano, R., Nunes, C. A. J., and Aragon-Fernandez, B. Lempel-Ziv complexity analysis of one dimensional cellular au-tomata. CHAOS 25, 12 (DEC 2015).

[199] Etesi, G. A Proof of the Geroch-Horowitz-Penrose Formulation of the Strong Cos-mic Censor Conjecture Motivated by Computability Theory. INTERNATIONALJOURNAL OF THEORETICAL PHYSICS 52, 3 (MAR 2013), 946–960.

[200] Ewert, W., Marks, II, R. J., Thompson, B. B., and Yu, A. EvolutionaryInversion of Swarm Emergence Using Disjunctive Combs Control. IEEE TRANS-ACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 43, 5 (SEP 2013),1063–1076.

[201] Fan, C.-M., Huang, C. C., and Yu, S. S. On n-power prefix languages. INTER-NATIONAL JOURNAL OF COMPUTER MATHEMATICS 85, 5 (MAY 2008),703–715.

[202] Farhadinia, B. Hesitant fuzzy set lexicographical ordering and its applicationto multi-attribute decision making. INFORMATION SCIENCES 327 (JAN 102016), 233–245.

[203] Farr, G. Cost-effectiveness of algorithms. DISCRETE MATHEMATICS ANDTHEORETICAL COMPUTER SCIENCE 17, 1 (2015), 201–218.

[204] Ferbus-Zanda, M., and Grigorieff, S. Kolmogorov Complexity in Perspec-tive Part I: Information Theory and Randomness. In CONSTRUCTIVITY ANDCOMPUTABILITY IN HISTORICAL AND PHILOSOPHICAL PERSPECTIVE(2014), Dubucs, J and Bourdeau, M, Ed., vol. 34 of Logic Epistemology and theUnity of Science, pp. 57–94. Meeting on Computability and Constructivity in His-torical and Philosophical Perspective, Ecole Normale Superieure, Paris, FRANCE,DEC 17-18, 2006.

[205] Figueira, S., and Nies, A. Feasible Analysis, Randomness, and Base Invariance.THEORY OF COMPUTING SYSTEMS 56, 3, SI (APR 2015), 439–464.

18

[206] Figueira, S., Stephan, F., and Wu, G. Randomness and universal machines.JOURNAL OF COMPLEXITY 22, 6 (DEC 2006), 738–751. 2nd InternationalConference on Computability and Complexity in Analysis, Kyoto Univ, Kyoto,JAPAN, AUG 25-29, 2005.

[207] Fiorini, R. A. How Random is Your Tomographic Noise? A Number TheoreticTransform (NTT) Approach. FUNDAMENTA INFORMATICAE 135, 1-2 (2014),135–170.

[208] Fiske, M. S. Quantum Random Active Element Machine. In UNCONVEN-TIONAL COMPUTATION AND NATURAL COMPUTATION (2013), Mauri,G and Dennunzio, A and Manzoni, L and Porreca, AE, Ed., vol. 7956 of Lec-ture Notes in Computer Science, Univ Milano Bicocca; European Assoc TheoretComp Sci, Italian Chapter; Micron Fdn; Dipartimento Informatica, Sistemistica& Comunicazione, pp. 252–254. 12th International Conference on UnconventionalComputation and Natural Computation (UCNC), Milan, ITALY, JUL 01-05, 2013.

[209] Flaminio, T., Godo, L., and Hosni, H. On the logical structure of de Finetti’snotion of event. JOURNAL OF APPLIED LOGIC 12, 3, SI (SEP 2014), 279–301.

[210] Fouche, W., Heidema, J., Jones, G., and Potgieter, P. H. Universal-ity and programmability of quantum computers. THEORETICAL COMPUTERSCIENCE 403, 1 (AUG 20 2008), 121–129.

[211] Fratto, B. E., Guz, N., and Katz, E. Biomolecular Computing Realized inParallel Flow Systems: Enzyme-Based Double Feynman Logic Gate. PARALLELPROCESSING LETTERS 25, 1, SI (MAR 2015).

[212] Fratto, B. E., and Katz, E. Reversible Logic Gates Based on Enzyme-Biocatalyzed Reactions and Realized in Flow Cells: A Modular Approach.CHEMPHYSCHEM 16, 7 (MAY 18 2015), 1405–1415.

[213] Fratto, B. E., Roby, L. J., Guz, N., and Katz, E. Enzyme-based logic gatesswitchable between OR, NXOR and NAND Boolean operations realized in a flowsystem. CHEMICAL COMMUNICATIONS 50, 81 (2014), 12043–12046.

[214] Fresco, N. A Critical Survey of Some Competing Accounts of Concrete DigitalComputation. In ALGORITHMIC PROBABILITY AND FRIENDS: BAYESIANPREDICTION AND ARTIFICIAL INTELLIGENCE (2013), Dowe, DL, Ed.,vol. 7070 of Lecture Notes in Computer Science, AF Off Sci Res; Monash Univ,Fac Informat Technol; Natl ICT Australia; Asian Off Aerosp Res & Dev, pp. 155–173. Ray Solomonoff 85th Memorial Conference, Monash Univ Clayton Campus,Melbourne, AUSTRALIA, NOV 30-DEC 02, 2011.

[215] Fresco, N., and Staines, P. J. A Revised Attack on Computational Ontology.MINDS AND MACHINES 24, 1, SI (FEB 2014), 101–122.

[216] Freund, R. Energy-controlled P systems. In MEMBRANE COMPUTING (2003),Paun, G and Rozenberg, G and Salomaa, A and Zandron, C, Ed., vol. 2597 of LEC-TURE NOTES IN COMPUTER SCIENCE, pp. 247–260. International Workshopon Membrane Computing, CURTEA DE ARGES, ROMANIA, AUG 19-23, 2002.

19

[217] Freund, R., Kari, L., Oswald, M., and Sosik, P. Computationally universalP systems without priorities: two catalysts are sufficient. THEORETICAL COM-PUTER SCIENCE 330, 2 (FEB 2 2005), 251–266. 4th International Conferenceon Electromagnetic Wave Interaction with Water and Moist Substances, Mat Res& Testing Inst, Weimar, GERMANY, MAY, 2001.

[218] Freund, R., Kari, L., and Paun, G. DNA computing based on splicing: Theexistence of universal computers. THEORY OF COMPUTING SYSTEMS 32, 1(JAN-FEB 1999), 69–112.

[219] Freund, R., and Paun, A. Membrane systems with symport/antiport rules:Universality results. In MEMBRANE COMPUTING (2003), Paun, G and Rozen-berg, G and Salomaa, A and Zandron, C, Ed., vol. 2597 of LECTURE NOTESIN COMPUTER SCIENCE, pp. 270–287. International Workshop on MembraneComputing, CURTEA DE ARGES, ROMANIA, AUG 19-23, 2002.

[220] Ganea, M. Epistemic Optimism. PHILOSOPHIA MATHEMATICA 16, 3 (OCT2008), 333–353.

[221] Ganz, R. E. The Decimal Expansion of pi Is Not Statistically Random. EXPER-IMENTAL MATHEMATICS 23, 2 (2014), 99–104.

[222] Garcia-Arnau, M., Manrique, D., Rodriguez-Paton, A., and Sosik, P.A P system and a constructive membrane-inspired DNA algorithm for solving theMaximum Clique Problem. BIOSYSTEMS 90, 3 (NOV-DEC 2007), 687–697.

[223] Garola, C. Objectivity versus nonobjectivity in quantum mechanics. FOUNDA-TIONS OF PHYSICS 30, 9 (SEP 2000), 1539–1565.

[224] Gauvrit, N., Zenil, H., Delahaye, J.-P., and Soler-Toscano, F. Al-gorithmic complexity for short binary strings applied to psychology: a primer.BEHAVIOR RESEARCH METHODS 46, 3 (SEP 2014), 732–744.

[225] Gdor, E., Katz, E., and Mandler, D. Biomolecular AND Logic Gate Basedon Immobilized Enzymes with Precise Spatial Separation Controlled by ScanningElectrochemical Microscopy. JOURNAL OF PHYSICAL CHEMISTRY B 117, 50(DEC 19 2013), 16058–16065.

[226] Gelenbe, E. Natural Computation. COMPUTER JOURNAL 55, 7 (JUL 2012),848–851.

[227] Georgiev, I. Continued fractions of primitive recursive real numbers. MATHE-MATICAL LOGIC QUARTERLY 61, 4-5 (AUG 2015), 288–306.

[228] Gepp, A., and Stocks, P. A review of procedures to evolve quantum algorithms.GENETIC PROGRAMMING AND EVOLVABLE MACHINES 10, 2 (JUN 2009),181–228.

[229] Gheorghe, M., and Paun, G. Computing by Self-Assembly: DNA Molecules,Polyominoes, Cells. In SYSTEMS SELF-ASSEMBLY: MULTIDISCIPLINARYSNAPSHOTS, Krasnogor, N and Gustafson, S and Pelta, DA and Verdegay, JL,Ed., vol. 5 of Studies in Multidisciplinarity. 2008, pp. 49–78.

20

[230] Gheorghe, M., and Stannett, M. Membrane system models for super-Turingparadigms. NATURAL COMPUTING 11, 2, SI (JUN 2012), 253–259.

[231] Golding, J. Ecce Homo Sexual: Ontology and Eros in the Age of Incompletenessand Entanglement. PARALLAX 20, 3, SI (2014), 217–230.

[232] Gorecka, J. N., Gorecki, J., and Igarashi, Y. One dimensional chemical sig-nal diode constructed with two nonexcitable barriers. JOURNAL OF PHYSICALCHEMISTRY A 111, 5 (FEB 8 2007), 885–889.

[233] Gorecki, J., Gizynski, K., Guzowski, J., Gorecka, J. N., Garstecki, P.,Gruenert, G., and Dittrich, P. Chemical computing with reaction-diffusionprocesses. PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETYA-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES 373, 2046(JUL 28 2015).

[234] Grabowski, L. On Turing dynamical systems and the Atiyah problem. INVEN-TIONES MATHEMATICAE 198, 1 (OCT 2014), 27–69.

[235] Greco, S., Matarazzo, B., and Slowinski, R. Rough sets theory for mul-ticriteria decision analysis. EUROPEAN JOURNAL OF OPERATIONAL RE-SEARCH 129, 1 (FEB 16 2001), 1–47.

[236] Greco, S., Matarazzo, B., and Slowinski, R. Algebra and Topology forDominance-Based Rough Set Approach. In ADVANCES IN INTELLIGENT IN-FORMATION SYSTEMS, Ras, ZW and Tsay, LS, Ed., vol. 265 of Studies inComputational Intelligence. 2010, pp. 43–78.

[237] Greco, S., Matarazzo, B., and Slowinski, R. On Topological Dominance-based Rough Set Approach. In TRANSACTIONS ON ROUGH SETS XII, Peters,JF and Skowron, A and Slowinski, R and Lingras, P and Miao, DQ and Tsumoto,S, Ed., vol. 6190 of Lecture Notes in Computer Science. 2010, pp. 21–45.

[238] Greenberg, N., and Miller, J. S. Diagonally non-recursive functions andeffective Hausdorff dimension. BULLETIN OF THE LONDON MATHEMATICALSOCIETY 43, 4 (AUG 2011), 636–654.

[239] Gruska, J. De-quantisation. In 8TH INTERNATIONAL CONFERENCE ONPROGRESS IN THEORETICAL PHYSICS (ICPTP 2011) (2012), Mebarki, Nand Mimouni, J and Belaloui, N and Moussa, KA, Ed., vol. 1444 of AIP ConferenceProceedings, Algerian Minist Higher Educ & Sci Res; Directorate Gen Sci Res& Technol Dev (DGRSDT); Rectorate Mentouri Univ; Fac Sci Mentouri Univ,pp. 106–116. 8th International Conference on Progress in Theoretical Physics(ICPTP), Campus Mentouri Univ, Constantine, ALGERIA, OCT 23-25, 2011.

[240] Gruska, J. Grand Challenges of Informatics. In COMPUTING WITH NEWRESOURCES: ESSAYS DEDICATED TO JOZEF GRUSKA ON THE OCCA-SION OF HIS 80TH BIRTHDAY, Calude, CS and Freivalds, R and Kazuo, I, Ed.,vol. 8808 of Lecture Notes in Computer Science. 2014, pp. 449–461.

[241] Guitart, R. Cohomological Emergence of Sense in Discourses (As Living SystemsFollowing Ehresmann and Vanbremeersch). AXIOMATHES 19, 3 (SEP 2009), 245–270.

21

[242] Gurevich, Y., and Passmore, G. O. Impugning Randomness, Convincingly.STUDIA LOGICA 100, 1-2, SI (APR 2012), 193–222.

[243] Gustafson, K. Parallel computing forty years ago. MATHEMATICS AND COM-PUTERS IN SIMULATION 51, 1-2 (DEC 22 1999), 47–62.

[244] Guz, N., Halamek, J., Rusling, J. F., and Katz, E. A biocatalytic cas-cade with several output signals-towards biosensors with different levels of con-fidence. ANALYTICAL AND BIOANALYTICAL CHEMISTRY 406, 14 (MAY2014), 3365–3370.

[245] Hagar, A. Quantum algorithms: Philosophical lessons. MINDS AND MA-CHINES 17, 2 (SUM 2007), 233–247.

[246] Halamek, J., Bocharova, V., Arugula, M. A., Strack, G., Privman, V.,and Katz, E. Realization and Properties of Biochemical-Computing BiocatalyticXOR Gate Based on Enzyme Inhibition by a Substrate. JOURNAL OF PHYSI-CAL CHEMISTRY B 115, 32 (AUG 18 2011), 9838–9845.

[247] Halamek, J., Bocharova, V., Chinnapareddy, S., Windmiller, J. R.,Strack, G., Chuang, M.-C., Zhou, J., Santhosh, P., Ramirez, G. V.,Arugula, M. A., Wang, J., and Katz, E. Multi-enzyme logic network ar-chitectures for assessing injuries: digital processing of biomarkers. MOLECULARBIOSYSTEMS 6, 12 (2010), 2554–2560.

[248] Halamek, J., Zavalov, O., Halamkova, L., Korkmaz, S., Privman, V.,and Katz, E. Enzyme-Based Logic Analysis of Biomarkers at Physiological Con-centrations: AND Gate with Double-Sigmoid “Filter” Response. JOURNAL OFPHYSICAL CHEMISTRY B 116, 15 (APR 19 2012), 4457–4464.

[249] Halamkova, L., Halamek, J., Bocharova, V., Wolf, S., Mulier, K. E.,Beilman, G., Wang, J., and Katz, E. Analysis of biomarkers characteristic ofporcine liver injury-from biomolecular logic gates to an animal model. ANALYST137, 8 (2012), 1768–1770.

[250] Harding, S. L., Miller, J. F., and Rietman, E. A. Evolution in materio: Ex-ploiting the physics of materials for computation. INTERNATIONAL JOURNALOF UNCONVENTIONAL COMPUTING 4, 2 (2008), 155–194.

[251] Hartmann, S., and Link, S. Deciding implication for functional dependencies incomplex-value databases. THEORETICAL COMPUTER SCIENCE 364, 2 (NOV6 2006), 212–240. 11th Workshop on Logic, Language, Information and Compu-tation, Univ Paris, Fontainebleau Campus, Fontainebleau, FRANCE, JUL 19-22,2004.

[252] Hartmann, S., Link, S., and Schewe, K. Axiomatisations of functional de-pendencies in the presence of records, lists, sets and multisets. THEORETICALCOMPUTER SCIENCE 355, 2 (APR 11 2006), 167–196. 10th Workshop on Logic,Language, Information and Computation, Fed Univ Ouro Preto, Minas Gerais,BRAZIL, JUL 29-AUG 01, 2003.

22

[253] Haw, J. Y., Assad, S. M., Lance, A. M., Ng, N. H. Y., Sharma, V., Lam,P. K., and Symul, T. Maximization of Extractable Randomness in a Quan-tum Random-Number Generator. PHYSICAL REVIEW APPLIED 3, 5 (MAY 112015).

[254] Hay, N. J. Simulation complexity. FUNDAMENTA INFORMATICAE 83, 1-2(2008), 117–140.

[255] Hermens, R. Conway-Kochen and the Finite Precision Loophole. FOUNDA-TIONS OF PHYSICS 44, 10 (OCT 2014), 1038–1048.

[256] Hertling, P., and Weihrauch, K. Randomness spaces. In AUTOMATA,LANGUAGES AND PROGRAMMING (1998), Larsen, KG and Skyum, S andWinskel, G, Ed., vol. 1443 of LECTURE NOTES IN COMPUTER SCIENCE,European Assoc Theoret Comp Sci, pp. 796–807. 25th International Colloquium onAutomata, Languages and Programming (ICALP 98), AALBORG, DENMARK,JUL 13-17, 1998.

[257] Higuchi, K., Hudelson, W. M. P., Simpson, S. G., and Yokoyama, K.Propagation of partial randomness. ANNALS OF PURE AND APPLIED LOGIC165, 2 (FEB 2014), 742–758.

[258] Hintikka, J. Who Has Kidnapped the Notion of Information? In SOCRATICEPISTEMOLOGY: EXPLORATIONS OF KNOWLEDGE-SEEKING BY QUES-TIONING. 2007, pp. 189–210.

[259] Hitchcock, J. M., and Mayordomo, E. Base invariance of feasible dimension.INFORMATION PROCESSING LETTERS 113, 14-16 (JUL-AUG 2013), 546–551.

[260] Hiyama, S., Moritani, Y., Gojo, R., Takeuchi, S., and Sutoh, K.Biomolecular-motor-based autonomous delivery of lipid vesicles as nano- or mi-croscale reactors on a chip. LAB ON A CHIP 10, 20 (2010), 2741–2748.

[261] Hodson-Tole, E. F., and Wakeling, J. M. Variations in motor unit re-cruitment patterns occur within and between muscles in the running rat (Rattusnorvegicus). JOURNAL OF EXPERIMENTAL BIOLOGY 210, 13 (JUL 1 2007),2333–2345.

[262] Hoelzl, R., Kraeling, T., Stephan, F., and Wu, G. Initial Segment Com-plexities of Randomness Notions. In THEORETICAL COMPUTER SCIENCE(2010), Calude, CS and Sassone, V, Ed., vol. 323 of IFIP Advances in Informationand Communication Technology, IFIP Tech Comm 1; IFIP WG 2 2; SIGACT;EATCS, pp. 259–270. 6th IFIP International Conference on Theoretical ComputerScience, Brisbane, AUSTRALIA, SEP 20-23, 2010.

[263] Hoelzl, R., Kraeling, T., Stephan, F., and Wu, G. Initial segment complex-ities of randomness notions. INFORMATION AND COMPUTATION 234 (FEB2014), 57–67.

[264] Hormoz, S. Quantum collapse and the second law of thermodynamics. PHYSI-CAL REVIEW E 87, 2 (FEB 20 2013).

23

[265] Hu, H., and Shi, Z. The neural circuits designing and analysis by the universalfuzzy logical framework. In FOURTH INTERNATIONAL CONFERENCE ONFUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 4, PROCEEDINGS(2007), Lei, JS and Yu, J and Zhou, SG, Ed., Hainan Univ; IEEE Reliabil Soc;Asia Pacific Neural Network Assembly, pp. 524–529. 4th International Conferenceon Fuzzy Systems and Knowledge Discovery, Haikou, PEOPLES R CHINA, AUG24-27, 2007.

[266] Hu, Y., Yang, Y., Katz, E., and Song, H. Programming the quorumsensing-based AND gate in Shewanella oneidensis for logic gated-microbial fuelcells. CHEMICAL COMMUNICATIONS 51, 20 (2015), 4184–4187.

[267] Hudelson, W. M. P. MASS PROBLEMS AND INITIAL SEGMENT COM-PLEXITY. JOURNAL OF SYMBOLIC LOGIC 79, 1 (MAR 2014), 20–44.

[268] HUHNE, M. ON THE POWER OF SEVERAL QUEUES. THEORETICALCOMPUTER SCIENCE 113, 1 (MAY 24 1993), 75–91. 8TH ANNUAL SYMP ONTHEORETICAL ASPECTS OF COMPUTER SCIENCE ( STACS 91 ), HAM-BURG, GERMANY, FEB 14-16, 1991.

[269] Hyde, J., Laschos, V., Olsen, L., Petrykiewicz, I., and Shaw, A. IteratedCesaro averages, frequencies of digits, and Baire category. ACTA ARITHMETICA144, 3 (2010), 287–293.

[270] Iancu, M., and Kohlhase, M. A Flexiformal Model of Knowledge Disseminationand Aggregation in Mathematics. In INTELLIGENT COMPUTER MATHEMAT-ICS, CICM 2015 (2015), Kerber, M and Carette, J and Kaliszyk, C and Rabe, Fand Sorge, V, Ed., vol. 9150 of Lecture Notes in Artificial Intelligence, pp. 137–152.International Conference on Intelligent Computer Mathematics (CICM), Washing-ton, DC, JUL 13-17, 2015.

[271] Ibarra, O. H. A Look Back at Some Early Results in Membrane Computing. InMEMBRANE COMPUTING (2010), Paun, G and Perez Jimenez, MJ and RiscosNunez, A and Rozenberg, G and Salomaa, A, Ed., vol. 5957 of Lecture Notes inComputer Science, Int Assoc Pattern Recognit; Informat Technol Ind Dev Agcy;Microsoft Innovat Lab Cairo; Nile Univ; Univ Surrey; Univ Cagliari, pp. 66–73.10th International Workshop on Membrane Computing9th International Workshopon Multiple Classifier Systems, Natl Coll Valaicu Voda Curtea de Arges, Curteade Arges, ROMANIACairo, EGYPT, AUG 24-27, 2009APR 07-09, 2010.

[272] Ibrahim, Z., Tsuboi, Y., Muhammad, M., Ono, O., and Khalid, M. DNAimplementation of k-shortest paths computation. In 2005 IEEE CONGRESS ONEVOLUTIONARY COMPUTATION, VOLS 1-3, PROCEEDINGS (2005), IEEECongress on Evolutionary Computation, IEEE; IEEE Computat Intelligence Soc;IEE; Evolut Programming Soc, pp. 707–713. IEEE Congress on EvolutionaryComputation, Edinburgh, SCOTLAND, SEP 02-05, 2005.

[273] Ibrahim, Z., Tsuboi, Y., Ono, O., and Khalid, M. Experimental implemen-tation of direct-proportional length-based DNA computing for numerical optimiza-tion of the shortest path problem. INTERNATIONAL JOURNAL OF UNCON-VENTIONAL COMPUTING 3, 1 (2007), 15–34. 8th European Conference onArtificial Life, Canterbury, ENGLAND, SEP 05-09, 2005.

24

[274] Ilie, L. On lengths of words in context-free languages. THEORETICAL COM-PUTER SCIENCE 242, 1-2 (JUL 6 2000), 327–359.

[275] Ilie, L., Paun, G., Rozenberg, G., and Salomaa, A. On strongly context-free languages. DISCRETE APPLIED MATHEMATICS 103, 1-3 (JUL 15 2000),153–165.

[276] Ionescu, M., and Sburlan, D. P systems with adjoining controlled communi-cation rules. In Fundamentals of Computation Theory, Proceedings (2007), Csuha-jVarju, E and Esik, Z, Ed., vol. 4639 of LECTURE NOTES IN COMPUTER SCI-ENCE, Hungarian Acad Sci, Comp & Automat Res Inst; Univ Szeged, Inst CompSci, pp. 353–364. 16th International Symposium on Fundamentals of ComputationTheory, Budapest, HUNGARY, AUG 27-30, 2007.

[277] ISTRATE, G., and PAUN, G. SOME COMBINATORIAL PROPERTIES OFSELF-READING SEQUENCES. DISCRETE APPLIED MATHEMATICS 55, 1(OCT 28 1994), 83–86.

[278] Joosten, J. J. Complexity, Universality and Intermediate Degrees. In NUMER-ICAL ANALYSIS AND APPLIED MATHEMATICS (ICNAAM 2012), VOLS AAND B (2012), Simos, TE and Psihoyios, G and Tsitouras, C and Anastassi,Z, Ed., vol. 1479 of AIP Conference Proceedings, European Soc Computat Meth-ods Sci, Engn & Technol (ESCMSET); R M Santilli Fdn, pp. 638–641. Interna-tional Conference of Numerical Analysis and Applied Mathematics (ICNAAM),Kos, GREECE, SEP 19-25, 2012.

[279] Juergensen, H. Complexity, information, energy. INTERNATIONAL JOUR-NAL OF FOUNDATIONS OF COMPUTER SCIENCE 19, 4 (AUG 2008), 781–793. 9th International Workshop on Descriptional Complexity of Formal Systems,Novy Smokovec, SLOVAKIA, JUL 20-22, 2007.

[280] Juergensen, H., and Matthews, D. E. Entropy and Higher Moments ofInformation. JOURNAL OF UNIVERSAL COMPUTER SCIENCE 16, 5 (2010),749–794.

[281] JURGENSEN, H., and STAIGER, L. LOCAL HAUSDORFF DIMENSION.ACTA INFORMATICA 32, 5 (AUG 1995), 491–507.

[282] Kari, L., Konstantinidis, S., and Sosik, P. On properties of bond-free DNAlanguages. THEORETICAL COMPUTER SCIENCE 334, 1-3 (APR 11 2005),131–159.

[283] Katz, E. Processing electrochemical signals at both sides of interface: electronicvs. chemical signal processing. JOURNAL OF SOLID STATE ELECTROCHEM-ISTRY 15, 7-8 (JUL 2011), 1471–1480.

[284] Katz, E. Biomolecular Information Processing: From Boolean Logic Gates toComplex Networked Systems INTRODUCTION. INTERNATIONAL JOURNALOF UNCONVENTIONAL COMPUTING 8, 5-6, SI (2012), 339–346.

[285] Katz, E. Biocomputing - tools, aims, perspectives. CURRENT OPINION INBIOTECHNOLOGY 34 (AUG 2015), 202–208.

25

[286] Katz, E., Bocharova, V., and Privman, M. Electronic interfaces switchableby logically processed multiple biochemical and physiological signals. JOURNALOF MATERIALS CHEMISTRY 22, 17 (2012), 8171–8178.

[287] Katz, E., and Gueven, A. Multi-Signal Processing Biosensors and Bioac-tuators Based on Biocomputing Concept. In NANOANTENNA: PLASMON-ENHANCED SPECTROSCOPIES FOR BIOTECHNOLOGICAL APPLICA-TIONS, DeLaChapelle, ML and Pucci, A, Ed., vol. 1 of Pan Stanford Series onthe High-Tech of Biotechnology. 2013, pp. 387–405.

[288] Katz, E., and Minko, S. Enzyme-based logic systems interfaced with signal-responsive materials and electrodes. CHEMICAL COMMUNICATIONS 51, 17(2015), 3493–3500.

[289] Katz, E., Minko, S., Halamek, J., MacVittie, K., and Yancey, K. Elec-trode interfaces switchable by physical and chemical signals for biosensing, biofuel,and biocomputing applications. ANALYTICAL AND BIOANALYTICAL CHEM-ISTRY 405, 11 (APR 2013), 3659–3672.

[290] Katz, E., and Privman, V. Enzyme-based logic systems for information pro-cessing. CHEMICAL SOCIETY REVIEWS 39, 5 (2010), 1835–1857.

[291] Katz, E., Wang, J., Privman, M., and Halamek, J. Multianalyte DigitalEnzyme Biosensors with Built-in Boolean Logic. ANALYTICAL CHEMISTRY 84,13 (JUL 3 2012), 5463–5469.

[292] Kelarev, A. An algorithm for BCH codes extended with finite state automata.FUNDAMENTA INFORMATICAE 84, 1 (2008), 51–60. 17th Australian Work-shop on Combinatorial Algorithms, Uluru, AUSTRALIA, JUL 13-19, 2006.

[293] Khan, M. S., Kulathuramaiyer, N., and Maurer, H. Applications of mash-ups for a digital journal. JOURNAL OF UNIVERSAL COMPUTER SCIENCE14, 10 (2008), 1695–1716.

[294] Khoussainov, B. Randomness, computability, and algebraic specifications. AN-NALS OF PURE AND APPLIED LOGIC 91, 1 (JAN 12 1998), 1–15.

[295] Khoussainov, B., Semukhin, P., and Stephan, F. Applications of Kol-mogorov complexity to computable model theory. JOURNAL OF SYMBOLICLOGIC 72, 3 (SEP 2007), 1041–1054.

[296] Kieu, T. An anatomy of a quantum adiabatic algorithm that transcends the Tur-ing computability. INTERNATIONAL JOURNAL OF QUANTUM INFORMA-TION 3, 1 (MAR 2005), 177–182. International Meeting on Quantum InformationScience, Univ Camerino, Camerino, ITALY, APR 16-19, 2004.

[297] Kihara, T., and Miyabe, K. Unified characterizations of lowness propertiesvia Kolmogorov complexity. ARCHIVE FOR MATHEMATICAL LOGIC 54, 3-4(MAY 2015), 329–358.

[298] Kjos-Hanssen, B., Merkle, W., and Stephan, F. KOLMOGOROV COM-PLEXITY AND THE RECURSION THEOREM. TRANSACTIONS OF THEAMERICAN MATHEMATICAL SOCIETY 363, 10 (OCT 2011), 5465–5480.

26

[299] Kleijn, J., and Koutny, M. Processes of membrane systems with promoters andinhibitors. THEORETICAL COMPUTER SCIENCE 404, 1-2 (SEP 6 2008), 112–126. 33rd International Colloquium on Automata, Languages and Programming,Venice, ITALY, JUL 10-14, 2006.

[300] Kleijn, J., and Koutny, M. Petri Nets with Localities and Testing. In APPLI-CATIONS AND THEORY OF PETRI NETS, PROCEEDINGS (2010), Lilius, Jand Penczek, W, Ed., vol. 6128 of Lecture Notes in Computer Science, Inst Poly-tecn Beja, pp. 19–38. 31st International Conference on Applications and Theoryof Petri Nets and Other Models of Concurrency, Univ Minho, Sch Engn, Braga,PORTUGAL, JUN 21-25, 2010.

[301] KNOEBEL, R. EXPONENTIALS REITERATED. AMERICAN MATHEMAT-ICAL MONTHLY 88, 4 (1981), 235–252.

[302] Koh, D. E., Hall, M. J. W., Setiawan, Pope, J. E., Marletto, C., Kay,A., Scarani, V., and Ekert, A. Effects of Reduced Measurement Independenceon Bell-Based Randomness Expansion. PHYSICAL REVIEW LETTERS 109, 16(OCT 18 2012).

[303] Kojman, M., Lee, G., Omri, E., and Weiermann, A. Sharp thresholds for thephase transition between primitive recursive and Ackermannian Ramsey numbers.JOURNAL OF COMBINATORIAL THEORY SERIES A 115, 6 (AUG 2008),1036–1055.

[304] Kojman, M., and Shelah, S. Regressive Ramsey numbers are Ackermannian.JOURNAL OF COMBINATORIAL THEORY SERIES A 86, 1 (APR 1999), 177–181.

[305] Konstantinidis, S., and Silva, P. V. Computing Maximal Error-detectingCapabilities and Distances of Regular Languages. FUNDAMENTA INFORMAT-ICAE 101, 4 (2010), 257–270.

[306] Kramosil, I. Searching algorithms implemented on probabilistic systolic arrays.INTERNATIONAL JOURNAL OF GENERAL SYSTEMS 25, 1 (1996), 7–45.

[307] KRAMOSIL, I., and SINDELAR, J. ON PSEUDO RANDOM SEQUENCESAND THEIR RELATION TO A CLASS OF STOCHASTICAL LAWS. KYBER-NETIKA 28, 5 (1992), 383–391.

[308] Krishna, S., and Rama, R. On the power of tissue P systems working in theminimal mode. In UNCONVENTIONAL MODELS IN COMPUTATION, PRO-CEEDINGS (2002), Calude, C and Dinneen, MJ and Peper, F, Ed., vol. 2509 ofLECTURE NOTES IN COMPUTER SCIENCE, Ctr Discrete Math & TheoretComp Sci; Adv Res Ctr Commun Res Lab, pp. 208–219. 3rd International Con-ference on Unconventional Models of Computation, KOBE, JAPAN, OCT 15-19,2002.

[309] Kucera, A., and Slaman, T. Randomness and recursive enumerability. SIAMJOURNAL ON COMPUTING 31, 1 (JUL 29 2001), 199–211.

27

[310] Kulkarni, A., Kim, B., Dugasani, S. R., Joshirao, P., Kim, J. A., Vyas,C., Manchanda, V., Kim, T., and Park, S. H. A novel nanometric DNA thinfilm as a sensor for alpha radiation. SCIENTIFIC REPORTS 3 (JUN 24 2013).

[311] Kummer, M. Kolmogorov complexity and instance complexity of recursively enu-merable sets. SIAM JOURNAL ON COMPUTING 25, 6 (DEC 1996), 1123–1143.

[312] Kuppusamy, L., Mahendran, A., and Krithivasan, K. ON THE AMBIGU-ITY OF INSERTION SYSTEMS. INTERNATIONAL JOURNAL OF FOUNDA-TIONS OF COMPUTER SCIENCE 22, 7, SI (NOV 2011), 1747–1758.

[313] Kuzaev, G., and Lebedeva, T. New logic components for processing complexmeasurement data. MEASUREMENT TECHNIQUES 43, 12 (DEC 2000), 1070–1073.

[314] Latif, A., Afzal, M. T., and Maurer, H. Weaving Scholarly Legacy Datainto Web of Data. JOURNAL OF UNIVERSAL COMPUTER SCIENCE 18, 16(2012), 2301–2318.

[315] Latkowski, R. Application of data decomposition to incomplete informationsystems. In INTELLIGENT INFORMATION SYSTEMS 2002, PROCEEDINGS(2002), Klopotek, MA and Wierzchon, ST and Michalewicz, M, Ed., ADVANCESIN SOFT COMPUTING, Polish Acad Sci, Inst Comp Sci, pp. 321–330. Symposiumon Intelligent Information Systems (IIS 2002), SOPOT, POLAND, JUN 03-06,2002.

[316] Lattimore, T., and Hutter, M. On Martin-Lof (non-)convergence ofSolomonoff’s universal mixture. THEORETICAL COMPUTER SCIENCE 588(JUL 11 2015), 2–15.

[317] Lecue, F., Delteil, A., and Leger, A. Towards the Composition of Statefuland Independent Semantic Web Services. In APPLIED COMPUTING 2008, VOLS1-3 (2008), ACM SIGAC; Univ Fortaleza; Federal Univ Ceara, pp. 2279–2285. 23rdAnnual ACM Symposium on Applied Computing, Fortaleza, BRAZIL, MAR 16-20,2008.

[318] Legg, S. Is there an elegant universal theory of prediction? In ALGORITHMICLEARNING THEORY, PROCEEDINGS (2006), Balcazar, JL and Long, PM andStephan, F, Ed., vol. 4264 of LECTURE NOTES IN ARTIFICIAL INTELLI-GENCE, Spanish Minist Sci; Google; Pascal Network Excellence; PASCAL Dia-logues 2006; Univ Politecn Calalunya; Idescat, Stat Inst Catalonia; Univ Lubeck,Inst Theoret Informatik; Hokkaido Univ, Div Comp Sci, pp. 274–287. 17th In-ternational Conference on Algorithmic Learning Theory (ALT 2006), Barcelona,SPAIN, OCT 07-10, 2006.

[319] Legg, S., and Hutter, M. Universal intelligence: A definition of machineintelligence. MINDS AND MACHINES 17, 4 (DEC 2007), 391–444.

[320] LENNON, J., and MAURER, H. APPLICATIONS OF HYPERMEDIA SYS-TEMS. PROGRAMMING AND COMPUTER SOFTWARE 21, 3 (MAY-JUN1995), 121–134.

28

[321] Lesniak, K. ON DISCRETE STOCHASTIC PROCESSES WITH DISJUNC-TIVE OUTCOMES. BULLETIN OF THE AUSTRALIAN MATHEMATICALSOCIETY 90, 1 (AUG 2014), 149–159.

[322] Lesniak, K. Random iteration for infinite nonexpansive iterated function systems.CHAOS 25, 8 (AUG 2015).

[323] Lewis, A. E. M., and Barmpalias, G. Random reals and Lipschitz continu-ity. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE 16, 5 (OCT2006), 737–749. 1st Conference on Computability in Europe - New ComputationalParadigms, Univ Amsterdam, Amsterdam, NETHERLANDS, JUN, 2005.

[324] Lewis, A. E. M., and Barmpalias, G. Randomness and the linear degrees ofcomputability. ANNALS OF PURE AND APPLIED LOGIC 145, 3 (MAR 2007),252–257.

[325] Li, C.-C. Speed-up theorems in type-2 computation. In Computation and Logicin the Real World, Proceedings (2007), Cooper, SB and Lowe, B and Sorbi, A,Ed., vol. 4497 of LECTURE NOTES IN COMPUTER SCIENCE, Dept Math &Comp Sci Roberto Magari; Fondazione Monte Paschi Siena; Ist Nazl Alta Matemat;Gruppo Nazl Strutture Algebriche; INDAM GNSAGA; Univ Siena; Assoc ItalianaLog & Applicazioni; Assoc Symbol Log; European Assoc Comp Sci Log; EuropeanAssoc Theoret Comp Sci; Assoc Log, Language & Informat; Comm Status WomenComp Res, pp. 478–487. 3rd Conference on Computability in Europe (CiE 2007),Siena, ITALY, JUN 18-23, 2007.

[326] Li, C.-C. Speed-Up Theorems in Type-2 Computations Using Oracle Turing Ma-chines. THEORY OF COMPUTING SYSTEMS 45, 4 (NOV 2009), 880–896. 3rdComputability in Europe Conference 2007, Univ Siena, Siena, ITALY, 2007.

[327] Li, L., and Qiu, D. On the State Minimization of Fuzzy Automata. IEEETRANSACTIONS ON FUZZY SYSTEMS 23, 2 (APR 2015), 434–443.

[328] Liu, C. Generalization of complexity oscillations in infinite sequences. In ICNC2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPU-TATION, VOL 1, PROCEEDINGS (2008), Guo, MZ and Zhao, L and Wang, LP,Ed., Int Nat Computat & Knowledge Discovery Assoc; Shandong Univ, pp. 299–303. 4th International Conference on Natural Computation (ICNC 2008), Jian,PEOPLES R CHINA, OCT 18-20, 2008.

[329] Liu, C. The quasi-equivalence between the definitions of partial randomness.In ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURALCOMPUTATION, VOL 1, PROCEEDINGS (2008), Guo, MZ and Zhao, L andWang, LP, Ed., Int Nat Computat & Knowledge Discovery Assoc; Shandong Univ,pp. 371–375. 4th International Conference on Natural Computation (ICNC 2008),Jian, PEOPLES R CHINA, OCT 18-20, 2008.

[330] Liu, X., Matsikoudis, E., and Lee, E. A. Modeling timed concurrent systems.In CONCUR 2006 - CONCURRENCY THEORY, PROCEEDINGS (2006), Baier,C and Hermanns, H, Ed., vol. 4137 of Lecture Notes in Computer Science, pp. 1–15.17th International Conference on Concurrency Theory, Bonn, GERMANY, AUG27-30, 2006.

29

[331] Lloyd, S. A Turing test for free will. PHILOSOPHICAL TRANSACTIONS OFTHE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEER-ING SCIENCES 370, 1971, SI (JUL 28 2012), 3597–3610.

[332] Longo, G. Incomputability in Physics. In PROGRAMS, PROOFS, PROCESSES(2010), Ferreira, F and Lowe, B and Mayordomo, E and Gomes, LM, Ed., vol. 6158of Lecture Notes in Computer Science, pp. 276–285. 6th Conference on Computabil-ity in Europe (CiE 2010), Univ Azores, Ponta Delgada, PORTUGAL, JUN 30-JUL04, 2010.

[333] Longo, G. Incomputability in Physics and Biology. MATHEMATICAL STRUC-TURES IN COMPUTER SCIENCE 22, 5, SI (OCT 2012), 880–900.

[334] Longo, G., Miquel, P.-A., Sonnenschein, C., and Soto, A. M. Is infor-mation a proper observable for biological organization? PROGRESS IN BIO-PHYSICS & MOLECULAR BIOLOGY 109, 3 (AUG 2012), 108–114.

[335] Luo, L. The future of lattice-gas and lattice Boltzmann methods. In COMPU-TATIONAL AEROSCIENCES IN THE 21ST CENTURY (2000), Salas, MD andAnderson, WK, Ed., vol. 8 of ICASE/LARC INTERDISCIPLINARY SERIES INSCIENCE AND ENGINEERING, Inst Comp Applicat Sci & Engn; NASA Lang-ley Res Ctr; Natl Sci Fdn; USA, Off Res, pp. 165–187. ICAS/LaRC/NSF/AROWorkshop on Computational Aerosciences in the 21st Century, HAMPTON, VA,APR 22-24, 1998.

[336] Lupacchini, R. Proof as a path of light. In DEDUCTION, COMPUTATION,EXPERIMENT: EXPLORING THE EFFECTIVENESS OF PROOF (2008), Lu-pacchini, R and Corsi, G, Ed., Univ Bologna, pp. 195–221. Workshop on Deduc-tion, Computation, Experiment - Exploring the Effectiveness of Proof‘, Bologna,ITALY, APR 03-04, 2007.

[337] Lupacchini, R., and Tamburrini, G. Grounding effective processes in empiricallaws: introductory remarks. In GROUNDING EFFECTIVE PROCESSES IN EM-PIRICAL LAWS: REFLECTIONS ON THE NOTION OF ALGORITHM (1999),Lupacchini, R and Tamburrini, G, Ed., Comune Cesena; F Enriques Ctr; ELSAG,pp. 9–21. Workshop on Symbols, Physical Processes, Biological Processes-RecentExplorations of the Notion of Algorithm, CESENA, ITALY, FEB 16, 1999.

[338] MacVittie, K., Halamek, J., and Katz, E. Enzyme-based D-flip-flop memorysystem. CHEMICAL COMMUNICATIONS 48, 96 (2012), 11742–11744.

[339] MacVittie, K., Halamek, J., and Katz, E. Enzyme-Based T-Flip-Flop Mem-ory System. INTERNATIONAL JOURNAL OF UNCONVENTIONAL COM-PUTING 8, 5-6, SI (2012), 383–389.

[340] MacVittie, K., and Katz, E. Electrochemical System with MemimpedanceProperties. JOURNAL OF PHYSICAL CHEMISTRY C 117, 47 (NOV 28 2013),24943–24947.

[341] MacVittie, K., and Katz, E. Biochemical flip-flop memory systems: essen-tial additions to autonomous biocomputing and biosensing systems. INTERNA-TIONAL JOURNAL OF GENERAL SYSTEMS 43, 7, SI (2014), 722–739.

30

[342] MacVittie, K., and Katz, E. Self-powered electrochemical memristor based ona biofuel cell - towards memristors integrated with biocomputing systems. CHEM-ICAL COMMUNICATIONS 50, 37 (2014), 4816–4819.

[343] Mailloux, S., Gerasimova, Y. V., Guz, N., Kolpashchikov, D. M., andKatz, E. Bridging the Two Worlds: A Universal Interface between Enzymaticand DNA Computing Systems. ANGEWANDTE CHEMIE-INTERNATIONALEDITION 54, 22 (MAY 26 2015), 6562–6566.

[344] Maldonado, C. E., and Gomez Cruz, N. A. Biological Hypercomputation: ANew Research Problem in Complexity Theory. COMPLEXITY 20, 4 (MAR-APR2015), 8–18.

[345] Malescio, G. Predicting with unpredictability. NATURE 434, 7037 (APR 282005), 1073.

[346] Manca, V., Martin-Vide, C., and Paun, G. New computing paradigms sug-gested by DNA computing: computing by carving. BIOSYSTEMS 52, 1-3 (OCT1999), 47–54. 4th International Meeting on DNA Based Computers, UNIV PENN-SYLVANIA, PHILADELPHIA, PENNSYLVANIA, JUN 15-19, 1998.

[347] MANDOIU, I. ON A THEOREM OF GACS. INTERNATIONAL JOURNALOF COMPUTER MATHEMATICS 48, 3-4 (1993), 157–169.

[348] Mandoiu, I. Optimum extensions of prefix codes. INFORMATION PROCESS-ING LETTERS 66, 1 (APR 15 1998), 35–40.

[349] Manin, Y. I. Infinities in Quantum Field Theory and in Classical Computing:Renormalization Program. In PROGRAMS, PROOFS, PROCESSES (2010), Fer-reira, F and Lowe, B and Mayordomo, E and Gomes, LM, Ed., vol. 6158 of LectureNotes in Computer Science, pp. 307–316. 6th Conference on Computability inEurope (CiE 2010), Univ Azores, Ponta Delgada, PORTUGAL, JUN 30-JUL 04,2010.

[350] Manin, Y. I. Renormalisation and computation II: time cut-off and the HaltingProblem. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE 22, 5,SI (OCT 2012), 729–751.

[351] Manin, Y. I. Complexity vs energy: theory of computation and theoreti-cal physics. In 3QUANTUM: ALGEBRA GEOMETRY INFORMATION (QQQCONFERENCE 2012) (2014), vol. 532 of Journal of Physics Conference Series,ITGP N W ESF; AGMP. Conference on 3Quantum - Algebra Geometry Informa-tion (QQQ), Tallinn Univ Technol, Tallinn, ESTONIA, JUL 10-13, 2012.

[352] Manin, Y. I. Zipf’s law and L. Levin probability distributions. FUNCTIONALANALYSIS AND ITS APPLICATIONS 48, 2 (APR 2014), 116–127.

[353] Marcus, S. Bridging two hierarchies of infinite words. JOURNAL OF UNIVER-SAL COMPUTER SCIENCE 8, 2 (2002), 292–296.

[354] Marcus, S. Proofs and mistakes: Their syntactics, semantics, and pragmatics.SEMIOTICA 188, 1-4, SI (2012), 139–155.

31

[355] Maroosi, A., and Muniyandi, R. C. Enhancement of membrane computingmodel implementation on GPU by introducing matrix representation for balancingoccupancy and reducing inter-block communications. JOURNAL OF COMPUTA-TIONAL SCIENCE 5, 6, SI (NOV 2014), 861–871.

[356] Martin-Delgado, M. A. On Quantum Effects in a Theory of Biological Evolu-tion. SCIENTIFIC REPORTS 2 (MAR 12 2012).

[357] Martin-Delgado, M.-A. ALAN TURING AND THE ORIGINS OF COM-PLEXITY. ARBOR-CIENCIA PENSAMIENTO Y CULTURA 189, 764 (2013).

[358] Marzlin, K.-P., and Landry, T. On the connection between the theorems ofGleason and of Kochen and Specker. CANADIAN JOURNAL OF PHYSICS 93,12 (DEC 2015), 1446–1452.

[359] Mateescu, A., Paun, G., Rozenberg, G., and Salomaa, A. Characteriza-tions of RE languages starting from internal contextual languages. INTERNA-TIONAL JOURNAL OF COMPUTER MATHEMATICS 66, 3-4 (1998), 179–197.

[360] Matsueda, H. Coherent modes in an ensemble of quantum dots generated bydynamic dipole-dipole interactions. SUPERLATTICES AND MICROSTRUC-TURES 24, 6 (1998), 423–433.

[361] Matsueda, H. Spatiotemporal dynamics of quantum computing dipole-dipoleblock systems. CHAOS SOLITONS & FRACTALS 10, 10 (OCT 1999), 1737–1748.

[362] Matsueda, H., and Cohen, D. Quantum logical diagram of quantum computingevolution. In QUANTUM COHERENCE AND DECOHERENCE (1999), Ono,YA and Fujikawa, K, Ed., NORTH-HOLLAND DELTA SERIES, Phys Soc Japan;Japan Soc Appl Phys; Adv Res Lab, Hitachi Ltd, pp. 37–40. 6th InternationalSymposium on Foundations of Quantum Mechanics in the Light of New Technology(ISQM-Tokyo 98), ADV RES LAB, HITACHI LTD, HATOYAMA, JAPAN, AUG24-27, 1998.

[363] Matvejchuk, M., and Utkina, E. Kochen-Specker Theorem in Krein Space.INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS 53, 10 (OCT2014), 3658–3665.

[364] Maurer, H. Hypermedia systems as Internet tools. In COMPUTER SCI-ENCE TODAY, vol. 1000 of LECTURE NOTES IN COMPUTER SCIENCE.1995, pp. 608–624.

[365] Merkle, W., and Mihailovic, N. On the construction of effective random sets.In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002 (2002),Diks, K and Rytter, W, Ed., vol. 2420 of LECTURE NOTES IN COMPUTERSCIENCE, Warsaw Univ, Inst Informat; Fdn Informat Technol Dev, pp. 568–580.27th International Symposium on Mathematical Foundations of Computer Science,WARSAW, POLAND, AUG 26-30, 2002.

[366] Merkle, W., Mihailovic, N., and Slaman, T. A. Some results on effectiverandomness. THEORY OF COMPUTING SYSTEMS 39, 5 (SEP 2006), 707–721.

32

[367] Messner, J., and Thierauf, T. A Kolmogorov complexity proof of the Lo-vasz Local Lemma for satisfiability. THEORETICAL COMPUTER SCIENCE461 (NOV 23 2012), 55–64. 17th International Computing and CombinatoricsConference (COCOON), Dallas, TX, AUG 14-16, 2011.

[368] Meyer, T., Schreckling, D., Tschudin, C., and Yamamoto, L. Robust-ness to Code and Data Deletion in Autocatalytic Quines. In TRANSACTIONSON COMPUTATIONAL SYSTEMS BIOLOGY X (2008), Priami, C and Akan,OB and Dressler, F and Ngom, A, Ed., vol. 5410 of Lecture Notes in ComputerScience, pp. 20–40. 2nd International Conference on Bio-Inspired Models of Net-work, Information and Computing Systems, Budapest, HUNGARY, DEC 10-13,2007.

[369] Meyer, T., and Tschudin, C. Robust Network Services with Distributed CodeRewriting. In BIOLOGICALLY INSPIRED NETWORKING AND SENSING:ALGORITHMS AND ARCHITECTURES. 2012, pp. 36–57.

[370] Meyer, T., Yamamoto, L., and Tschudin, C. An Artificial Chemistry for Net-working. In BIO-INSPIRED COMPUTING AND COMMUNICATION (2008),Lio, P and Yoneki, E and Verma, DC, Ed., vol. 5151 of Lecture Notes in ComputerScience, pp. 45–57. 1st Workshop on Bio-Inspired Design of Networks, Cambridge,ENGLAND, APR 02-05, 2007.

[371] Mieszkowicz-Rolka, A., and Rolka, L. Determining significance of attributesin the unified rough set approach. In Rough Sets, Fuzzy Sets, Data Mining andGranular Computing, Proceedings (2007), An, A and Stefanowski, J and Ramanna,S and Butz, CJ and Pedrycz, W and Wang, G, Ed., vol. 4482 of LECTURENOTES IN ARTIFICIAL INTELLIGENCE, Infobright Inc; MaRS Discovery Dist;York Univ; Int Rough Set Soc; Int Fuzzy Syst Assoc; Chinese Assoc ArtificialIntelligence, Rough Sets & Soft Computat Soc; Natl Res Council Canada, pp. 71–78. 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining andGranular Computing (RSFDGrC 2007), Toronto, CANADA, MAY 14-16, 2007.

[372] Miller, J. S., and Nies, A. Randomness and computability: Open questions.BULLETIN OF SYMBOLIC LOGIC 12, 3 (SEP 2006), 390–410.

[373] Miranda, E. R. Harnessing the Intelligence of Physarum Polycephalum for Un-conventional Computing-Aided Musical Composition. INTERNATIONAL JOUR-NAL OF UNCONVENTIONAL COMPUTING 10, 3, SI (2014), 251–268.

[374] Miranda, E. R., Adamatzky, A., and Jones, J. Sounds Synthesis with SlimeMould of Physarum Polycephalum. JOURNAL OF BIONIC ENGINEERING 8,2 (JUN 2011), 107–113.

[375] Miranda, E. R., Bull, L., Gueguen, F., and Uroukov, I. S. ComputerMusic Meets Unconventional Computing: Towards Sound Synthesis with In VitroNeuronal Networks. COMPUTER MUSIC JOURNAL 33, 1 (SPR 2009), 9–18.

[376] Miszczak, J. A. Generating and using truly random quantum states in Mathe-matica. COMPUTER PHYSICS COMMUNICATIONS 183, 1 (JAN 2012), 118–124.

33

[377] Mitchell, M. W., Abellan, C., and Amaya, W. Strong experimental guar-antees in ultrafast quantum random number generation. PHYSICAL REVIEW A91, 1 (JAN 12 2015).

[378] Miyabe, K. The difference between optimality and universality. LOGIC JOUR-NAL OF THE IGPL 20, 1 (FEB 2012), 222–234.

[379] Miyamoto, S. Bags, Toll Sets, and Fuzzy Sets. In INTEGRATED UN-CERTAINTY MANAGEMENT AND APPLICATIONS (2010), Huynh, VN andNakamori, Y and Lawry, J and Inuiguchi, M, Ed., vol. 68 of Advances in Intelligentand Soft Computing, pp. 307–317. International Symposium on Integrated Uncer-tainty Management and Applications, Japan Adv Inst Sci & Technol, Ishikawa,JAPAN, APR 09-11, 2010.

[380] Miyamoto, S. Different generalizations of bags. ANNALS OF OPERATIONSRESEARCH 195, 1 (MAY 2012), 221–236.

[381] Miyamoto, S., and Mizutani, K. Fuzzy multiset space and c-means clusteringusing kernels with application to information retrieval. In FUZZY SETS ANDSYSTEMS - IFSA 2003, PROCEEDINGS (2003), Bilgic, T and DeBaets, B andKaynak, O, Ed., vol. 2715 of LECTURE NOTES IN ARTIFICIAL INTELLI-GENCE, Bogazici Univ Fdn; Turkish Sci & Tech Res Council, pp. 387–395. 10thInternational-Fuzzy-Systems-Association World Congress, ISTANBUL, TURKEY,JUN 30-JUL 02, 2003.

[382] Moseley, F., Halamek, J., Kramer, F., Poghossian, A., Schoening,M. J., and Katz, E. An enzyme-based reversible CNOT logic gate realizedin a flow system. ANALYST 139, 8 (2014), 1839–1842.

[383] MOSS, G. NEW INFORMATION TECHNOLOGIES IN HIGHER-EDUCATION- CALUDE,C, CHITORAN,D, MALITZA,M. HIGHER EDUCATION 21, 2 (MAR1991), 271.

[384] Muller, S. Asymmetry: The Foundation of Information. In ASYMMETRY:THE FOUNDATION OF INFORMATION, Frontiers Collection. 2007, pp. 1–165.

[385] Murphy, N., Naughton, T. J., Woods, D., Henley, B., McDermott, K.,Duffy, E., van der Burgt, P. J. M., and Woods, N. Implementations ofa model of physical sorting. INTERNATIONAL JOURNAL OF UNCONVEN-TIONAL COMPUTING 4, 1 (2008), 3–12.

[386] NADIN, M. INTERFACE DESIGN - A SEMIOTIC PARADIGM. SEMIOTICA69, 3-4 (1988), 269–302.

[387] Nagy, B., and Valyi, S. A Characterization of NP Within Interval-Valued Com-puting. In MACHINES, COMPUTATIONS, AND UNIVERSALITY, MCU 2015(2015), DurandLose, J and Nagy, B, Ed., vol. 9288 of Lecture Notes in ComputerScience, Eastern Mediterranean Univ, pp. 164–179. 7th International Conferenceon Machines, Computations and Universality (MCU), Famagusta, CYPRUS, SEP09-11, 2015.

34

[388] Narimani, H., and Khosravifard, M. The Supertree of the Compact Codes. In2008 INTERNATIONAL SYMPOSIUM ON TELECOMMUNICATIONS, VOLS1 AND 2 (2008), pp. 649–655. International Symposium on Telecommunications,Tehran, IRAN, AUG 27-28, 2008.

[389] Nayebi, A. Practical Intractability: A Critique of the Hypercomputation Move-ment. MINDS AND MACHINES 24, 3 (AUG 2014), 275–305.

[390] Nehaniv, C. L., Rhodes, J., Egri-Nagy, A., Dini, P., Morris, E. R.,Horvath, G., Karimi, F., Schreckling, D., and Schilstra, M. J. Sym-metry structure in discrete models of biochemical systems: natural subsystemsand the weak control hierarchy in a new model of computation driven by in-teractions. PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETYA-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES 373, 2046(JUL 28 2015).

[391] Ng, T., Rappaport, D., and Salomaa, K. State Complexity of Neigh-bourhoods and Approximate Pattern Matching. In DEVELOPMENTS IN LAN-GUAGE THEORY (DLT 2015) (2015), Potapov, I, Ed., vol. 9168 of Lecture Notesin Computer Science, Univ Liverpool, pp. 389–400. 19th International Conferenceon Developments in Language Theory (DLT), Liverpool, ENGLAND, JUL 27-30,2015.

[392] Niculiu, T., Copilau, A., Lupu, C., and Manolescu, A. HIERARCHICALINTELLIGENT ANALOG SIMULATION. In EMSS 2008: 20TH EUROPEANMODELING AND SIMULATION SYMPOSIUM (2008), Bruzzone, A and Longo,F and Piera, MA and Aguilar, RM and Frydman, C, Ed., Univ Calabria, MechDept; MSC-LES Modelin and Simulat Ctr, Lab Enterprise Solut; Univ Genoa,DIPTEM; Liophant Simulat; IEEE; Soc Comp Simulat Int; McLeod Inst SimulaSci; Modeling & Simulat Network; Int Mediterranean and Latin Amer CouncilSimulat; Auton Univ Barcelona; Univ La Laguna; Management & Adv Solut &Technol; Tonno Callipo; Liquiriszie Amarelli; Giulio Barca Prodotti Pelle, pp. 323–332. 20th European Modeling and Simulation Symposium, Amantea, ITALY, SEP17-19, 2008.

[393] Niculiu, T.-R., and Niculiu, M. CONSCIENTIOUSLY LOOKING FOR CON-SCIENCE. EUROPEAN JOURNAL OF SCIENCE AND THEOLOGY 9, 3 (JUN2013), 15–28.

[394] Nolte, D., and Priese, L. Abstract fairness and semantics. THEORETICALCOMPUTER SCIENCE 177, 1 (APR 30 1997), 139–153. 10th Conference on theMathematical Foundations of Programming Semantics, KANSAS STATE UNIV,LAWRENCE, KS, MAR, 1994.

[395] Nowicki, R. Rough Neuro-Fuzzy Structures for Classification With Missing Data.IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS 39, 6 (DEC 2009), 1334–1347.

[396] Nugent, M. A., Porter, R., and Kenyon, G. T. Reliable computing withunreliable components: Using separable environments to stabilize long-term infor-mation storage. PHYSICA D-NONLINEAR PHENOMENA 237, 9 (JUL 1 2008),1196–1206.

35

[397] Nunes de Castro, L. Fundamentals of natural computing: an overview.PHYSICS OF LIFE REVIEWS 4, 1 (MAR 2007), 1–36.

[398] Okubo, F. REACTION AUTOMATA WORKING IN SEQUENTIAL MAN-NER. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS 48, 1(JAN 2014), 23–38.

[399] Okubo, F., Kobayashi, S., and Yokomori, T. On the properties of languageclasses defined by bounded reaction automata. THEORETICAL COMPUTERSCIENCE 454 (OCT 5 2012), 206–221.

[400] Okubo, F., Kobayashi, S., and Yokomori, T. Reaction automata. THEO-RETICAL COMPUTER SCIENCE 429 (APR 20 2012), 247–257.

[401] Okubo, F., and Yokomori, T. Finite Automata with Multiset Memory: A NewCharacterization of Chomsky Hierarchy. FUNDAMENTA INFORMATICAE 138,1-2, SI (2015), 31–44.

[402] Omri, E., and Weiermann, A. Classifying the phase transition threshold forAckermannian functions. ANNALS OF PURE AND APPLIED LOGIC 158, 3(APR 2009), 156–162. 3rd International Conference on Methods of Logic in Math-ematics, Euler Inst, St Petersburg, RUSSIA, JUN 01-07, 2006.

[403] Palmer, T. N., and O’Shea, M. Solving difficult problems creatively: a rolefor energy optimised deterministic/stochastic hybrid computing. FRONTIERS INCOMPUTATIONAL NEUROSCIENCE 9 (OCT 12 2015).

[404] Panu, G. Spiking Neural P Systems. A Quick Survey and Some Research Topics.In 16TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERICALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2014) (2014), Win-kler, F and Negru, V and Ida, T and Jebelean, T and Petcu, D and Watt, S andZaharie, D, Ed., IEEE; IEEE Comp Soc, pp. 20–25. 16th International Sympo-sium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC),Timisoara, ROMANIA, SEP 22-25, 2014.

[405] Paterek, T., Kofler, J., Prevedel, R., Klimek, P., Aspelmeyer, M.,Zeilinger, A., and Brukner, C. Logical independence and quantum random-ness. NEW JOURNAL OF PHYSICS 12 (JAN 20 2010).

[406] Paun, G. Distributed architectures in DNA computing based on splicing: Lim-iting the size of components. In UNCONVENTIONAL MODELS OF COMPU-TATION (1998), Calude, CS and Casti, J and Dinneen, MJ, Ed., SPRINGERSERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTERSCIENCE, Univ Auckland; Ctr Discrete Math & Theoret Comp Sci; Santa Fe Inst,pp. 323–335. 1st International Conference on Unconventional Models of Computa-tion (UMC 98), UNIV AUCKLAND, AUCKLAND, NEW ZEALAND, JAN 05-09,1998.

[407] Paun, G. DNA computing based on splicing: universality results. THEORETI-CAL COMPUTER SCIENCE 231, 2 (JAN 28 2000), 275–296. 2nd InternationalColloquium on Universal Machines and Computations (MCU 98), INST UNIVTECHNOL METZ, METZ, FRANCE, MAR 23-27, 1998.

36

[408] Paun, G. From cells to computers: computing with membranes (P systems).BIOSYSTEMS 59, 3 (MAR 2001), 139–158. Workshop on Grammar Systems,BAD ISCHL, AUSTRIA, JUL, 2000.

[409] Paun, G. Membrane computing. In FUNDAMENTALS OF COMPUTATIONTHEORY, PROCEEDINGS (2003), Lingas, A and Nilsson, BJ, Ed., vol. 2751 ofLECTURE NOTES IN COMPUTER SCIENCE, Lung Univ; Malmo Univ Coll;Swedish Res Council, pp. 284–295. 14th International Symposium on Fundamentalsof Computation Theory, MALMO, SWEDEN, AUG 12-15, 2003.

[410] Paun, G. Tracing some open problems in membrane computing. ROMANIANJOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY 10, 4 (2007),303–314.

[411] Paun, G. Unconventional Computing: Do We Dream Too Much? In EVOLVINGCOMPUTABILITY (2015), Beckmann, A and Mitrana, V and Soskova, M, Ed.,vol. 9136 of Lecture Notes in Computer Science, pp. 63–70. 11th Conference onComputability in Europe (CiE), Univ Bucharest, Fac Math & Comp Sci, Bucharest,ROMANIA, JUN 29-JUL 03, 2015.

[412] Paun, G., Suzuki, Y., and Tanaka, H. P systems with energy accounting.INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 78, 3 (2001),343–364.

[413] Pavel, A. B., and Buiu, C. Using enzymatic numerical P systems for modelingmobile robot controllers. NATURAL COMPUTING 11, 3, SI (SEP 2012), 387–393.

[414] Pavlov, B., Roach, G., and Yafyasov, A. Resonance scattering and design ofquantum gates. In UNCONVENTIONAL MODELS OF COMPUTATION (1998),Calude, CS and Casti, J and Dinneen, MJ, Ed., SPRINGER SERIES IN DIS-CRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, UnivAuckland; Ctr Discrete Math & Theoret Comp Sci; Santa Fe Inst, pp. 336–351.1st International Conference on Unconventional Models of Computation (UMC98), UNIV AUCKLAND, AUCKLAND, NEW ZEALAND, JAN 05-09, 1998.

[415] Piccinini, G. The Physical Church-Turing Thesis: Modest or Bold? BRITISHJOURNAL FOR THE PHILOSOPHY OF SCIENCE 62, 4 (DEC 2011), 733–769.

[416] Pina-Garcia, C. A., and Garcia-Vega, V. A. A hybrid methodology forrobotic architectures with a cellular approach. In 2006 1st IEEE InternationalConference on E-Learning in Industrial Electronics (2006), IEEE, pp. 156–160.1st IEEE International Conference on E-Learning in Industrial Electronics, Ham-mamet, TUNISIA, DEC 18-20, 2006.

[417] Planat, M., and Saniga, M. Five-qubit contextuality, noise-like distributionof distances between maximal bases and finite geometry. PHYSICS LETTERS A376, 46 (OCT 15 2012), 3485–3490.

[418] Plonka, P. M., Passeron, T., Brenner, M., Tobin, D. J., Shibahara, S.,Thomas, A., Slominski, A., Kadekaro, A. L., Hershkovitz, D., Peters,E., Nordlund, J. J., Abdel-Malek, Z., Takeda, K., Paus, R., Ortonne,J. P., Hearing, V. J., and Schallreuter, K. U. What are melanocytes

37

really doing all day long...? EXPERIMENTAL DERMATOLOGY 18, 9 (SEP2009), 799–819.

[419] Porrot, S., Dauchet, M., Durand, B., and Vereshchagin, N. Determin-istic rational transducers and random sequences. In FOUNDATIONS OF SOFT-WARE SCIENCE AND COMPUTATION STRUCTURES (1998), Nivat, M, Ed.,vol. 1378 of LECTURE NOTES IN COMPUTER SCIENCE, Portugal Telecom;TAP Air Portugal; Luso Amer Dev Fdn; British Council; Commiss European Com-munities, Programme Training & Mobil Researchers; Univ Lisbon; European AssocTheoret Comp Sci; European Assoc Programming Languages & Syst; GulbenkianFdn, pp. 258–272. 1st International Conference on Foundations of Software Scienceand Computation Structures (FoSSaCS 98) at the Joint European Conf on Theoryand Practice of Software, LISBON, PORTUGAL, MAR 28-APR 04, 1998.

[420] Potgieter, P. H. Zeno machines and hypercomputation. THEORETICALCOMPUTER SCIENCE 358, 1 (JUL 31 2006), 23–33.

[421] Povarov, G. A. Regularity of a Dynamic Neighborhood of a Regular Language.PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS 267, 1(DEC 2009), S201–S209.

[422] Privman, V., Domanskyi, S., Mailloux, S., Holade, Y., and Katz, E.Kinetic Model for a Threshold Filter in an Enzymatic System for Bioanalytical andBiocomputing Applications. JOURNAL OF PHYSICAL CHEMISTRY B 118, 43(OCT 30 2014), 12435–12443.

[423] Privman, V., Fratto, B. E., Zavalov, O., Halamek, J., and Katz, E.Enzymatic AND Logic Gate with Sigmoid Response Induced by PhotochemicallyControlled Oxidation of the Output. JOURNAL OF PHYSICAL CHEMISTRY B117, 25 (JUN 27 2013), 7559–7568.

[424] Privman, V., and Katz, E. Can bio-inspired information processing steps berealized as synthetic biochemical processes? PHYSICA STATUS SOLIDI A-APPLICATIONS AND MATERIALS SCIENCE 212, 2 (FEB 2015), 219–228.

[425] Privman, V., Zavalov, O., Halamkova, L., Moseley, F., Halamek, J.,and Katz, E. Networked Enzymatic Logic Gates with Filtering: New Theoret-ical Modeling Expressions and Their Experimental Application. JOURNAL OFPHYSICAL CHEMISTRY B 117, 48 (DEC 5 2013), 14928–14939.

[426] Putz, V., and Svozil, K. Can a Computer be “Pushed” to Perform Faster-Than-Light? INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING8, 1, SI (2012), 99–105.

[427] Qiu, D., and Yu, S. Hierarchy and equivalence of multi-letter quantum finiteautomata. THEORETICAL COMPUTER SCIENCE 410, 30-32 (AUG 20 2009),3006–3017.

[428] Ratsaby, J. An empirical study of the complexity and randomness of predic-tion error sequences. COMMUNICATIONS IN NONLINEAR SCIENCE ANDNUMERICAL SIMULATION 16, 7 (JUL 2011), 2832–2844.

38

[429] Rettinger, R., and Zheng, X. Hierarchy of monotonically computable realnumbers. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE2001 (2001), Sgall, J and Pultr, A and Kolman, P, Ed., vol. 2136 of Lecture Notesin Computer Science, Acad Sci Czech Republ, Math Inst; Inst Theoret CompSci; Inst Comp Sci; Act M Agcy, pp. 633–644. 26th International Symposium onMathematical Foundations of Computer Science, MARIANSKE LAZNE, CZECHREPUBLIC, AUG 27-31, 2001.

[430] Rettinger, R., and Zheng, X. Solovay reducibility on d-c.e real numbers.In COMPUTING AND COMBINATORICS, PROCEEDINGS (2005), Wang, LH,Ed., vol. 3595 of Lecture Notes in Computer Science, Chinese Acad Sci, Acad Math& Syst Sci, pp. 359–368. 11th Annual International Conference on Computing andCombinatorics (COCOON 2005), Kunming, PEOPLES R CHINA, AUG 16-29,2005.

[431] Rettinger, R., Zheng, X., Gengler, R., and von Braunmuhl, B. Monoton-ically computable real numbers. In COMBINATORICS, COMPUTABILITY ANDLOGIC (2001), Calude, CS and Dinneen, MJ and Sburlan, S, Ed., DISCRETEMATHEMATICS AND THEORETICAL COMPUTER SCIENCE (SERIES), FacMath & Comp Sci; Ovidius Univ; Univ Auckland, Ctr Discrete Math & Theo-ret Sci, pp. 187–201. 3rd International Conference on Discrete Mathematics andTheoretical Computer Science (DMTCS 01), CONSTANTA, ROMANIA, 2001.

[432] Rettinger, R., Zheng, X., Gengler, R., and von Braunmuhl, B. Weaklycomputable real numbers and total computable real functions. In COMPUTINGAND COMBINATORICS (2001), Wang, J, Ed., vol. 2108 of Lecture Notes in Com-puter Science, Chinese Acad Sci; China Comp Federat, pp. 586–595. 7th AnnualInternational Computing and Combinatorics Conference, GUILIN, PEOPLES RCHINA, AUG 20-23, 2001.

[433] Rettinger, R., Zheng, X., Gengler, R., and von Braunmuhl, B. Mono-tonically computable real numbers. MATHEMATICAL LOGIC QUARTERLY 48,3 (2002), 459–479.

[434] Ricotta, C., and Anand, M. Spatial complexity of ecological communities:Bridging the gap between probabilistic and non-probabilistic uncertainty measures.ECOLOGICAL MODELLING 197, 1-2 (AUG 10 2006), 59–66.

[435] Rivals, E., and Delahaye, J. Optimal representation in average using Kol-mogorov complexity. THEORETICAL COMPUTER SCIENCE 200, 1-2 (JUN 281998), 261–287.

[436] Rodriguez Velasquez, J. O. A method for forecasting the seasonal dynamicof malaria in the municipalities of Colombia. REVISTA PANAMERICANA DESALUD PUBLICA-PAN AMERICAN JOURNAL OF PUBLIC HEALTH 27, 3(MAR 2010), 211–218.

[437] Rovan, B., and Zeman, M. Modeling time criticality of information. INFOR-MATION PROCESSING LETTERS 114, 3 (MAR 2014), 147–151.

[438] Ryabko, B. Applications of Kolmogorov complexity and universal codes to Non-parametric estimation of characteristics of time series. FUNDAMENTA INFOR-MATICAE 83, 1-2 (2008), 177–196.

39

[439] Salomaa, K., and Schofield, P. State complexity of additive weighted finiteautomata. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTERSCIENCE 18, 6 (DEC 2007), 1407–1416.

[440] SANTEAN, L. A HIERARCHY OF UNARY PRIMITIVE RECURSIVESTRING-FUNCTIONS. LECTURE NOTES IN COMPUTER SCIENCE 464(1990), 225–233.

[441] SCHAFER, G. A NOTE ON CONJECTURES OF CALUDE ABOUT THETOPOLOGICAL SIZE OF SETS OF PARTIAL RECURSIVE FUNCTIONS.ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DERMATHEMATIK 31, 3 (1985), 279–280.

[442] Schaller, M., and Svozil, K. Scale-invariant cellular automata and self-similarPetri nets. EUROPEAN PHYSICAL JOURNAL B 69, 2 (MAY 2009), 297–311.

[443] Schmidhuber, J. The Fastest Way of Computing All Universes. In COM-PUTABLE UNIVERSE: UNDERSTANDING AND EXPLORING NATURE ASCOMPUTATION, Zenil, H, Ed. 2013, pp. 381–398.

[444] SCHMIDT, M. ON THE POWER OF SEVERAL QUEUES. LECTURE NOTESIN COMPUTER SCIENCE 480 (1991), 64–75.

[445] Schwarz, S., and Staiger, L. Topologies Refining the Cantor Topology onX-omega. In THEORETICAL COMPUTER SCIENCE (2010), Calude, CS andSassone, V, Ed., vol. 323 of IFIP Advances in Information and CommunicationTechnology, IFIP Tech Comm 1; IFIP WG 2.2; SIGACT; EATCS, pp. 271–285.6th IFIP International Conference on Theoretical Computer Science, Brisbane,AUSTRALIA, SEP 20-23, 2010.

[446] Sempere, J. M., and Lopez, D. Characterizing membrane structures throughmultiset tree automata. In MEMBRANE COMPUTING (2007), Eleftherakis, Gand Kefalas, P and Paun, G and Rozenberg, G and Salomaa, A, Ed., vol. 4860 ofLECTURE NOTES IN COMPUTER SCIENCE, pp. 428–437. 8th InternationalWorkshop on Membrane Computing, Thessaloniki, GREECE, JUN 25-28, 2007.

[447] Shagrir, O. Supertasks do not increase computational power. NATURAL COM-PUTING 11, 1, SI (MAR 2012), 51–58.

[448] Shmulevich, I., and Povel, D. Measures of temporal pattern complexity.JOURNAL OF NEW MUSIC RESEARCH 29, 1 (2000), 61–69.

[449] Sicard, A., Ospina, J., and Velez, M. Quantum hypercomputation based onthe dynamical algebra su(1,1). JOURNAL OF PHYSICS A-MATHEMATICALAND GENERAL 39, 40 (OCT 6 2006), 12539–12558.

[450] Simpson, S. G., and Stephan, F. Cone avoidance and randomness preservation.ANNALS OF PURE AND APPLIED LOGIC 166, 6 (JUN 2015), 713–728.

[451] Sindelar, J., and Bocek, P. Kolmogorov complexity and probability measures.KYBERNETIKA 38, 6 (2002), 729–745.

[452] Sindelar, J., and Bocek, P. Kolmogorov complexity, pseudorandom generatorsand statistical models testing. KYBERNETIKA 38, 6 (2002), 747–759.

40

[453] Small, J. Why do quantum systems implement self-referential logic? A simplequestion with a catastrophic answer. In COMPUTING ANTICIPATORY SYS-TEMS (2006), Dubois, DM, Ed., vol. 839 of AIP Conference Proceedings, FNRS;Minist Communaute Francaise Belgique; Adm Gen Enseignement & Rech Sci; HECManagement Sch; Univ Liege; Euro View Serv SA; Hotel Ville Liege, pp. 167–183.7th International Conference on Computing Anticipatory Systems (CASYS 05),Liege, BELGIUM, AUG 08-13, 2005.

[454] Soler-Toscano, F., Zenil, H., Delahaye, J.-P., and Gauvrit, N. Calcu-lating Kolmogorov Complexity from the Output Frequency Distributions of SmallTuring Machines. PLOS ONE 9, 5 (MAY 8 2014).

[455] Solis, A., Angulo Martinez, A. M., Ramirez Alarcon, R.,Cruz Ramirez, H., U’Ren, A. B., and Hirsch, J. G. How random are randomnumbers generated using photons? PHYSICA SCRIPTA 90, 7, SI (JUL 2015).

[456] Solis, A., and Hirsch, J. G. Quantumness, Randomness and Computabil-ity. In INTERNATIONAL CONFERENCE ON QUANTUM CONTROL, EXACTOR PERTURBATIVE, LINEAR OR NONLINEAR TO CELEBRATE 50 YEARSOF THE SCIENTIFIC CAREER OF PROFESSOR BOGDAN MIELNIK (MIEL-NIK50) (2015), Breton, N and Fernandez, D and Kielanowski, P, Ed., vol. 624 ofJournal of Physics Conference Series, Cinvestav; Consejo Nacl Ciencia & Tecnolo-gia. International Conference on Quantum Control, Exact or Perturbative, Linearor Nonlinear, Mexico City, MEXICO, OCT 22-24, 2014.

[457] Sosik, P., and Matysek, J. Membrane computing: When communication isenough. In UNCONVENTIONAL MODELS IN COMPUTATION, PROCEED-INGS (2002), Calude, C and Dinneen, MJ and Peper, F, Ed., vol. 2509 of LEC-TURE NOTES IN COMPUTER SCIENCE, Ctr Discrete Math & Theoret CompSci; Adv Res Ctr Commun Res Lab, pp. 264–275. 3rd International Conference onUnconventional Models of Computation, KOBE, JAPAN, OCT 15-19, 2002.

[458] Speidel, U. An Extended Similarity Distance for Use with Computable Informa-tion Estimators. In 2014 INTERNATIONAL SYMPOSIUM ON INFORMATIONTHEORY AND ITS APPLICATIONS (ISITA) (2014), Res Soc Informat Theory& Applicat; Engn Sci Soc; IEEE Informat Theory Soc; Monash Univ; MelbourneConvent Bur; KDDI Fdn; Support Ctr Adv Telecommunicat Technol Res, pp. 304–308. International Symposium on Information Theory and its Applications (ISITA),Melbourne, AUSTRALIA, OCT 26-29, 2014.

[459] Sprenger, K. Some hierarchies of primitive recursive functions on term algebras.MATHEMATICAL LOGIC QUARTERLY 43, 2 (1997), 251–286.

[460] Stadler, B. M. R., and Stadler, P. F. Connectivity Spaces. MATHEMATICSIN COMPUTER SCIENCE 9, 4 (DEC 2015), 409–436.

[461] STAIGER, L. REPRESENTABLE MARTINLOF,P TESTS. KYBERNETIKA21, 3 (1985), 235–243.

[462] Staiger, L. A tight upper bound on Kolmogorov complexity and uniformly opti-mal prediction. THEORY OF COMPUTING SYSTEMS 31, 3 (MAY-JUN 1998),215–229.

41

[463] Staiger, L. The Kolmogorov complexity of real numbers. In FUNDAMENTALSOF COMPUTATION THEORY (1999), Ciobanu, G and Paun, G, Ed., vol. 1684of LECTURE NOTES IN COMPUTER SCIENCE, Assoc Comp Machinery; NatlAgcy Sci Technol & Innovat; Motorola, pp. 536–546. 12th International Symposiumon Fundamental of Computation Theory, IASI, ROMANIA, AUG 30-SEP 03, 1999.

[464] Staiger, L. How large is the set of disjunctive sequences? In COMBINA-TORICS, COMPUTABILITY AND LOGIC (2001), Calude, CS and Dinneen,MJ and Sburlan, S, Ed., DISCRETE MATHEMATICS AND THEORETICALCOMPUTER SCIENCE (SERIES), Fac Math & Comp Sci; Ovidius Univ; UnivAuckland, Ctr Discrete Math & Theoret Sci, pp. 215–225. 3rd International Con-ference on Discrete Mathematics and Theoretical Computer Science (DMTCS 01),CONSTANTA, ROMANIA, 2001.

[465] Staiger, L. How large is the set of disjunctive sequences. JOURNAL OF UNI-VERSAL COMPUTER SCIENCE 8, 2 (2002), 348–362.

[466] Staiger, L. The Kolmogorov complexity of infinite words. THEORETICALCOMPUTER SCIENCE 383, 2-3 (SEP 18 2007), 187–199. Meeting of theAmerican-Mathematical-Society, Santa Barbara, CA, APR, 2005.

[467] Stambuk, N. Universal metric properties of the genetic code. CROATICA CHEM-ICA ACTA 73, 4 (DEC 2000), 1123–1139. 14th Dubrovnik International Courseand Conference on the Interfaces between Mathematics, Chemistry and ComputerSciences, DUBROVNIK, CROATIA, JUN 21-26, 1999.

[468] Stamenkovic, A., and Ciric, M. Construction of fuzzy automata from fuzzyregular expressions. FUZZY SETS AND SYSTEMS 199 (JUL 16 2012), 1–27.

[469] Stamenkovic, A., Ciric, M., and Ignjatovic, J. Reduction of fuzzy automataby means of fuzzy quasi-orders. INFORMATION SCIENCES 275 (AUG 10 2014),168–198.

[470] Stanislav, J. M. A 43 YEARS HISTORY, PASSING FROM THE GUTEN-BERG PROJECT INITIATIVE TO THE OPEN EDUCATIONAL RESOURCESMOVEMENT. In LET’S BUILD THE FUTURE THROUGH LEARNING INNO-VATION!, VOL IV (2014), Roceanu, I, Ed., eLearning and Software for Education,pp. 433–440. 10th International Scientific Conference on eLearning and Softwarefor Education, Bucharest, ROMANIA, APR 24-25, 2014.

[471] Stannett, M. Specification, testing and verification of unconventional compu-tations using generalized X-machines. INTERNATIONAL JOURNAL OF GEN-ERAL SYSTEMS 43, 7, SI (2014), 713–721.

[472] Stephan, F., and Teutsch, J. AN INCOMPLETE SET OF SHORTEST DE-SCRIPTIONS. JOURNAL OF SYMBOLIC LOGIC 77, 1 (MAR 2012), 291–307.

[473] Stephan, F., and Teutsch, J. Things that can be made into themselves. IN-FORMATION AND COMPUTATION 237 (OCT 2014), 174–186.

[474] STREINU, I. GRAMMAR DIRECTED GODEL NUMBERINGS. INTERNA-TIONAL JOURNAL OF COMPUTER MATHEMATICS 14, 3-4 (1983), 223–237.

42

[475] Sutner, K. The Ehrenfeucht-Mycielski sequence. In IMPLEMENTATIONAND APPLICATION OF AUTOMATA, PROCEEDINGS (2003), Ibarra, OH andDang, Z, Ed., vol. 2759 of LECTURE NOTES IN COMPUTER SCIENCE, UnivCalif Santa Barbara, Comp Sci Dept; Univ Calif Santa Barbara, Coll Engn; UnivCalif Santa Barbara, Grad Div; AT&T Labs Res; Expertcity Inc, pp. 282–293.8th International Conference on Implementation and Application of Automata,UNIV CALIF SANTA BARBARA, SANTA BARBARA, CALIFORNIA, JUL 16-18, 2003.

[476] Suzuki, T., and Kumabe, M. Weak randomness, genericity and Boolean decisiontrees. In PROCEEDINGS OF THE 10TH ASIAN LOGIC CONFERENCE (2010),Arai, T and Brendle, J and Kikyo, H and Chong, CT and Downey, R and Feng,Q and Ono, H, Ed., Assoc Symbol Log; Japan Soc Promot Sci; Inoue Fdn Sci,pp. 322–344. 10th Asian Logic Conference, Kobe Univ, Kobe, JAPAN, SEP 01-06,2008.

[477] Suzuki, Y., Fujiwara, Y., Takabayashi, J., and Tanaka, H. Artificial lifeapplications of a class of P systems: Abstract rewriting systems on multisets. InMULTISET PROCESSING: MATHEMATICAL, COMPUTER SCIENCE, ANDMOLECULAR COMPUTING POINTS OF VIEW (2001), Calude, CS and Paun,G and Rozenberg, G and Salomaa, A, Ed., vol. 2235 of Lecture Notes in ComputerScience, Romanian Acad, Simion Stoilow Inst Math; Polytech Univ Madrid, Arti-ficial Intelligence Dept; Auckland Univ, Ctr Discrete Math & Theoret Comp Sci,pp. 299–346. Workshop on Multiset Processing, CURTEA DE ARGES, ROMA-NIA, AUG, 2000.

[478] SVOZIL, K. ARE CHAOTIC SYSTEMS DYNAMICALLY RANDOM.PHYSICS LETTERS A 140, 1-2 (SEP 4 1989), 5–9.

[479] SVOZIL, K. CONSTRUCTIVE CHAOS BY CELLULAR AUTOMATA ANDPOSSIBLE SOURCES OF AN ARROW OF TIME. PHYSICA D 45, 1-3 (SEP1990), 420–427. WORKSHOP ON CELLULAR AUTOMATA : THEORY ANDEXPERIMENT, LOS ALAMOS NATL LAB, LOS ALAMOS, NM, SEP 09-12,1989.

[480] SVOZIL, K. ON THE COMPUTATIONAL POWER OF PHYSICAL SYS-TEMS, UNDECIDABILITY, THE CONSISTENCY OF PHENOMENA, ANDTHE PRACTICAL USES OF PARADOXES. In FUNDAMENTAL PROBLEMSIN QUANTUM THEORY: A CONFERENCE HELD IN HONOR OF PROFES-SOR JOHN A. WHEELER (1995), Greenberger, DM and Zeilinger, A, Ed.,vol. 755 of Annals of the New York Academy of Sciences, New York Acad Sci,pp. 834–841. Conference on Fundamental Problems in Quantum Theory, A Con-ference held in Honor of Professor John A. Wheeler, BALTIMORE, MD, JUN18-22, 1994.

[481] Svozil, K. Set theory and physics. FOUNDATIONS OF PHYSICS 25, 11 (NOV1995), 1541–1560.

[482] Svozil, K. The church-turing thesis as a guiding principle for physics. In UNCON-VENTIONAL MODELS OF COMPUTATION (1998), Calude, CS and Casti, Jand Dinneen, MJ, Ed., SPRINGER SERIES IN DISCRETE MATHEMATICS

43

AND THEORETICAL COMPUTER SCIENCE, Univ Auckland; Ctr DiscreteMath & Theoret Comp Sci; Santa Fe Inst, pp. 371–385. 1st International Confer-ence on Unconventional Models of Computation (UMC 98), UNIV AUCKLAND,AUCKLAND, NEW ZEALAND, JAN 05-09, 1998.

[483] Svozil, K. Logic of reversible automata. INTERNATIONAL JOURNAL OFTHEORETICAL PHYSICS 39, 3 (MAR 2000), 893–899. Quantum Structures 98Conference, LIPTOVSKY JAN, SLOVAKIA, AUG 30-SEP 05, 1998.

[484] Svozil, K. Quantum information: The new frontier. In UNCONVENTIONALMODELS OF COMPUTATION UMC’ 2K, PROCEEDINGS (2001), Antoniou,I and Calude, CS and Dinneen, MJ, Ed., DISCRETE MATHEMATICS ANDTHEORETICAL COMPUTER SCIENCE (SERIES), Univ Auckland, Ctr DiscreteMath & Theoret Comp Sci; Vrije Univ Brussels, Theoret Phys Div; Int SolvayInst Phys & Chem; Belgium Prime Minister’s Off; Fed Off Sci Techn & CulturalAffairs; Pukekohe Travel; Interuniv Poles Attract Program Contract P4/08 BelgianState, pp. 248–272. 2nd International Conference on Unconventional Models ofComputation (UMC’2K), SOLVAY INST, BRUSSELS, BELGIUM, DEC 13-16,2000.

[485] Svozil, K. Three criteria for quantum random-number generators based on beamsplitters. PHYSICAL REVIEW A 79, 5 (MAY 2009).

[486] Svozil, K. Quantum value indefiniteness. NATURAL COMPUTING 10, 4, SI(DEC 2011), 1371–1382.

[487] Svozil, K. How much contextuality? NATURAL COMPUTING 11, 2, SI (JUN2012), 261–265.

[488] Svozil, K. Non-contextual chocolate balls versus value indefinite quantum cryp-tography. THEORETICAL COMPUTER SCIENCE 560, 1 (DEC 4 2014), 82–90.

[489] Svozil, K. Physical Aspects of Oracles for Randomness and Hadamard’s Con-jecture. In COMPUTING WITH NEW RESOURCES: ESSAYS DEDICATEDTO JOZEF GRUSKA ON THE OCCASION OF HIS 80TH BIRTHDAY, Calude,CS and Freivalds, R and Kazuo, I, Ed., vol. 8808 of Lecture Notes in ComputerScience. 2014, pp. 223–230.

[490] Svozil, K. Unscrambling the Quantum Omelette. INTERNATIONAL JOURNALOF THEORETICAL PHYSICS 53, 10 (OCT 2014), 3648–3657.

[491] Svozil, K. Space and Time in a Quantized World. INTERNATIONAL JOURNALOF THEORETICAL PHYSICS 54, 12 (DEC 2015), 4376–4385.

[492] Svozil, K., Calude, C., and Stay, M. From Heisenberg to Godel via Chaitin.INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS 44, 7 (JUL 2005),1053–1065. International Conference on Quantum Structures 2002, Vienna, AUS-TRIA, JUL 01-07, 2002.

[493] Svozil, K., and Neufeld, N. ‘Linear’ chaos via paradoxical set decompositions.CHAOS SOLITONS & FRACTALS 7, 5 (MAY 1996), 785–793.

44

[494] Syropoulos, A. Theory of Fuzzy Computation. In THEORY OF FUZZY COM-PUTATION, vol. 31 of IFSR International Series on System Science and Engi-neering. 2014, pp. 1–162.

[495] Tadaki, K. A statistical mechanical interpretation of instantaneous codes. In2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORYPROCEEDINGS, VOLS 1-7 (2007), IEEE, pp. 1906–1910. IEEE InternationalSymposium on Information Theory, Nice, FRANCE, JUN 24-29, 2007.

[496] Tadaki, K. The Tsallis entropy and the Shannon entropy of a universal prob-ability. In 2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATIONTHEORY PROCEEDINGS, VOLS 1-6 (2008), IEEE; RIM; Ontario Cent Excel-lence; IBM Res; Microsoft Res, pp. 2111–2115. IEEE International Symposium onInformation Theory, Toronto, CANADA, JUL 06-11, 2008.

[497] Tadaki, K. A New Representation of Chaitin Omega Number Based on Com-pressible Strings. In UNCONVENTIONAL COMPUTATION, PROCEEDINGS(2010), Calude, CS and Hagiya, M and Morita, K and Rozenberg, G and Timmis,J, Ed., vol. 6079 of Lecture Notes in Computer Science, EATCS; Acad Europaea;Ctr Discrete Math & Theoret Comp Sci, pp. 127–139. 9th International Conferenceon Unconventional Computation, Univ Tokyo, Hongo Campus, Tokyo, JAPAN,JUN 21-25, 2010.

[498] Tadaki, K. The Hausdorff dimension of the halting self-similar sets of T-universalprefix-free machines. In 2010 IEEE INTERNATIONAL SYMPOSIUM ON IN-FORMATION THEORY (2010), IEEE International Symposium on InformationTheory, IEEE, pp. 1287–1291. 2010 IEEE International Symposium on InformationTheory, Austin, TX, JUL 13-13, 2010.

[499] Tadaki, K. A Chaitin Omega number based on compressible strings. NATURALCOMPUTING 11, 1, SI (MAR 2012), 117–128.

[500] Tadaki, K. A statistical mechanical interpretation of algorithmic informationtheory III: composite systems and fixed points. MATHEMATICAL STRUCTURESIN COMPUTER SCIENCE 22, 5, SI (OCT 2012), 752–770.

[501] Tadaki, K. Fixed point theorems on partial randomness. ANNALS OF PUREAND APPLIED LOGIC 163, 7, SI (JUL 2012), 763–774.

[502] Takenaka, Y., and Hashimoto, A. Shortening the computational time ofthe fluorescent DNA computing. In DNA COMPUTING (2003), Hagiya, M andOhuchi, A, Ed., vol. 2568 of LECTURE NOTES IN COMPUTER SCIENCE,Japan Sci & Technol Corp, pp. 85–94. 8th International Workshop on DNA-BasedComputers, HOKKAIDO UNIV, SAPPORO, JAPAN, JUN 10-13, 2002.

[503] TANGUIANE, A. MUSIC RECOGNITION BASED ON ARTIFICIAL PER-CEPTION APPROACH. INTERFACE-JOURNAL OF NEW MUSIC RE-SEARCH 22, 2 (MAY 1993), 133–149. 1ST GENERAL ASSEMBLY OF THEEUROPEAN SOC FOR THE COGNITIVE SCIENCES OF MUSIC, TRIESTE,ITALY, OCT 27-29, 1991.

45

[504] TANGUIANE, A. A PRINCIPLE OF CORRELATIVITY OF PERCEPTIONAND ITS APPLICATION TO MUSIC RECOGNITION. MUSIC PERCEPTION11, 4 (SUM 1994), 465–502.

[505] TANGUIANE, A. TOWARDS AXIOMATIZATION OF MUSIC PERCEPTION.JOURNAL OF NEW MUSIC RESEARCH 24, 3 (SEP 1995), 247–281.

[506] Tarau, P. Hereditarily Finite Representations of Natural Numbers and Self-Delimiting Codes. In MSFP 2010: PROCEEDINGS OF THE 2010 ACM SIG-PLAN WORKSHOP ON MATHEMATICALLY STRUCTURED FUNCTIONALPROGRAMMING (2010), ACM SIGPLAN, pp. 11–17. 3rd Workshop on Mathe-matically Structured Functional Programming, Baltimore, MD, SEP 25, 2010.

[507] Tarau, P. On Arithmetic Computations with Hereditarily Finite Sets, Functionsand Types. In THEORETICAL ASPECTS OF COMPUTING (2010), Cavalcanti,A and Deharbe, D and Gaudel, MC and Woodcock, J, Ed., vol. 6255 of LectureNotes in Computer Science, Univ Fed Rio Grande Norte; Univ York, pp. 367–381.7th International Colloquium Theoretical Aspects of Computing, Natal, BRAZIL,SEP 01-03, 2010.

[508] Toffoli, T., Capobianco, S., and Mentrasti, P. When - and how - can acellular automaton be rewritten as a lattice gas? THEORETICAL COMPUTERSCIENCE 403, 1 (AUG 20 2008), 71–88.

[509] Tomescu, I. On words containing all short subwords. THEORETICAL COM-PUTER SCIENCE 197, 1-2 (MAY 15 1998), 235–240.

[510] Tomescu, I. On the number of words containing the factor (aba)(k). DISCRETEAPPLIED MATHEMATICS 155, 11 (JUN 1 2007), 1506–1511.

[511] Trautteur, G. Analog computation and the continuum-discrete conundrum.In GROUNDING EFFECTIVE PROCESSES IN EMPIRICAL LAWS: REFLEC-TIONS ON THE NOTION OF ALGORITHM (1999), Lupacchini, R and Tam-burrini, G, Ed., Comune Cesena; F Enriques Ctr; ELSAG, pp. 23–42. Workshopon Symbols, Physical Processes, Biological Processes-Recent Explorations of theNotion of Algorithm, CESENA, ITALY, FEB 16, 1999.

[512] Turiel, T. P. Quantum random bit generators. AMERICAN STATISTICIAN61, 3 (AUG 2007), 255–259.

[513] Um, M., Zhang, X., Zhang, J., Wang, Y., Yangchao, S., Deng, D. L.,Duan, L.-M., and Kim, K. Experimental Certification of Random Numbers viaQuantum Contextuality. SCIENTIFIC REPORTS 3 (APR 9 2013).

[514] Uspensky, V., and Shen, A. Relations between varieties of Kolmogorov com-plexities. MATHEMATICAL SYSTEMS THEORY 29, 3 (MAY-JUN 1996), 271–292.

[515] Vasilieva, A., and Mischenko-Slatenkova, T. Quantum Query Algorithmsfor Conjunctions. In UNCONVENTIONAL COMPUTATION, PROCEEDINGS(2010), Calude, CS and Hagiya, M and Morita, K and Rozenberg, G and Timmis, J,Ed., vol. 6079 of Lecture Notes in Computer Science, EATCS; Acad Europaea; Ctr

46

Discrete Math & Theoret Comp Sci, pp. 140–151. 9th International Conference onUnconventional Computation, Univ Tokyo, Hongo Campus, Tokyo, JAPAN, JUN21-25, 2010.

[516] Vassiliadis, V., and Dounias, G. NATURE-INSPIRED INTELLIGENCE:A REVIEW OF SELECTED METHODS AND APPLICATIONS. INTERNA-TIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS 18, 4 (AUG2009), 487–516.

[517] Vazirani, U., and Vidick, T. Certifiable quantum dice. PHILOSOPHICALTRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSI-CAL AND ENGINEERING SCIENCES 370, 1971, SI (JUL 28 2012), 3432–3448.

[518] Wang, J., Yin, M., and Gu, W. Fuzzy multiset finite automata and theirlanguages. SOFT COMPUTING 17, 3 (MAR 2013), 381–390.

[519] Weerakoon, W. A. C., Karunananda, A. S., and Dias, N. G. J. A Tac-tics Memory for a New Theory of Computing. In PROCEEDINGS OF THE 20138TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDU-CATION (ICCSE 2013) (2013), Inst Elect & Elect Engineers; Natl Res CouncilComp Educ Coll & Univ; Inst Elect & Elect Engineers Sri Lanka Sect, pp. 153–158. 8th International Conference on Computer Science and Education (ICCSE),Sri Lanka Inst Informat Technol, Colombo, SRI LANKA, APR 26-28, 2013.

[520] WIEDERHOLD, G. DIGITAL LIBRARIES, VALUE, AND PRODUCTIVITY.COMMUNICATIONS OF THE ACM 38, 4 (APR 1995), 85–96.

[521] Wiedermann, J., and van Leeuwen, J. Relativistic computers and non-uniform complexity theory. In UNCONVENTIONAL MODELS IN COMPUTA-TION, PROCEEDINGS (2002), Calude, C and Dinneen, MJ and Peper, F, Ed.,vol. 2509 of Lecture Notes in Computer Science, Ctr Discrete Math & TheoretComp Sci; Adv Res Ctr Commun Res Lab, pp. 287–299. 3rd International Con-ference on Unconventional Models of Computation, KOBE, JAPAN, OCT 15-19,2002.

[522] Wiedermann, J., and van Leeuwen, J. What is Computation: An EpistemicApproach. In SOFSEM 2015: THEORY AND PRACTICE OF COMPUTER SCI-ENCE (2015), Italiano, GF and MargariaSteffen, T and Pokorny, J and Quisquater,JJ and Wattenhofer, R, Ed., vol. 8939 of Lecture Notes in Computer Science, CzechSoc Cybernet & Informat, pp. 1–13. 41st International Conference on CurrentTrends in Theory and Practice of Computer Science ((SOFSEM), Pecpod Snezkou,CZECH REPUBLIC, JAN 24-29, 2015.

[523] Wolf, M. J. Computation as Information Processing. In PHYSICAL COMPU-TATION AND COGNITIVE SCIENCE, vol. 12 of Studies in Applied PhilosophyEpistemology and Rational Ethics. 2014, pp. 133–166.

[524] Wu, C.-R., Chang, C.-W., and Chen, C.-C. Applying Expert Diagnosis Modelto Collaborative Design Systems. ADVANCED SCIENCE LETTERS 4, 4-5 (APR-MAY 2011), 1860–1861.

47

[525] Wu, G. Prefix-free languages and initial segments of computably enumerable de-grees. In COMPUTING AND COMBINATORICS (2001), Wang, J, Ed., vol. 2108of LECTURE NOTES IN COMPUTER SCIENCE, Chinese Acad Sci; China CompFederat, pp. 576–585. 7th Annual International Conference on Computing andCombinatorics, GUILIN, PEOPLES R CHINA, AUG 20-23, 2001.

[526] Xylogiannopoulos, K. F., Karampelas, P., and Alhajj, R. Experimen-tal Analysis on the Normality of pi, e, phi, root 2 Using Advanced Data-MiningTechniques. EXPERIMENTAL MATHEMATICS 23, 2 (2014), 105–128.

[527] Yamamoto, L. Code regulation in open ended evolution. In Genetic Program-ming, Proceedings (2007), ONeill, M and Ekart, A and Vanneschi, L and Es-parciaAlcazar, AI, Ed., vol. 4445 of LECTURE NOTES IN COMPUTER SCI-ENCE, pp. 271–280. 10th European Conference on Genetic Programming, Valen-cia, SPAIN, APR 11-13, 2007.

[528] YANG, E., and SHEN, S. CHAITIN COMPLEXITY, SHANNON-INFORMATION CONTENT OF A SINGLE EVENT AND INFINITE RANDOMSEQUENCES .1. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICSASTRONOMY & TECHNOLOGICAL SCIENCES 34, 10 (OCT 1991), 1183–1193.

[529] YANG, E., and SHEN, S. CHAITIN COMPLEXITY, SHANNON-INFORMATION CONTENT OF A SINGLE EVENT, AND INFINITE RANDOMSEQUENCES .2. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICSASTRONOMY 34, 11 (NOV 1991), 1307–1319.

[530] Yanofsky, N. Outer Limits of Reason: What Science, Mathematics, and LogicCannot Tell Us. In OUTER LIMITS OF REASON: WHAT SCIENCE, MATHE-MATICS, AND LOGIC CANNOT TELL US. 2013, pp. 1–403.

[531] Yun, A., Jeong, D., and Kim, J. AN EFFICIENT AND ACCURATE NU-MERICAL SCHEME FOR TURING INSTABILITY ON A PREDATOR-PREYMODEL. INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS 22,6 (JUN 2012).

[532] Zajicek, L. On sigma-porous sets in abstract spaces. ABSTRACT AND AP-PLIED ANALYSIS, 5 (2005), 509–534.

[533] Zavalov, O., Bocharova, V., Halamek, J., Halamkova, L., Korkmaz, S.,Arugula, M. A., Chinnapareddy, S., Katz, E., and Privman, V. Two-Input Enzymatic Logic Gates Made Sigmoid by Modifications of the BiocatalyticReaction Cascades. INTERNATIONAL JOURNAL OF UNCONVENTIONALCOMPUTING 8, 5-6, SI (2012), 347–365.

[534] Zavalov, O., Bocharova, V., Privman, V., and Katz, E. Enzyme-BasedLogic: OR Gate with Double-Sigmoid Filter Response. JOURNAL OF PHYSICALCHEMISTRY B 116, 32 (AUG 16 2012), 9683–9689.

[535] Zenil, H. Introducing the Computable Universe. In COMPUTABLE UNIVERSE:UNDERSTANDING AND EXPLORING NATURE AS COMPUTATION, Zenil,H, Ed. 2013, pp. 1–20.

48

[536] Zenil, H. Turing patterns with Turing machines: emergence and low-level struc-ture formation. NATURAL COMPUTING 12, 2, SI (JUN 2013), 291–303.

[537] Zenil, H., Delahaye, J.-P., and Gaucherel, C. Image characterization andclassification by physical complexity. COMPLEXITY 17, 3 (JAN-FEB 2012), 26–42.

[538] Zenil, H., Gershenson, C., Marshall, J. A. R., and Rosenblueth, D. A.Life as Thermodynamic Evidence of Algorithmic Structure in Natural Environ-ments. ENTROPY 14, 11 (NOV 2012), 2173–2191.

[539] Zenil, H., Kiani, N. A., and Tegner, J. Algorithmic complexity of motifs clus-ters superfamilies of networks. In 2013 IEEE INTERNATIONAL CONFERENCEON BIOINFORMATICS AND BIOMEDICINE (BIBM) (2013), Li, GZ and Kim,S and Hughes, M and McLachlan, G and Sun, H and Hu, X and Ressom, H andLiu, B and Liebman, M, Ed., IEEE International Conference on Bioinformaticsand Biomedicine-BIBM, IEEE; IEEE Comp Soc; Tongji Univ; IEEE Comp SocTech Comm Life Sci; China Acad Chinese Med Sci; Shanghai Assoc Syst Simulat.IEEE International Conference on Bioinformatics and Biomedicine (IEEE BIBM),Shanghai, PEOPLES R CHINA, DEC 18-21, 2013.

[540] Zenil, H., Soler-Toscano, F., Dingle, K., and Louis, A. A. Correlation ofautomorphism group size and topological properties with program-size complexityevaluations of graphs and complex networks. PHYSICA A-STATISTICAL ME-CHANICS AND ITS APPLICATIONS 404 (JUN 15 2014), 341–358.

[541] Zenil, H., Soler-Toscano, F., and Joosten, J. J. Empirical Encounters withComputational Irreducibility and Unpredictability. MINDS AND MACHINES 22,3 (AUG 2012), 149–165.

[542] Zenil, H., and Villarreal-Zapata, E. ASYMPTOTIC BEHAVIOR ANDRATIOS OF COMPLEXITY IN CELLULAR AUTOMATA. INTERNATIONALJOURNAL OF BIFURCATION AND CHAOS 23, 9 (SEP 2013).

[543] Zhang, B.-T. Hypernetworks: A molecular evolutionary architecture for cognitivelearning and memory. IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE3, 3 (AUG 2008), 49–63.

[544] Zhang, F., Liu, B., Liu, W., and Zhang, Q. DNA computing model based onlab-on-a-chip and its application on solving the timetabling problem. PROGRESSIN NATURAL SCIENCE-MATERIALS INTERNATIONAL 18, 5 (MAY 10 2008),633–637.

[545] Zheng, X. Closure properties of real number classes under limits and computableoperators. In COMPUTING AND COMBINATORICS, PROCEEDINGS (2000),Du, DZ and Eades, P and EstivillCastro, V and Lin, X and Sharma, A, Ed.,vol. 1858 of Lecture Notes in Computer Science, Univ New S Wales; Univ New-castle; Univ Sydney; Comp Sci Assoc Australasia, pp. 170–179. 6th Annual Inter-national Computing and Combinatorics Conference (COCOON 2000), SYDNEY,AUSTRALIA, JUL 26-28, 2000.

49

[546] Zheng, X. Recursive approximability of real numbers. MATHEMATICAL LOGICQUARTERLY 48, 1 (2002), 131–156. Dagstuhl Seminar on Computability andComplexity in Analysis, SCHLOSS DAGSTUHL, GERMANY, NOV 11-16, 2001.

[547] Zheng, X. On the hierarchies of Delta(0)(2)-real numbers. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS 41, 1 (JAN-MAR2007), 3–25. 6th Conference on Real Numbers and Computers, Dagstuhl, GER-MANY, NOV, 2004.

[548] Zheng, X., Lu, D., and Bao, K. Divergence bounded computable real numbers.THEORETICAL COMPUTER SCIENCE 351, 1 (FEB 14 2006), 27–38.

[549] Zhu, J., Zhang, L., Dong, S., and Wang, E. Four-Way Junction-Driven DNAStrand Displacement and Its Application in Building Majority Logic Circuit. ACSNANO 7, 11 (NOV 2013), 10211–10217.

[550] Ziegler, M. Physically-relativized Church-Turing Hypotheses: Physical foun-dations of computing and complexity theory of computational physics. APPLIEDMATHEMATICS AND COMPUTATION 215, 4 (OCT 15 2009), 1431–1447. Inter-national Workshop on Physics and Computation, Vienna, AUSTRIA, AUG 25-28,2008.

[551] ZIMAND, M. ON THE TOPOLOGICAL SIZE OF SETS OF RANDOMSTRINGS. ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUND-LAGEN DER MATHEMATIK 32, 1 (1986), 81–88.

[552] ZIMAND, M. ON RELATIVIZATIONS WITH RESTRICTED NUMBER OFACCESSES TO THE ORACLE SET. MATHEMATICAL SYSTEMS THEORY20, 1 (1987), 1–11.

[553] ZIMAND, M. IF NOT EMPTY, NP-P IS TOPOLOGICALLY LARGE. THEO-RETICAL COMPUTER SCIENCE 119, 2 (OCT 25 1993), 293–310.

[554] ZIMAND, M. ON THE TOPOLOGICAL SIZE OF P-M-COMPLETE DE-GREES. THEORETICAL COMPUTER SCIENCE 147, 1-2 (AUG 7 1995), 137–147.

[555] Zimand, M. A high-low Kolmogorov complexity law equivalent to the 0-1 Law.INFORMATION PROCESSING LETTERS 57, 2 (JAN 29 1996), 59–64.

[556] Zimand, M. Two sources are better than one for increasing the Kolmogorovcomplexity of infinite sequences. In COMPUTER SCIENCE - THEORY ANDAPPLICATIONS (2008), Hirsch, EA and Razborov, AA and Semenov, A andSlissenko, A, Ed., vol. 5010 of LECTURE NOTES IN COMPUTER SCIENCE,Russian Acad Sci, Inst Syst Programming; Moscow State Univ; Moscow Inst OPenEduc; Inst New Technol, pp. 326–338. 3rd International Computer Science Sym-posium, Russian Acad Sci, Dorodinicyn Comp Ctr, Moscow, RUSSIA, JUN 07-12,2008.

[557] Zimand, M. Counting Dependent and Independent Strings. In MATHEMATI-CAL FOUNDATIONS OF COMPUTER SCIENCE 2010 (2010), Hlineny, P andKucera, A, Ed., vol. 6281 of Lecture Notes in Computer Science, European Res

50

Consortium Informat & Math, pp. 689–700. 35th International Symposium onMathematical Foundations of Computer Science, Brno, CZECH REPUBLIC, AUG23-27, 2010.

[558] Zimand, M. Impossibility of Independence Amplification in Kolmogorov Com-plexity Theory. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCI-ENCE 2010 (2010), Hlineny, P and Kucera, A, Ed., vol. 6281 of Lecture Notesin Computer Science, European Res Consortium Informat & Math, pp. 701–712.35th International Symposium on Mathematical Foundations of Computer Science,Brno, CZECH REPUBLIC, AUG 23-27, 2010.

[559] Zimand, M. Generating Kolmogorov random strings from sources with limitedindependence. JOURNAL OF LOGIC AND COMPUTATION 23, 4, SI (AUG2013), 909–924.

[560] Zimand, M. Counting Dependent and Independent Strings. FUNDAMENTAINFORMATICAE 131, 3-4 (2014), 485–497.

Scopus

References

[1] Philosophy and The Hitchhiker’s Guide to the Galaxy Preface. In PHILOSO-PHY AND THE HITCHHIKER’S GUIDE TO THE GALAXY, Joll, N, Ed. 2012,pp. XI+.

[2] Abbott, A., Calude, C., and Svozil, K. Alastair Abbott, Cristian Calude andKarl Svozil describe - A QUANTUM RANDOM ORACLE. In ALAN TURING:HIS WORK AND IMPACT, Cooper, SB and VanLeeuwen, J, Ed. 2013, pp. 206–210.

[3] Abbott, A. A. De-quantisation of the quantum Fourier transform. APPLIEDMATHEMATICS AND COMPUTATION 219, 1 (SEP 15 2012), 3–13. 3rd In-ternational Workshop on Physics and Computation, EGYPT, AUG 30-SEP 06,2010.

[4] Abbott, A. A. The Deutsch-Jozsa problem: de-quantisation and entanglement.NATURAL COMPUTING 11, 1, SI (MAR 2012), 3–11.

[5] Abbott, A. A., Bechmann, M., Calude, C. S., and Sebald, A. A Nu-clear Magnetic Resonance Implementation of a Classical Deutsch-Jozsa Algorithm.INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING 8, 2(2012), 161–175.

[6] Abbott, A. A., Calude, C. S., Conder, J., and Svozil, K. Strong Kochen-Specker theorem and incomputability of quantum randomness. PHYSICAL RE-VIEW A 86, 6 (DEC 17 2012).

[7] Abbott, A. A., Calude, C. S., and Svozil, K. A quantum random numbergenerator certified by value indefiniteness. MATHEMATICAL STRUCTURES INCOMPUTER SCIENCE 24, 3, SI (JUN 2014).

51

[8] Abbott, A. A., Calude, C. S., and Svozil, K. Value-indefinite observablesare almost everywhere. PHYSICAL REVIEW A 89, 3 (MAR 10 2014).

[9] Abbott, A. A., Calude, C. S., and Svozil, K. A variant of the Kochen-Specker theorem localising value indefiniteness. JOURNAL OF MATHEMATICALPHYSICS 56, 10 (OCT 2015).

[10] Abbott, A. A., Calude, C. S., and Svozil, K. On the Unpredictabilityof Individual Quantum Measurement Outcomes. In FIELDS OF LOGIC ANDCOMPUTATION II: ESSAYS DEDICATED TO YURI GUREVICH ON THEOCCASION OF HIS 75TH BIRTHDAY (2015), Beklemishev, LD and Blass, Aand Dershowitz, N and Finkbeiner, B and Schulte, W, Ed., vol. 9300 of LectureNotes in Computer Science, pp. 69–86. Symposium on Logic in Computer ScienceCelebrating Yuri Gurevich’s 75th Birthday (YuriFest), Tech Univ Berlin, Berlin,GERMANY, SEP 11-12, 2015.

[11] Adamatzky, A. Encapsulating reaction-diffusion computers. In MACHINES,COMPUTATIONS, AND UNIVERSALITY, PROCEEDINGS (2007), Durand-Lose, J and Margenstern, M, Ed., vol. 4664 of Lecture Notes in Computer Science,Lab Informat Fond Orleans; Univ Orleans; Univ Meta, LITA; Conseil Reg, RegCtr; Conseil Gen Loiret; Mairie Orleans; GDR 673 CNRS Informat Math, pp. 1–11. 5th International Conference on Machines, Computations, and Universality,Orleans, FRANCE, SEP 10-13, 2007.

[12] Adamatzky, A. Hot ice computer. PHYSICS LETTERS A 374, 2 (DEC 282009), 264–271.

[13] Adamatzky, A. Advances in Physarum Machines Gates, Hulls, Mazes and Rout-ing with Slime Mould. In APPLICATIONS, TOOLS AND TECHNIQUES ONTHE ROAD TO EXASCALE COMPUTING (2012), DeBosschere, K and DHol-lander, EH and Joubert, GR and Padua, D and Peters, F, Ed., vol. 22 of Advancesin Parallel Computing, pp. 41–54. 14th Biennial ParCo Conference (ParCo), Ghent,BELGIUM, AUG 31-SEP 03, 2011.

[14] Adamatzky, A. Towards plant wires. BIOSYSTEMS 122 (AUG 2014), 1–6.

[15] Adamatzky, A., and Martinez, G. J. Bio-Imitation of Mexican MigrationRoutes to the USA with Slime Mould on 3D Terrains. JOURNAL OF BIONICENGINEERING 10, 2 (APR 2013), 242–250.

[16] Adamatzky, A. I. Route 20, Autobahn 7, and Slime Mold: Approximating theLongest Roads in USA and Germany With Slime Mold on 3-D Terrains. IEEETRANSACTIONS ON CYBERNETICS 44, 1 (JAN 2014), 126–136.

[17] Akl, S. G. Even accelerating machines are not universal. INTERNATIONALJOURNAL OF UNCONVENTIONAL COMPUTING 3, 2 (2007), 105–121.

[18] Akl, S. G. Evolving Computational Systems. In HANDBOOK OF PARALLELCOMPUTING: MODELS, ALGORITHMS AND APPLICATIONS, Rajasekaran,S and Reif, J, Ed., Chapman & Hall-CRC Computer and Information ScienceSeries. 2008.

52

[19] Alexandru, A., and Ciobanu, G. Algebraic Properties of Generalized Mul-tisets. In 2013 15TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC ANDNUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2013)(2014), Bjorner, N and Negru, V and Ida, T and Jebelean, T and Petcu, D andWatt, S and Zaharie, D, Ed., IEEE; IEEE Comp Soc, pp. 367–374. 15th Interna-tional Symposium on Symbolic and Numeric Algorithms for Scientific Computing(SYNASC), Timisoara, ROMANIA, SEP 23-26, 2013.

[20] Alford, G. Explicitly constructing universal extended H systems. In UNCON-VENTIONAL MODELS OF COMPUTATION (1998), Calude, CS and Casti, Jand Dinneen, MJ, Ed., SPRINGER SERIES IN DISCRETE MATHEMATICSAND THEORETICAL COMPUTER SCIENCE, Univ Auckland; Ctr DiscreteMath & Theoret Comp Sci; Santa Fe Inst, pp. 108–117. 1st International Confer-ence on Unconventional Models of Computation (UMC 98), UNIV AUCKLAND,AUCKLAND, NEW ZEALAND, JAN 05-09, 1998.

[21] Alhazov, A., Freund, R., and Morita, K. Reversibility and Determinism inSequential Multiset Rewriting. In UNCONVENTIONAL COMPUTATION, PRO-CEEDINGS (2010), Calude, CS and Hagiya, M and Morita, K and Rozenberg, Gand Timmis, J, Ed., vol. 6079 of Lecture Notes in Computer Science, EATCS; AcadEuropaea; Ctr Discrete Math & Theoret Comp Sci, pp. 21–31. 9th InternationalConference on Unconventional Computation, Univ Tokyo, Hongo Campus, Tokyo,JAPAN, JUN 21-25, 2010.

[22] Alhazov, A., Freund, R., and Morita, K. Sequential and maximally parallelmultiset rewriting: reversibility and determinism. NATURAL COMPUTING 11,1, SI (MAR 2012), 95–106.

[23] Alhazov, A., and Morita, K. On Reversibility and Determinism in P Systems.In MEMBRANE COMPUTING (2010), Paun, G and Perez Jimenez, MJ andRiscos Nunez, A and Rozenberg, G and Salomaa, A, Ed., vol. 5957 of Lecture Notesin Computer Science, Int Assoc Pattern Recognit; Informat Technol Ind Dev Agcy;Microsoft Innovat Lab Cairo; Nile Univ; Univ Surrey; Univ Cagliari, pp. 158–168.10th International Workshop on Membrane Computing9th International Workshopon Multiple Classifier Systems, Natl Coll Valaicu Voda Curtea de Arges, Curteade Arges, ROMANIACairo, EGYPT, AUG 24-27, 2009APR 07-09, 2010.

[24] Aman, B., and Ciobanu, G. Verification of membrane systems with delays viaPetri nets with delays. THEORETICAL COMPUTER SCIENCE 598 (SEP 202015), 87–101.

[25] Aman, B., Csuhaj-Varju, E., and Freund, R. Red-Green P Automata. InMEMBRANE COMPUTING (CMC 2014) (2014), Gheorghe, M and Rozenberg,G and Salomaa, A and Sosik, P and Zandron, C, Ed., vol. 8961 of Lecture Notes inComputer Science, Silesian Univ, Fac Philosophy & Sci, Inst Comp Sci, pp. 139–157. 15th International Conference on Membrane Computing (CMC), Prague,CZECH REPUBLIC, AUG 20-22, 2014.

[26] Ambos-Spies, K., Weihrauch, K., and Zheng, X. Weakly computable realnumbers. JOURNAL OF COMPLEXITY 16, 4 (DEC 2000), 676–690.

53

[27] An, L., Tong, L., and Fan, W. Mining decision rules based on in-sim-dominancerelations. In PROGRESS IN INTELLIGENCE COMPUTATION AND APPLI-CATIONS, PROCEEDINGS (2007), Zeng, S and Liu, Y and Zhang, Q and Kang,L, Ed., pp. 448–452. 2nd International Symposium on Intelligence Computationand Application (ISICA 2007), Wuhan, PEOPLES R CHINA, SEP 21-23, 2007.

[28] Andreka, H., Madarasz, J. X., Nemeti, I., Stannett, M., and Szekely,G. Faster than light motion does not imply time travel. CLASSICAL AND QUAN-TUM GRAVITY 31, 9 (MAY 7 2014).

[29] Androutsopoulos, K., Clark, D., Harman, M., Hierons, R. M., Li, Z.,and Tratt, L. Amorphous Slicing of Extended Finite State Machines. IEEETRANSACTIONS ON SOFTWARE ENGINEERING 39, 7 (JUL 2013), 892–909.

[30] Apolloni, B., and Gentile, C. Sample size lower bounds in PAC learning byAlgorithmic Complexity Theory. THEORETICAL COMPUTER SCIENCE 209,1-2 (DEC 6 1998), 141–162.

[31] Archibald, M., Brattka, V., and Heuberger, C. Randomness with respectto the signed-digit representation. FUNDAMENTA INFORMATICAE 83, 1-2(2008), 1–19.

[32] Arrighi, P., and Dowek, G. THE PHYSICAL CHURCH-TURING THESISAND THE PRINCIPLES OF QUANTUM THEORY. INTERNATIONAL JOUR-NAL OF FOUNDATIONS OF COMPUTER SCIENCE 23, 5, SI (AUG 2012),1131–1145.

[33] Artacho, F. J. A., Bailey, D. H., Borwein, J. M., and Borwein, P. B.Walking on Real Numbers. MATHEMATICAL INTELLIGENCER 35, 1 (MAR2013), 42–60.

[34] Arugula, M. A., Shroff, N., Katz, E., and He, Z. Molecular AND logicgate based on bacterial anaerobic respiration. CHEMICAL COMMUNICATIONS48, 82 (2012), 10174–10176.

[35] Arulanandham, J. Implementing bead-sort with P systems. In UNCONVEN-TIONAL MODELS IN COMPUTATION, PROCEEDINGS (2002), Calude, C andDinneen, MJ and Peper, F, Ed., vol. 2509 of LECTURE NOTES IN COMPUTERSCIENCE, Ctr Discrete Math & Theoret Comp Sci; Adv Res Ctr Commun ResLab, pp. 115–125. 3rd International Conference on Unconventional Models of Com-putation, KOBE, JAPAN, OCT 15-19, 2002.

[36] Aur, D., Jog, M., and Poznanski, R. R. Computing by physical interactionin neurons. JOURNAL OF INTEGRATIVE NEUROSCIENCE 10, 4 (DEC 2011),413–422.

[37] Aur, D., and Jog, M. S. Models of Brain Computation. In NEUROELECTRO-DYNAMICS: UNDERSTANDING THE BRAIN LANGUAGE, vol. 74 of Biomed-ical and Health Research. 2010, pp. 95–166.

[38] Baez, J., and Stay, M. Algorithmic thermodynamics. MATHEMATICALSTRUCTURES IN COMPUTER SCIENCE 22, 5, SI (OCT 2012), 771–787.

54

[39] Bailey, D. H., Barrio, R., and Borwein, J. M. High-precision computation:Mathematical physics and dynamics. APPLIED MATHEMATICS AND COMPU-TATION 218, 20 (JUN 15 2012), 10106–10121.

[40] Bailey, D. H., and Borwein, J. Pi Day Is Upon Us Again and We Still Do NotKnow if Pi Is Normal. AMERICAN MATHEMATICAL MONTHLY 121, 3 (MAR2014), 191–206.

[41] Bailey, D. H., and Borwein, J. M. Nonnormality of Stoneham constants.RAMANUJAN JOURNAL 29, 1-3 (DEC 2012), 409–422.

[42] Bailey, D. H., Borwein, J. M., Calude, C. S., Dinneen, M. J., Du-mitrescu, M., and Yee, A. An Empirical Approach to the Normality of pi.EXPERIMENTAL MATHEMATICS 21, 4 (2012), 375–384.

[43] Bailly, F., and Longo, G. Phenomenology of incompleteness: From formaldeductions to mathematics and physics. In DEDUCTION, COMPUTATION, EX-PERIMENT: EXPLORING THE EFFECTIVENESS OF PROOF (2008), Lupac-chini, R and Corsi, G, Ed., Univ Bologna, pp. 243–271. Workshop on Deduction,Computation, Experiment - Exploring the Effectiveness of Proof‘, Bologna, ITALY,APR 03-04, 2007.

[44] Bakshi, S., Zavalov, O., Halamek, J., Privman, V., and Katz, E. Mod-ularity of Biochemical Filtering for Inducing Sigmoid Response in Both Inputs inan Enzymatic AND Gate. JOURNAL OF PHYSICAL CHEMISTRY B 117, 34(AUG 29 2013), 9857–9865.

[45] Balanescu, T., Gheorghe, M., Holcombe, M., and Ipate, F. EilenbergP systems. In MEMBRANE COMPUTING (2003), Paun, G and Rozenberg, Gand Salomaa, A and Zandron, C, Ed., vol. 2597 of LECTURE NOTES IN COM-PUTER SCIENCE, pp. 43–57. International Workshop on Membrane Computing,CURTEA DE ARGES, ROMANIA, AUG 19-23, 2002.

[46] Banatre, J. P., Fradet, P., and Radenac, Y. Generalised multisets forchemical programming. MATHEMATICAL STRUCTURES IN COMPUTER SCI-ENCE 16, 4 (AUG 2006), 557–580. 1st International Workshop on Developmentsin Computational Models (DCM), Lisbon, PORTUGAL, JUL 10, 2005.

[47] Barbagallo, S., Consoli, S., Pappalardo, N., Greco, S., and Zimbone,S. Discovering reservoir operating rules by a Rough Set approach. WATER RE-SOURCES MANAGEMENT 20, 1 (FEB 2006), 19–36.

[48] Barbuti, R., Maggiolo-Schettini, A., Milazzo, P., and Tini, S. Mem-brane Systems Working in Generating and Accepting Modes: Expressiveness andEncodings. In MEMBRANE COMPUTING (2010), Gheorghe, M and Hinze, Tand Paun, G and Rozenberg, G and Salomaa, A, Ed., vol. 6501 of Lecture Notesin Computer Science, pp. 103–118. 11th International Conference on MembraneComputing, Jena, GERMANY, AUG 24-27, 2010.

[49] Barmpalias, G. ALGORITHMIC RANDOMNESS AND MEASURES OF COM-PLEXITY. BULLETIN OF SYMBOLIC LOGIC 19, 3 (SEP 2013), 318–350.

55

[50] Barmpalias, G., Brodhead, P., Cenzer, D., Dashti, S., and Weber, R.Algorithmic randomness of closed sets. JOURNAL OF LOGIC AND COMPU-TATION 17, 6 (DEC 2007), 1041–1062. Conference on Logical Approaches toComputational Barriers, Univ Wales Swansea, Swansea, WALES, JUL, 2006.

[51] Barmpalias, G., and Dowe, D. L. Universality probability of a prefix-freemachine. PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES 370, 1971, SI(JUL 28 2012), 3488–3511.

[52] Barmpalias, G., and Downey, R. G. EXACT PAIRS FOR THE IDEAL OFTHE K-TRIVIAL SEQUENCES IN THE TURING DEGREES. JOURNAL OFSYMBOLIC LOGIC 79, 3 (SEP 2014), 676–692.

[53] Barmpalias, G., Hoelzl, R., Lewis, A. E. M., and Merkle, W. Analoguesof Chaitin’s Omega in the computably enumerable sets. INFORMATION PRO-CESSING LETTERS 113, 5-6 (MAR 2013), 171–178.

[54] Barmpalias, G., and Lewis, A. The ibT degrees of computably enumerablesets are not dense. ANNALS OF PURE AND APPLIED LOGIC 141, 1-2 (AUG2006), 51–60.

[55] Barmpalias, G., and Li, A. Kolmogorov complexity and computably enumer-able sets. ANNALS OF PURE AND APPLIED LOGIC 164, 12, SI (DEC 2013),1187–1200.

[56] Barnett, N. S., and Dragomir, S. S. Some remarks on the noiseless cod-ing theorem. In Inequality Theory and Applications, Vol 4 (2007), Kim, JK andDragomir, SS, Ed., vol. 4 of Inequality Theory and Applications, Kyungnam Univ,Inst Basic Sci Res; GNU Res, Inst Natl Sci; Korean Math Soc; Nova Sci Publish-ers, pp. 11–14. 8th International Conference on Nonlinear Functional Analysis andApplications, Gyeongsang Natl Univ, Chinju, SOUTH KOREA, AUG 09-13, 2004.

[57] Barnsley, M. F., and Lesniak, K. The Chaos Game on a General IteratedFunction System from a Topological Point of View. INTERNATIONAL JOURNALOF BIFURCATION AND CHAOS 24, 11 (NOV 2014).

[58] Basic, B. ON “VERY PALINDROMIC” SEQUENCES. JOURNAL OF THEKOREAN MATHEMATICAL SOCIETY 52, 4 (JUL 2015), 765–780.

[59] Becher, V., Daicz, S., and Chaitin, G. A highly random number. In COMBI-NATORICS, COMPUTABILITY AND LOGIC (2001), Calude, CS and Dinneen,MJ and Sburlan, S, Ed., DISCRETE MATHEMATICS AND THEORETICALCOMPUTER SCIENCE (SERIES), Fac Math & Comp Sci; Ovidius Univ; UnivAuckland, Ctr Discrete Math & Theoret Sci, pp. 55–68. 3rd International Con-ference on Discrete Mathematics and Theoretical Computer Science (DMTCS 01),CONSTANTA, ROMANIA, 2001.

[60] Becher, V., Figueira, S., Grigorieff, S., and Miller, J. S. Randomnessand halting probabilities. JOURNAL OF SYMBOLIC LOGIC 71, 4 (DEC 2006),1411–1430.

56

[61] Becher, V., and Grigorieff, S. Random reals a la Chaitin with or withoutprefix-freeness. THEORETICAL COMPUTER SCIENCE 385, 1-3 (OCT 15 2007),193–201.

[62] Becher, V., and Heiber, P. A. A linearly computable measure of string com-plexity. THEORETICAL COMPUTER SCIENCE 438 (JUN 22 2012), 62–73.

[63] Bechmann, M., Sebald, A., and Stepney, S. Boolean Logic Gate Design Prin-ciples in Unconventional Computers: an NMR Case Study. INTERNATIONALJOURNAL OF UNCONVENTIONAL COMPUTING 8, 2 (2012), 139–159.

[64] Beggs, E., Costa, J. F., Loff, B., and Tucker, J. V. Oracles and adviceas measurements. In UNCONVENTIONAL COMPUTATION, PROCEEDINGS(2008), Calude, CS and Costa, JF and Freund, R and Oswald, M and Rozenberg,G, Ed., vol. 5204 of LECTURE NOTES IN COMPUTER SCIENCE, EATCS;Vienna Univ Technol; Ctr Discrete Math & Theoret Comp Sci, pp. 33–50. 7th In-ternational Conference on Unconventional Computation, Vienna, AUSTRIA, AUG25-28, 2008.

[65] Beggs, E. J., Costa, J. F., and Tucker, J. V. Axiomatizing physical ex-periments as oracles to algorithms. PHILOSOPHICAL TRANSACTIONS OFTHE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEER-ING SCIENCES 370, 1971, SI (JUL 28 2012), 3359–3384.

[66] Bel-Enguix, G., and Jimenez-Lopez, M. D. Dynamic meaning membranesystems: An application to the description of semantic change. FUNDAMENTAINFORMATICAE 76, 3 (MAR 2007), 219–237.

[67] Benatti, F., Oskouei, S. K., and Abad, A. S. D. Gacs quantum algorithmicentropy in infinite dimensional Hilbert spaces. JOURNAL OF MATHEMATICALPHYSICS 55, 8 (AUG 2014).

[68] Bergeron, A., and Hamel, S. Fast implementations of automata computations.In IMPLEMENTATION AND APPLICATION OF AUTOMATA (2001), Yu, Sand Paun, A, Ed., vol. 2088 of LECTURE NOTES IN COMPUTER SCIENCE,EATCS; ACM SIGACT, pp. 47–56. 5th International Conference on Implemen-tation and Application of Automata, UNIV WESTERN ONTARIO, LONDON,CANADA, JUL 24-25, 2000.

[69] Bienvenu, L., Desfontaines, D., and Shen, A. What Percentage of ProgramsHalt? In Automata, Languages, and Programming, Pt I (2015), Halldorsson, MMand Iwama, K and Kobayashi, N and Speckmann, B, Ed., vol. 9134 of Lecture Notesin Computer Science, pp. 219–230. 42nd International Colloquium on Automata,Languages and Programming (ICALP), Kyoto, JAPAN, JUL 06-10, 2015.

[70] Bienvenu, L., Doty, D., and Stephan, F. Constructive Dimension and TuringDegrees. THEORY OF COMPUTING SYSTEMS 45, 4 (NOV 2009), 740–755. 3rdComputability in Europe Conference 2007, Univ Siena, Siena, ITALY, 2007.

[71] Bienvenu, L., Romashchenko, A., Shen, A., Taveneaux, A., and Ver-meeren, S. The axiomatic power of Kolmogorov complexity. ANNALS OF PUREAND APPLIED LOGIC 165, 9, SI (SEP 2014), 1380–1402.

57

[72] Bienvenu, L., and Sablik, M. The dynamics of cellular automata in shift-invariant topologies. In Developments in Language Theory, Proceedings (2007),Harju, T and Karhumaki, J and Lepisto, A, Ed., vol. 4588 of LECTURE NOTESIN COMPUTER SCIENCE, Acak Finland; Finnish Cultural Fdn; Finnish AcadSci & Letters; Nokia Fdn; Turku Univ Fdn; Ctr Hotel; Univ Turku, Dept Math &Ctr Fundamentals Comp & Discrete Math, pp. 84–95. 11th International Confer-ence on Developments in Language Theory, Univ Turku, Turku, FINLAND, JUL03-06, 2007.

[73] Blanchard, F., Cervelle, J., and Formenti, E. Periodicity and transitivityfor cellular automata in Besicovitch topologies. In MATHEMATICAL FOUN-DATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS (2003), Rovan, Band Vojtas, P, Ed., vol. 2747 of LECTURE NOTES IN COMPUTER SCIENCE,Slovak Soc Comp Sci; Comenius Univ, Fac Math, Phys & Informat, pp. 228–238.28th International Symposium on Mathematical Foundations of Computer Science,BRATISLAVA, SLOVAKIA, AUG 25-29, 2003.

[74] Bocharova, V., MacVittie, K., Chinnapareddy, S., Halamek, J., Priv-man, V., and Katz, E. Realization of Associative Memory in an EnzymaticProcess: Toward Biomolecular Networks with Learning and Unlearning Function-alities. JOURNAL OF PHYSICAL CHEMISTRY LETTERS 3, 10 (MAY 17 2012),1234–1237.

[75] Bocharova, V., Zavalov, O., MacVittie, K., Arugula, M. A., Guz, N. V.,Dokukin, M. E., Halamek, J., Sokolov, I., Privman, V., and Katz, E.A biochemical logic approach to biomarker-activated drug release. JOURNAL OFMATERIALS CHEMISTRY 22, 37 (2012), 19709–19717.

[76] Borwein, J. M. The Future of Mathematics 1965 to 2065. In CENTURY OFADVANCING MATHEMATICS, Kennedy, SF, Ed. 2015, pp. 313–329.

[77] Boschetti, F., and Gray, R. A Turing Test for Emergence. In ADVANCESIN APPLIED SELF-ORGANIZING SYSTEMS, Prokopenko, M, Ed., AdvancedInformation and Knowledge Processing. 2008, pp. 349–364.

[78] BRIDGES, D. CONSTRUCTIVE MATHEMATICS AND UNBOUNDED OP-ERATORS - A REPLY TO HELLMAN. JOURNAL OF PHILOSOPHICALLOGIC 24, 5 (OCT 1995), 549–561.

[79] BRIDGES, D., and CALUDE, C. ON RECURSIVE BOUNDS FOR THEEXCEPTIONAL VALUES IN SPEED-UP. THEORETICAL COMPUTER SCI-ENCE 132, 1-2 (SEP 26 1994), 387–394.

[80] Bridges, D., Ishihara, H., Mines, R., Richman, F., Schuster, P., andVita, L. Almost locatedness in uniform spaces. CZECHOSLOVAK MATHE-MATICAL JOURNAL 57, 1 (2007), 1–12.

[81] Bridges, D., Schuster, P., and Vita, L. Apartness, topology, and uniformity:a constructive view. MATHEMATICAL LOGIC QUARTERLY 48, 1 (2002), 16–28. Dagstuhl Seminar on Computability and Complexity in Analysis, SCHLOSSDAGSTUHL, GERMANY, NOV 11-16, 2001.

58

[82] Brown, S. R. Emergence in the central nervous system. COGNITIVE NEURO-DYNAMICS 7, 3 (JUN 2013), 173–195.

[83] Brukner, C. Quantum experiments can test mathematical undecidability. In UN-CONVENTIONAL COMPUTATION, PROCEEDINGS (2008), Calude, CS andCosta, JF and Freund, R and Oswald, M and Rozenberg, G, Ed., vol. 5204 ofLecture Notes in Computer Science, EATCS; Vienna Univ Technol; Ctr DiscreteMath & Theoret Comp Sci, pp. 1–5. 7th International Conference on Uncon-ventional Computation/International Workshop on Computing with Biomolecules,Vienna, AUSTRIA, AUG 25-28, 2008.

[84] Brunet, O. A priori knowledge and the Kochen-Specker theorem. PHYSICSLETTERS A 365, 1-2 (MAY 21 2007), 39–43.

[85] Buhagiar, D., Chetcuti, E., and Dvurecenskij, A. On Gleason’s Theoremwithout Gleason. FOUNDATIONS OF PHYSICS 39, 6 (JUN 2009), 550–558.

[86] Burgin, M. Measuring Power of Algorithms, Computer Programs and Informa-tion Automata. In MEASURING POWER OF ALGORITHMS, COMPUTERPROGRAMS AND INFORMATION AUTOMATA. 2010, pp. 1–347.

[87] Burgin, M., Calude, C. S., and Calude, E. INDUCTIVE COMPLEXITYMEASURES FOR MATHEMATICAL PROBLEMS. INTERNATIONAL JOUR-NAL OF FOUNDATIONS OF COMPUTER SCIENCE 24, 4 (JUN 2013), 487–500.

[88] Busi, N. Causality in membrane systems. In MEMBRANE COMPUTING (2007),Eleftherakis, G and Kefalas, P and Paun, G and Rozenberg, G and Salomaa, A,Ed., vol. 4860 of Lecture Notes in Computer Science, pp. 160–171. 8th InternationalWorkshop on Membrane Computing, Thessaloniki, GREECE, JUN 25-28, 2007.

[89] Busi, N. Using well-structured transition systems to decide divergence for catalyticP systems. THEORETICAL COMPUTER SCIENCE 372, 2-3 (MAR 15 2007),125–135. 4th Brainstorming Week on Membrane Computing, Seville, SPAIN, JAN30-FEB 03, 2006.

[90] Calu, D. J., Stalnaker, T. A., Franz, T. M., Singh, T., Shaham, Y., andSchoenbaum, G. Withdrawal from cocaine self-administration produces long-lasting deficits in orbitofrontal-dependent reversal learning in rats. LEARNING &MEMORY 14, 5 (MAY 2007), 325–328.

[91] CALUDE, C. METRIZABILITY OF FREE MONOIDS. DISCRETE MATHE-MATICS 15, 4 (1976), 307–310.

[92] CALUDE, C. DARBOUX PROPERTY AND PRIMITIVE RECURSIVEFUNCTIONS. REVUE ROUMAINE DE MATHEMATIQUES PURES ET AP-PLIQUEES 26, 9 (1981), 1187–1192.

[93] CALUDE, C. NOTE ON A HIERARCHY OF PRIMITIVE RECURSIVEFUNCTIONS. REVUE ROUMAINE DE MATHEMATIQUES PURES ET AP-PLIQUEES 27, 9 (1982), 935–936.

59

[94] CALUDE, C. SUPER-EXPONENTIALS NONPRIMITIVE RECURSIVE, BUTRUDIMENTARY. INFORMATION PROCESSING LETTERS 25, 5 (JUL 101987), 311–315.

[95] CALUDE, C. RELATIVIZED TOPOLOGICAL SIZE OF SETS OF PARTIALRECURSIVE FUNCTIONS. THEORETICAL COMPUTER SCIENCE 87, 2(SEP 23 1991), 347–352.

[96] Calude, C., Calude, E., Svozil, K., and Yu, S. Physical versus computa-tional complementarity .1. INTERNATIONAL JOURNAL OF THEORETICALPHYSICS 36, 7 (JUL 1997), 1495–1523.

[97] CALUDE, C., and CAMPEANU, C. NOTE ON THE TOPOLOGICAL-STRUCTURE OF RANDOM STRINGS. THEORETICAL COMPUTER SCI-ENCE 112, 2 (MAY 10 1993), 383–390.

[98] CALUDE, C., and CHITESCU, I. STRONG NON-COMPUTABILITY OFRANDOM STRINGS. INTERNATIONAL JOURNAL OF COMPUTER MATH-EMATICS 11, 1 (1982), 43–45.

[99] CALUDE, C., and CHITESCU, I. ON REPRESENTABILITY OF P-MARTIN-LOF TESTS. KYBERNETIKA 19, 1 (1983), 42–47.

[100] CALUDE, C., and CHITESCU, I. REPRESENTABILITY OF RECURSIVEMARTINLOF,P. TESTS. KYBERNETIKA 19, 6 (1983), 526–536.

[101] CALUDE, C., and CHITESCU, I. A COMBINATORIAL CHARACTERIZA-TION OF SEQUENTIAL MARTINLOF,P TESTS. INTERNATIONAL JOUR-NAL OF COMPUTER MATHEMATICS 17, 1 (1985), 53–64.

[102] CALUDE, C., and CHITESCU, I. QUALITATIVE PROPERTIES OFMARTIN-LOF,P. RANDOM SEQUENCES. BOLLETTINO DELLA UNIONEMATEMATICA ITALIANA 3B, 1 (MAR 1989), 229–240.

[103] CALUDE, C., and CHITESCU, I. UPPER LIMITATION OF KOL-MOGOROV COMPLEXITY AND UNIVERSAL MARTINLOF,P. TESTS.JOURNAL OF COMPUTATIONAL MATHEMATICS 7, 1 (JAN 1989), 61–70.

[104] CALUDE, C., and ISTRATE, G. DETERMINING AND STATIONARY SETSFOR SOME CLASSES OF PARTIAL RECURSIVE FUNCTIONS. THEORETI-CAL COMPUTER SCIENCE 82, 1 (MAY 22 1991), 151–155.

[105] CALUDE, C., ISTRATE, G., and ZIMAND, M. RECURSIVE BAIRE CLAS-SIFICATION AND SPEEDABLE FUNCTIONS. ZEITSCHRIFT FUR MATH-EMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK 38, 2 (1992),169–178.

[106] CALUDE, C., JURGENSEN, H., and ZIMAND, M. IS INDEPENDENCEAN EXCEPTION. APPLIED MATHEMATICS AND COMPUTATION 66, 1(NOV 1994), 63–76.

[107] CALUDE, C., and SANTEAN, L. ON A THEOREM OF ASSER,GUNTER.ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DERMATHEMATIK 36, 2 (1990), 143–147.

60

[108] Calude, C., Staiger, L., and Stay, M. Cristian Calude, Ludwig Staiger andMichael Stay on - HALTING AND NON-HALTING TURING COMPUTATIONS.In ALAN TURING: HIS WORK AND IMPACT, Cooper, SB and VanLeeuwen,J, Ed. 2013, pp. 105–109.

[109] CALUDE, C., and TATARAM, M. UNIVERSAL SEQUENCES OF PRIM-ITIVE RECURSIVE FUNCTIONS. REVUE ROUMAINE DE MATHEMA-TIQUES PURES ET APPLIQUEES 28, 5 (1983), 381–389.

[110] CALUDE, C., and VAIDA, D. EHRENFEUCHT TEST SET THEOREMAND HILBERT BASIS THEOREM - A CONSTRUCTIVE GLIMPSE. LEC-TURE NOTES IN COMPUTER SCIENCE 379 (1989), 177–184.

[111] CALUDE, C., and ZIMAND, M. A RELATION BETWEEN CORRECTNESSAND RANDOMNESS IN THE COMPUTATION OF PROBABILISTIC ALGO-RITHMS. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 16,1 (1984), 47–53.

[112] Calude, C., and Zimand, M. Effective category and measure in abstract com-plexity theory. THEORETICAL COMPUTER SCIENCE 154, 2 (FEB 5 1996),307–327.

[113] Calude, C. S., and Calude, E. Algorithmic Complexity of Mathematical Prob-lems: An Overview of Results and Open Problems. INTERNATIONAL JOURNALOF UNCONVENTIONAL COMPUTING 9, 3-4 (2013), 327–343.

[114] Calude, C. S., Calude, E., and Queen, M. S. The complexity of Euler’sinteger partition theorem. THEORETICAL COMPUTER SCIENCE 454 (OCT5 2012), 72–80.

[115] Calude, C. S., and Cooper, S. B. Introduction: computability of the physical.MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE 22, 5, SI (OCT2012), 723–728.

[116] Calude, C. S., and Desfontaines, D. Anytime Algorithms for Non-EndingComputations. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COM-PUTER SCIENCE 26, 4 (JUN 2015), 465–475.

[117] Calude, C. S., and Desfontaines, D. Universality and Almost Decidability.FUNDAMENTA INFORMATICAE 138, 1-2, SI (2015), 77–84.

[118] Calude, C. S., and Gheorghe, M. Formal Models - Computability, Complexity,Applications Preface. FUNDAMENTA INFORMATICAE 131, 3-4 (2014), I–IV.

[119] Calude, C. S., and Lewis, J. P. Is there a universal image generator? AP-PLIED MATHEMATICS AND COMPUTATION 218, 16, SI (APR 15 2012),8151–8159. International Workshop on Infinite and Infinitesimal in Mathemat-ics, Computing and Natural Sciences (INFINITY), Cetraro, ITALY, MAY 17-21,2010.

[120] Calude, C. S., Staiger, L., and Stephan, F. Finite State IncompressibleInfinite Sequences. In THEORY AND APPLICATIONS OF MODELS OF COM-PUTATION (TAMC 2014) (2014), Gopal, TV and Agrawal, M and Li, A and

61

Cooper, SB, Ed., vol. 8402 of Lecture Notes in Computer Science, Anna Univ, CollEngn Guindy, Vivekananda Auditorium, pp. 50–66. 11th Annual Conference onTheory and Applications of Models of Computation (TAMC), Chennai, INDIA,APR 11-13, 2014.

[121] Calude, C. S., and Svozil, K. Is Feasibility in Physics Limited by FantasyAlone? In COMPUTABLE UNIVERSE: UNDERSTANDING AND EXPLORINGNATURE AS COMPUTATION, Zenil, H, Ed. 2013, pp. 539–547.

[122] Calude, C. S., and Tadaki, K. Spectral Representation of Some ComputablyEnumerable Sets with an Application to Quantum Provability. In UNCONVEN-TIONAL COMPUTATION AND NATURAL COMPUTATION (2013), Mauri, Gand Dennunzio, A and Manzoni, L and Porreca, AE, Ed., vol. 7956 of Lecture Notesin Computer Science, Univ Milano Bicocca; European Assoc Theoret Comp Sci,Italian Chapter; Micron Fdn; Dipartimento Informatica, Sistemistica & Comuni-cazione, pp. 43–54. 12th International Conference on Unconventional Computationand Natural Computation (UCNC), Milan, ITALY, JUL 01-05, 2013.

[123] Calude, C. S., Walter Meyerstein, F., and Salomaa, A. The Universeis Lawless or “Panton chrematon metron anthropon einai”. In COMPUTABLEUNIVERSE: UNDERSTANDING AND EXPLORING NATURE AS COMPUTA-TION, Zenil, H, Ed. 2013, pp. 525–537.

[124] Calude, E. Fermat’s last theorem and chaoticity. NATURAL COMPUTING 11,2, SI (JUN 2012), 241–245.

[125] Calude, E. The Complexity of Riemann’s Hypothesis. JOURNAL OFMULTIPLE-VALUED LOGIC AND SOFT COMPUTING 18, 3-4 (2012), 257–265.

[126] Calude, E., and Lipponen, M. Deterministic incomplete automats: Simulation,universality and complementarity. In UNCONVENTIONAL MODELS OF COM-PUTATION (1998), Calude, CS and Casti, J and Dinneen, MJ, Ed., SPRINGERSERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTERSCIENCE, Univ Auckland; Ctr Discrete Math & Theoret Comp Sci; Santa Fe Inst,pp. 131–149. 1st International Conference on Unconventional Models of Computa-tion (UMC 98), UNIV AUCKLAND, AUCKLAND, NEW ZEALAND, JAN 05-09,1998.

[127] Campeanu, C. DESCRIPTIONAL COMPLEXITY IN ENCODED BLUMSTATIC COMPLEXITY SPACES. INTERNATIONAL JOURNAL OF FOUN-DATIONS OF COMPUTER SCIENCE 25, 7, SI (NOV 2014), 917–932.

[128] Campeanu, C., and Paun, A. Computing beyond the turing limit using the Hsystems. In DNA COMPUTING (2005), Ferretti, C and Mauri, G and Zandron,C, Ed., vol. 3384 of LECTURE NOTES IN COMPUTER SCIENCE, Univ MilanoBicocca, Dept Informat; Brainspark plc Comerson; Etnoteam; European Commiss;STMicroelectronics, pp. 24–34. 10th International Workshop on DNA Computing(DNA10), Univ Milano Bicocca, Milan, ITALY, JUN 07-10, 2004.

[129] Capobianco, S., Guillon, P., and Kari, J. Surjective cellular automata farfrom the Garden of Eden. DISCRETE MATHEMATICS AND THEORETICALCOMPUTER SCIENCE 15, 3 (2013), 41–60.

62

[130] Cardelli, L., and Mardare, R. The Measurable Space of Stochastic Processes.FUNDAMENTA INFORMATICAE 131, 3-4 (2014), 351–371.

[131] Carsetti, A. Life, cognition and metabiology. COGNITIVE PROCESSING 15,4 (NOV 2014), 423–434.

[132] Casasnovas, J., and Vicente Riera, J. Aggregation of Bounded Fuzzy NaturalNumber-Valued Multisets. In MODELING DECISIONS FOR ARTIFICIAL IN-TELLIGENCE (MDAI) (2010), Torra, V and Narukawa, Y and Daumas, M, Ed.,vol. 6408 of Lecture Notes in Artificial Intelligence, pp. 67–78. 7th InternationalConference on Modeling Decisions for Artificial Intelligence (MDAI), Perpignan,FRANCE, OCT 27-29, 2010.

[133] Case, J., Jain, S., Seah, S., and Stephan, F. AUTOMATIC FUNCTIONS,LINEAR TIME AND LEARNING. LOGICAL METHODS IN COMPUTER SCI-ENCE 9, 3 (2013).

[134] Castellanos, J., Paun, G., and Rodriguez-Paton, A. Computing withmembranes: P systems with Worm-Objects. In SPIRE 2000: SEVENTH INTER-NATIONAL SYMPOSIUM ON STRING PROCESSING AND INFORMATIONRETRIEVAL - PROCEEDINGS (2000), Cyted-Amyri Res Project; IEEE, pp. 65–74. 7th International Symposium on String Processing and Information Retrieval(SPIRE 2000), LA CORUNA, SPAIN, SEP 27-29, 2000.

[135] Cavaliere, M., Freund, R., Oswald, M., and Sburlan, D. Multiset randomcontext grammars, checkers, and transducers. THEORETICAL COMPUTER SCI-ENCE 372, 2-3 (MAR 15 2007), 136–151. 4th Brainstorming Week on MembraneComputing, Seville, SPAIN, JAN 30-FEB 03, 2006.

[136] Cervelle, J., Durand, B., and Formenti, E. Algorithmic information the-ory and cellular automata dynamics. In MATHEMATICAL FOUNDATIONS OFCOMPUTER SCIENCE 2001 (2001), Sgall, J and Pultr, A and Kolman, P, Ed.,vol. 2136 of LECTURE NOTES IN COMPUTER SCIENCE, Acad Sci Czech Re-public, Math Inst; Inst Theoret Comp Sci; Inst Comp Sci; Act M Agcy, pp. 248–259. 26th International Symposium on Mathematical Foundations of ComputerScience, MARIANSKE LAZNE, CZECH REPUBLIC, AUG 27-31, 2001.

[137] Chaitin, G. Probability and program-size for functions. FUNDAMENTA IN-FORMATICAE 71, 4 (JUN 2006), 367–370.

[138] Chaitin, G. An algebraic characterization of the halting probability. FUNDA-MENTA INFORMATICAE 79, 1-2 (2007), 17–23.

[139] Chaitin, G. How much information can there be in a real number? INTER-NATIONAL JOURNAL OF BIFURCATION AND CHAOS 17, 6 (JUN 2007),1933–1935.

[140] Chaitin, G. Life as Evolving Software. In COMPUTABLE UNIVERSE: UN-DERSTANDING AND EXPLORING NATURE AS COMPUTATION, Zenil, H,Ed. 2013, pp. 277–302.

63

[141] Chaplin, J. C., Krasnogor, N., and Russell, N. A. Photochromic molecularimplementations of universal computation. BIOSYSTEMS 126 (DEC 2014), 12–26.

[142] Chatelin, F. A computational journey into the mind. NATURAL COMPUTING11, 1, SI (MAR 2012), 67–79.

[143] Chen, S., Ma, B., and Zhang, K. On the similarity metric and the distancemetric. THEORETICAL COMPUTER SCIENCE 410, 24-25 (MAY 28 2009),2365–2376.

[144] Chevalier, G., Dvurecenskij, A., and Svozil, K. Piron’s and Bell’s geomet-ric Lemmas and Gleason’s theorem. FOUNDATIONS OF PHYSICS 30, 10 (OCT2000), 1737–1755.

[145] Chitescu, I., and Plavitu, A. Sugeno Measures on the Code Space. ROMA-NIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY 17, 3(2014), 289–301.

[146] Cho, F., and Squier, R. K. Religion as a Complex and Dynamic System.JOURNAL OF THE AMERICAN ACADEMY OF RELIGION 81, 2 (JUN 2013),357–398.

[147] Chong, C. T., Hoi, G., Stephan, F., and Turetsky, D. PARTIAL FUNC-TIONS AND DOMINATION. LOGICAL METHODS IN COMPUTER SCIENCE11, 3 (2015).

[148] Chown, M. The omega man - He shattered mathematics with a single number.And that was just for starters. NEW SCIENTIST 169, 2281 (MAR 10 2001),28–31.

[149] Ciobanu, G., and Rudeanu, S. Final and sequential behaviours of M-automata.ACTA INFORMATICA 46, 5 (AUG 2009), 361–374.

[150] Ciric, M., Ignjatovic, J., Basic, M., and Jancic, I. Nondeterministic au-tomata: Equivalence, bisimulations, and uniform relations. INFORMATION SCI-ENCES 261 (MAR 10 2014), 185–218.

[151] Ciric, M., Ignjatovic, J., Damljanovic, N., and Basic, M. Bisimulationsfor fuzzy automata. FUZZY SETS AND SYSTEMS 186, 1 (JAN 1 2012), 100–139.

[152] Ciric, M., Stamenkovic, A., Ignjatovic, J., and Petkovic, T. Factor-ization of fuzzy automate. In Fundamentals of Computation Theory, Proceedings(2007), CsuhajVarju, E and Esik, Z, Ed., vol. 4639 of LECTURE NOTES IN COM-PUTER SCIENCE, Hungarian Acad Sci, Comp & Automat Res Inst; Univ Szeged,Inst Comp Sci, pp. 213–225. 16th International Symposium on Fundamentals ofComputation Theory, Budapest, HUNGARY, AUG 27-30, 2007.

[153] Clark, G., and Teutsch, J. Maximizing T-complexity. FUNDAMENTA IN-FORMATICAE 139, 1 (2015), 1–19.

[154] Cockshott, P., and Michaelson, G. Are there new models of computation?Reply to Wegner and Eberbach. COMPUTER JOURNAL 50, 2 (MAR 2007),232–247.

64

[155] Cooper, S. B. Incomputability, Emergence and the Turing Universe. In CAUSAL-ITY, MEANINGFUL COMPLEXITY AND EMBODIED COGNITION, Carsetti,A, Ed., vol. 46 of Theory and Decision Library Series A Philosophy and Method-ology of the Social Sciences. 2010, pp. 135–153.

[156] Cooper, S. B. The Computational Roots of Hyper-Causality. INTERNATIONALJOURNAL OF UNCONVENTIONAL COMPUTING 6, 5, SI (2010), 437–449. 8thInternational Conference on Unconventional Computation, Ponta Delgada, POR-TUGAL, SEP 07-11, 2009.

[157] Cooper, S. B. Turing’s Titanic Machine? COMMUNICATIONS OF THE ACM55, 3 (MAR 2012), 74–83.

[158] Cooper, S. B. The Mathematician’s Bias - and the Return to Embodied Compu-tation. In COMPUTABLE UNIVERSE: UNDERSTANDING AND EXPLORINGNATURE AS COMPUTATION, Zenil, H, Ed. 2013, pp. 125–142.

[159] Copeland, B. Narrow versus wide mechanism: Including a re-examination ofTuring’s views on the mind-machine issue. JOURNAL OF PHILOSOPHY 97, 1(JAN 2000), 5–32.

[160] Copeland, B., and Sylvan, R. Beyond the universal Turing machine. AUS-TRALASIAN JOURNAL OF PHILOSOPHY 77, 1 (MAR 1999), 46–67.

[161] Copeland, B. J., and Shagrir, O. Physical computation: How general areGandy’s principles for mechanisms? MINDS AND MACHINES 17, 2 (SUM 2007),217–231.

[162] Copeland, B. J., and Shagrir, O. Do Accelerating Turing Machines Computethe Uncomputable? MINDS AND MACHINES 21, 2 (MAY 2011), 221–239.

[163] Cordy, B., and Salomaa, K. On the existence of regular approximations. THE-ORETICAL COMPUTER SCIENCE 387, 2 (NOV 12 2007), 125–135. 8th Inter-national Workshop on Descriptional Complexity of Forman Systems, Las Cruces,NM, JUN 21-23, 2006.

[164] Cornelis, C., Jensen, R., Hurtado, G., and Slezak, D. Attribute selectionwith fuzzy decision reducts. INFORMATION SCIENCES 180, 2 (JAN 15 2010),209–224.

[165] Corolli, L., Maj, C., Marini, F., Besozzi, D., and Mauri, G. An ex-cursion in reaction systems: From computer science to biology. THEORETICALCOMPUTER SCIENCE 454 (OCT 5 2012), 95–108.

[166] Crolard, T., Polonowski, E., and Valarcher, P. Extending the LoopLanguage with Higher-Order Procedural Variables. ACM TRANSACTIONS ONCOMPUTATIONAL LOGIC 10, 4 (AUG 2009).

[167] Csuhaj-Varju, E., Di Nola, A., Paun, G., Perez-Jimenez, M. J., andVaszil, G. Editing configurations of P systems. FUNDAMENTA INFORMATI-CAE 82, 1-2 (2008), 29–46.

65

[168] CsuhajVarju, E., Kari, L., and Paun, G. Test tube distributed systems basedon splicing. COMPUTERS AND ARTIFICIAL INTELLIGENCE 15, 2-3 (1996),211–232.

[169] D’Abramo, G. Asymptotic behavior and halting probability of Turing Machines.CHAOS SOLITONS & FRACTALS 37, 1 (JUL 2008), 210–214.

[170] Dal Negro, L., and Boriskina, S. V. Deterministic aperiodic nanostructuresfor photonics and plasmonics applications. LASER & PHOTONICS REVIEWS 6,2 (MAR 2012), 178–218.

[171] Dal Negro, L., Forestiere, C., Lawrence, N., Lee, S., Trevino, J., andWalsh, G. Aperiodic Order in Nanoplasmonics. In PLASMONICS: THEORYAND APPLICATIONS, Shahbazyan, TV and Stockman, MI, Ed., vol. 15 of Chal-lenges and Advances in Computational Chemistry and Physics. 2013, pp. 329–377.

[172] Dal Negro, L., Lawrence, N., Trevino, J., and Walsh, G. Aperiodic Orderfor Nanophotonics. In OPTICS OF APERIODIC STRUCTURES: FUNDAMEN-TALS AND DEVICE APPLICATIONS, DalNegro, L, Ed. 2014, pp. 1–56.

[173] Dassow, J., Paun, G., Thierrin, G., and Yu, S. Tree-systems of morphisms.ACTA INFORMATICA 38, 2 (NOV 2001), 131–153.

[174] Davie, G. Recursive events in random sequences. ARCHIVE FOR MATHEMAT-ICAL LOGIC 40, 8 (NOV 2001), 629–638.

[175] Davie, G. Kolmogorov complexity and noncomputability. MATHEMATICALLOGIC QUARTERLY 48, 4 (2002), 574–580.

[176] Davie, G., and Fouche, W. L. On the computability of a construction of Brow-nian motion. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE 23,6 (DEC 2013), 1257–1265.

[177] Delahaye, J.-P., and Zenil, H. Numerical evaluation of algorithmic complexityfor short strings: A glance into the innermost structure of randomness. APPLIEDMATHEMATICS AND COMPUTATION 219, 1 (SEP 15 2012), 63–77. 3rd In-ternational Workshop on Physics and Computation, EGYPT, AUG 30-SEP 06,2010.

[178] Devine, S. The Insights of Algorithmic Entropy. ENTROPY 11, 1 (MAR 2009),85–110. Conference on Concepts of Entropy and Their Applications, Melbourne,AUSTRALIA, NOV 26-DEC 12, 2007.

[179] Diacu, F. The solution of the n-body problem. MATHEMATICAL INTELLI-GENCER 18, 3 (SUM 1996), 66–70.

[180] Dickhaut, J., Lunawat, R., Pronin, K., and Stecher, J. Decision makingand trade without probabilities. ECONOMIC THEORY 48, 2-3 (OCT 2011), 275–288.

[181] Dinneen, M. J., Kim, Y.-B., and Nicolescu, R. Synchronization in P Modules.In UNCONVENTIONAL COMPUTATION, PROCEEDINGS (2010), Calude, CSand Hagiya, M and Morita, K and Rozenberg, G and Timmis, J, Ed., vol. 6079 of

66

Lecture Notes in Computer Science, EATCS; Acad Europaea; Ctr Discrete Math& Theoret Comp Sci, pp. 32–44. 9th International Conference on UnconventionalComputation, Univ Tokyo, Hongo Campus, Tokyo, JAPAN, JUN 21-25, 2010.

[182] Dittrich, P., Ziegler, J., and Banzhaf, W. Artificial chemistries - A review.ARTIFICIAL LIFE 7, 3 (FAL 2001), 225–275.

[183] Downey, R., Hirschfeldt, D., and LaForte, G. Randomness and reducibil-ity. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001(2001), Sgall, J and Pultr, A and Kolman, P, Ed., vol. 2136 of LECTURE NOTESIN COMPUTER SCIENCE, Acad Sci Czech Republic, Math Inst; Inst TheoretComp Sci; Inst Comp Sci; Act M Agcy, pp. 316–327. 26th International Sympo-sium on Mathematical Foundations of Computer Science, MARIANSKE LAZNE,CZECH REPUBLIC, AUG 27-31, 2001.

[184] Downey, R., Hirschfeldt, D. R., and LaForte, G. Undecidability of thestructure of the Solovay degrees of c.e. reals. JOURNAL OF COMPUTER ANDSYSTEM SCIENCES 73, 5 (AUG 2007), 769–787.

[185] Downey, R., Hirschfeldt, D. R., Nies, A., and Terwijn, S. A. Calibratingrandomness. BULLETIN OF SYMBOLIC LOGIC 12, 3 (SEP 2006), 411–491.

[186] Downey, R., Merkle, W., and Reimann, J. Schnorr dimension. MATHE-MATICAL STRUCTURES IN COMPUTER SCIENCE 16, 5 (OCT 2006), 789–811. 1st Conference on Computability in Europe - New Computational Paradigms,Univ Amsterdam, Amsterdam, NETHERLANDS, JUN, 2005.

[187] Downey, R., and Terwijn, S. Computably enumerable reals and uniformlypresentable ideals. MATHEMATICAL LOGIC QUARTERLY 48, 1 (2002), 29–40. Dagstuhl Seminar on Computability and Complexity in Analysis, SCHLOSSDAGSTUHL, GERMANY, NOV 11-16, 2001.

[188] Downey, R. G., and Hirschfeldt, D. R. Algorithmic Randomness and Com-plexity. In ALGORITHMIC RANDOMNESS AND COMPLEXITY, Theory andApplications of Computability. 2010, pp. 401+.

[189] Dragomir, N., Dragomir, S., Pearce, C., and Sunde, J. Kraft’s numberand ideal word packing. In UNSOLVED PROBLEMS OF NOISE AND FLUC-TUATIONS (2000), Abbott, D and Kish, LB, Ed., vol. 511 of AIP CONFER-ENCE PROCEEDINGS, IEEE Electron Devoces Soc; Inst Phys; US Off NavalRes; USAF Res Labs; Ctr Biomed Engn, Adelaide; Natl Inst Theoret Phys; DeptInd Sci & Resources Australia; Defence Sci & Technol Org; Inst Engineers, Aus-tralia, pp. 347–352. 2nd International Conference on Unsolved Problems of Noiseand Fluctuations (UPoN 99), ADELAIDE, AUSTRALIA, JUL 12-15, 1999.

[190] Dubacq, J., Durand, B., and Formenti, E. Kolmogorov complexity andcellular automata classification. THEORETICAL COMPUTER SCIENCE 259,1-2 (MAY 28 2001), 271–285.

[191] Durand, A., Jones, N. D., Makowsky, J. A., and More, M. FIFTY YEARSOF THE SPECTRUM PROBLEM: SURVEY AND NEW RESULTS. BULLETINOF SYMBOLIC LOGIC 18, 4 (DEC 2012), 505–553.

67

[192] Durand, B., and Porrot, S. Comparison between the complexity of a func-tion and the complexity of its graph. In MATHEMATICAL FOUNDATIONS OFCOMPUTER SCIENCE 1998 (1998), Brim, L and Gruska, J and Zlatuska, J, Ed.,vol. 1450 of LECTURE NOTES IN COMPUTER SCIENCE, pp. 732–739. 23rdInternational Symposium on the Mathematical Foudations of Computer Science(MFCS 98), BRNO, CZECH REPUBLIC, AUG 24-28, 1998.

[193] Dyckhoff, R., and Negri, S. Decision methods for linearly ordered Heytingalgebras. ARCHIVE FOR MATHEMATICAL LOGIC 45, 4 (MAY 2006), 411–422.

[194] Emch, G. Probabilistic issues in statistical mechanics. STUDIES IN HISTORYAND PHILOSOPHY OF MODERN PHYSICS 36B, 2 (JUN 2005), 303–322. Con-ference on Philosophical and Foundational Issues in Statistical Physics, Utrecht,NETHERLANDS, NOV 28-30, 2003.

[195] Enguix, G. Preliminaries about some possible applications of P systems in lin-guistics. In MEMBRANE COMPUTING (2003), Paun, G and Rozenberg, G andSalomaa, A and Zandron, C, Ed., vol. 2597 of LECTURE NOTES IN COM-PUTER SCIENCE, pp. 74–89. International Workshop on Membrane Computing,CURTEA DE ARGES, ROMANIA, AUG 19-23, 2002.

[196] Esbelin, H., and More, M. Rudimentary relations and primitive recursion:A toolbox. THEORETICAL COMPUTER SCIENCE 193, 1-2 (FEB 28 1998),129–148.

[197] Estevez-Rams, E., Lora Serrano, R., Aragon Fernandez, B., andBrito Reyes, I. On the non-randomness of maximum Lempel Ziv complexitysequences of finite size. CHAOS 23, 2 (JUN 2013).

[198] Estevez-Rams, E., Lora-Serrano, R., Nunes, C. A. J., and Aragon-Fernandez, B. Lempel-Ziv complexity analysis of one dimensional cellular au-tomata. CHAOS 25, 12 (DEC 2015).

[199] Etesi, G. A Proof of the Geroch-Horowitz-Penrose Formulation of the Strong Cos-mic Censor Conjecture Motivated by Computability Theory. INTERNATIONALJOURNAL OF THEORETICAL PHYSICS 52, 3 (MAR 2013), 946–960.

[200] Ewert, W., Marks, II, R. J., Thompson, B. B., and Yu, A. EvolutionaryInversion of Swarm Emergence Using Disjunctive Combs Control. IEEE TRANS-ACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 43, 5 (SEP 2013),1063–1076.

[201] Fan, C.-M., Huang, C. C., and Yu, S. S. On n-power prefix languages. INTER-NATIONAL JOURNAL OF COMPUTER MATHEMATICS 85, 5 (MAY 2008),703–715.

[202] Farhadinia, B. Hesitant fuzzy set lexicographical ordering and its applicationto multi-attribute decision making. INFORMATION SCIENCES 327 (JAN 102016), 233–245.

[203] Farr, G. Cost-effectiveness of algorithms. DISCRETE MATHEMATICS ANDTHEORETICAL COMPUTER SCIENCE 17, 1 (2015), 201–218.

68

[204] Ferbus-Zanda, M., and Grigorieff, S. Kolmogorov Complexity in Perspec-tive Part I: Information Theory and Randomness. In CONSTRUCTIVITY ANDCOMPUTABILITY IN HISTORICAL AND PHILOSOPHICAL PERSPECTIVE(2014), Dubucs, J and Bourdeau, M, Ed., vol. 34 of Logic Epistemology and theUnity of Science, pp. 57–94. Meeting on Computability and Constructivity in His-torical and Philosophical Perspective, Ecole Normale Superieure, Paris, FRANCE,DEC 17-18, 2006.

[205] Figueira, S., and Nies, A. Feasible Analysis, Randomness, and Base Invariance.THEORY OF COMPUTING SYSTEMS 56, 3, SI (APR 2015), 439–464.

[206] Figueira, S., Stephan, F., and Wu, G. Randomness and universal machines.JOURNAL OF COMPLEXITY 22, 6 (DEC 2006), 738–751. 2nd InternationalConference on Computability and Complexity in Analysis, Kyoto Univ, Kyoto,JAPAN, AUG 25-29, 2005.

[207] Fiorini, R. A. How Random is Your Tomographic Noise? A Number TheoreticTransform (NTT) Approach. FUNDAMENTA INFORMATICAE 135, 1-2 (2014),135–170.

[208] Fiske, M. S. Quantum Random Active Element Machine. In UNCONVEN-TIONAL COMPUTATION AND NATURAL COMPUTATION (2013), Mauri,G and Dennunzio, A and Manzoni, L and Porreca, AE, Ed., vol. 7956 of Lec-ture Notes in Computer Science, Univ Milano Bicocca; European Assoc TheoretComp Sci, Italian Chapter; Micron Fdn; Dipartimento Informatica, Sistemistica& Comunicazione, pp. 252–254. 12th International Conference on UnconventionalComputation and Natural Computation (UCNC), Milan, ITALY, JUL 01-05, 2013.

[209] Flaminio, T., Godo, L., and Hosni, H. On the logical structure of de Finetti’snotion of event. JOURNAL OF APPLIED LOGIC 12, 3, SI (SEP 2014), 279–301.

[210] Fouche, W., Heidema, J., Jones, G., and Potgieter, P. H. Universal-ity and programmability of quantum computers. THEORETICAL COMPUTERSCIENCE 403, 1 (AUG 20 2008), 121–129.

[211] Fratto, B. E., Guz, N., and Katz, E. Biomolecular Computing Realized inParallel Flow Systems: Enzyme-Based Double Feynman Logic Gate. PARALLELPROCESSING LETTERS 25, 1, SI (MAR 2015).

[212] Fratto, B. E., and Katz, E. Reversible Logic Gates Based on Enzyme-Biocatalyzed Reactions and Realized in Flow Cells: A Modular Approach.CHEMPHYSCHEM 16, 7 (MAY 18 2015), 1405–1415.

[213] Fratto, B. E., Roby, L. J., Guz, N., and Katz, E. Enzyme-based logic gatesswitchable between OR, NXOR and NAND Boolean operations realized in a flowsystem. CHEMICAL COMMUNICATIONS 50, 81 (2014), 12043–12046.

[214] Fresco, N. A Critical Survey of Some Competing Accounts of Concrete DigitalComputation. In ALGORITHMIC PROBABILITY AND FRIENDS: BAYESIANPREDICTION AND ARTIFICIAL INTELLIGENCE (2013), Dowe, DL, Ed.,vol. 7070 of Lecture Notes in Computer Science, AF Off Sci Res; Monash Univ,

69

Fac Informat Technol; Natl ICT Australia; Asian Off Aerosp Res & Dev, pp. 155–173. Ray Solomonoff 85th Memorial Conference, Monash Univ Clayton Campus,Melbourne, AUSTRALIA, NOV 30-DEC 02, 2011.

[215] Fresco, N., and Staines, P. J. A Revised Attack on Computational Ontology.MINDS AND MACHINES 24, 1, SI (FEB 2014), 101–122.

[216] Freund, R. Energy-controlled P systems. In MEMBRANE COMPUTING (2003),Paun, G and Rozenberg, G and Salomaa, A and Zandron, C, Ed., vol. 2597 of LEC-TURE NOTES IN COMPUTER SCIENCE, pp. 247–260. International Workshopon Membrane Computing, CURTEA DE ARGES, ROMANIA, AUG 19-23, 2002.

[217] Freund, R., Kari, L., Oswald, M., and Sosik, P. Computationally universalP systems without priorities: two catalysts are sufficient. THEORETICAL COM-PUTER SCIENCE 330, 2 (FEB 2 2005), 251–266. 4th International Conferenceon Electromagnetic Wave Interaction with Water and Moist Substances, Mat Res& Testing Inst, Weimar, GERMANY, MAY, 2001.

[218] Freund, R., Kari, L., and Paun, G. DNA computing based on splicing: Theexistence of universal computers. THEORY OF COMPUTING SYSTEMS 32, 1(JAN-FEB 1999), 69–112.

[219] Freund, R., and Paun, A. Membrane systems with symport/antiport rules:Universality results. In MEMBRANE COMPUTING (2003), Paun, G and Rozen-berg, G and Salomaa, A and Zandron, C, Ed., vol. 2597 of LECTURE NOTESIN COMPUTER SCIENCE, pp. 270–287. International Workshop on MembraneComputing, CURTEA DE ARGES, ROMANIA, AUG 19-23, 2002.

[220] Ganea, M. Epistemic Optimism. PHILOSOPHIA MATHEMATICA 16, 3 (OCT2008), 333–353.

[221] Ganz, R. E. The Decimal Expansion of pi Is Not Statistically Random. EXPER-IMENTAL MATHEMATICS 23, 2 (2014), 99–104.

[222] Garcia-Arnau, M., Manrique, D., Rodriguez-Paton, A., and Sosik, P.A P system and a constructive membrane-inspired DNA algorithm for solving theMaximum Clique Problem. BIOSYSTEMS 90, 3 (NOV-DEC 2007), 687–697.

[223] Garola, C. Objectivity versus nonobjectivity in quantum mechanics. FOUNDA-TIONS OF PHYSICS 30, 9 (SEP 2000), 1539–1565.

[224] Gauvrit, N., Zenil, H., Delahaye, J.-P., and Soler-Toscano, F. Al-gorithmic complexity for short binary strings applied to psychology: a primer.BEHAVIOR RESEARCH METHODS 46, 3 (SEP 2014), 732–744.

[225] Gdor, E., Katz, E., and Mandler, D. Biomolecular AND Logic Gate Basedon Immobilized Enzymes with Precise Spatial Separation Controlled by ScanningElectrochemical Microscopy. JOURNAL OF PHYSICAL CHEMISTRY B 117, 50(DEC 19 2013), 16058–16065.

[226] Gelenbe, E. Natural Computation. COMPUTER JOURNAL 55, 7 (JUL 2012),848–851.

70

[227] Georgiev, I. Continued fractions of primitive recursive real numbers. MATHE-MATICAL LOGIC QUARTERLY 61, 4-5 (AUG 2015), 288–306.

[228] Gepp, A., and Stocks, P. A review of procedures to evolve quantum algorithms.GENETIC PROGRAMMING AND EVOLVABLE MACHINES 10, 2 (JUN 2009),181–228.

[229] Gheorghe, M., and Paun, G. Computing by Self-Assembly: DNA Molecules,Polyominoes, Cells. In SYSTEMS SELF-ASSEMBLY: MULTIDISCIPLINARYSNAPSHOTS, Krasnogor, N and Gustafson, S and Pelta, DA and Verdegay, JL,Ed., vol. 5 of Studies in Multidisciplinarity. 2008, pp. 49–78.

[230] Gheorghe, M., and Stannett, M. Membrane system models for super-Turingparadigms. NATURAL COMPUTING 11, 2, SI (JUN 2012), 253–259.

[231] Golding, J. Ecce Homo Sexual: Ontology and Eros in the Age of Incompletenessand Entanglement. PARALLAX 20, 3, SI (2014), 217–230.

[232] Gorecka, J. N., Gorecki, J., and Igarashi, Y. One dimensional chemical sig-nal diode constructed with two nonexcitable barriers. JOURNAL OF PHYSICALCHEMISTRY A 111, 5 (FEB 8 2007), 885–889.

[233] Gorecki, J., Gizynski, K., Guzowski, J., Gorecka, J. N., Garstecki, P.,Gruenert, G., and Dittrich, P. Chemical computing with reaction-diffusionprocesses. PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETYA-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES 373, 2046(JUL 28 2015).

[234] Grabowski, L. On Turing dynamical systems and the Atiyah problem. INVEN-TIONES MATHEMATICAE 198, 1 (OCT 2014), 27–69.

[235] Greco, S., Matarazzo, B., and Slowinski, R. Rough sets theory for mul-ticriteria decision analysis. EUROPEAN JOURNAL OF OPERATIONAL RE-SEARCH 129, 1 (FEB 16 2001), 1–47.

[236] Greco, S., Matarazzo, B., and Slowinski, R. Algebra and Topology forDominance-Based Rough Set Approach. In ADVANCES IN INTELLIGENT IN-FORMATION SYSTEMS, Ras, ZW and Tsay, LS, Ed., vol. 265 of Studies inComputational Intelligence. 2010, pp. 43–78.

[237] Greco, S., Matarazzo, B., and Slowinski, R. On Topological Dominance-based Rough Set Approach. In TRANSACTIONS ON ROUGH SETS XII, Peters,JF and Skowron, A and Slowinski, R and Lingras, P and Miao, DQ and Tsumoto,S, Ed., vol. 6190 of Lecture Notes in Computer Science. 2010, pp. 21–45.

[238] Greenberg, N., and Miller, J. S. Diagonally non-recursive functions andeffective Hausdorff dimension. BULLETIN OF THE LONDON MATHEMATICALSOCIETY 43, 4 (AUG 2011), 636–654.

[239] Gruska, J. De-quantisation. In 8TH INTERNATIONAL CONFERENCE ONPROGRESS IN THEORETICAL PHYSICS (ICPTP 2011) (2012), Mebarki, Nand Mimouni, J and Belaloui, N and Moussa, KA, Ed., vol. 1444 of AIP ConferenceProceedings, Algerian Minist Higher Educ & Sci Res; Directorate Gen Sci Res

71

& Technol Dev (DGRSDT); Rectorate Mentouri Univ; Fac Sci Mentouri Univ,pp. 106–116. 8th International Conference on Progress in Theoretical Physics(ICPTP), Campus Mentouri Univ, Constantine, ALGERIA, OCT 23-25, 2011.

[240] Gruska, J. Grand Challenges of Informatics. In COMPUTING WITH NEWRESOURCES: ESSAYS DEDICATED TO JOZEF GRUSKA ON THE OCCA-SION OF HIS 80TH BIRTHDAY, Calude, CS and Freivalds, R and Kazuo, I, Ed.,vol. 8808 of Lecture Notes in Computer Science. 2014, pp. 449–461.

[241] Guitart, R. Cohomological Emergence of Sense in Discourses (As Living SystemsFollowing Ehresmann and Vanbremeersch). AXIOMATHES 19, 3 (SEP 2009), 245–270.

[242] Gurevich, Y., and Passmore, G. O. Impugning Randomness, Convincingly.STUDIA LOGICA 100, 1-2, SI (APR 2012), 193–222.

[243] Gustafson, K. Parallel computing forty years ago. MATHEMATICS AND COM-PUTERS IN SIMULATION 51, 1-2 (DEC 22 1999), 47–62.

[244] Guz, N., Halamek, J., Rusling, J. F., and Katz, E. A biocatalytic cas-cade with several output signals-towards biosensors with different levels of con-fidence. ANALYTICAL AND BIOANALYTICAL CHEMISTRY 406, 14 (MAY2014), 3365–3370.

[245] Hagar, A. Quantum algorithms: Philosophical lessons. MINDS AND MA-CHINES 17, 2 (SUM 2007), 233–247.

[246] Halamek, J., Bocharova, V., Arugula, M. A., Strack, G., Privman, V.,and Katz, E. Realization and Properties of Biochemical-Computing BiocatalyticXOR Gate Based on Enzyme Inhibition by a Substrate. JOURNAL OF PHYSI-CAL CHEMISTRY B 115, 32 (AUG 18 2011), 9838–9845.

[247] Halamek, J., Bocharova, V., Chinnapareddy, S., Windmiller, J. R.,Strack, G., Chuang, M.-C., Zhou, J., Santhosh, P., Ramirez, G. V.,Arugula, M. A., Wang, J., and Katz, E. Multi-enzyme logic network ar-chitectures for assessing injuries: digital processing of biomarkers. MOLECULARBIOSYSTEMS 6, 12 (2010), 2554–2560.

[248] Halamek, J., Zavalov, O., Halamkova, L., Korkmaz, S., Privman, V.,and Katz, E. Enzyme-Based Logic Analysis of Biomarkers at Physiological Con-centrations: AND Gate with Double-Sigmoid “Filter” Response. JOURNAL OFPHYSICAL CHEMISTRY B 116, 15 (APR 19 2012), 4457–4464.

[249] Halamkova, L., Halamek, J., Bocharova, V., Wolf, S., Mulier, K. E.,Beilman, G., Wang, J., and Katz, E. Analysis of biomarkers characteristic ofporcine liver injury-from biomolecular logic gates to an animal model. ANALYST137, 8 (2012), 1768–1770.

[250] Harding, S. L., Miller, J. F., and Rietman, E. A. Evolution in materio: Ex-ploiting the physics of materials for computation. INTERNATIONAL JOURNALOF UNCONVENTIONAL COMPUTING 4, 2 (2008), 155–194.

72

[251] Hartmann, S., and Link, S. Deciding implication for functional dependencies incomplex-value databases. THEORETICAL COMPUTER SCIENCE 364, 2 (NOV6 2006), 212–240. 11th Workshop on Logic, Language, Information and Compu-tation, Univ Paris, Fontainebleau Campus, Fontainebleau, FRANCE, JUL 19-22,2004.

[252] Hartmann, S., Link, S., and Schewe, K. Axiomatisations of functional de-pendencies in the presence of records, lists, sets and multisets. THEORETICALCOMPUTER SCIENCE 355, 2 (APR 11 2006), 167–196. 10th Workshop on Logic,Language, Information and Computation, Fed Univ Ouro Preto, Minas Gerais,BRAZIL, JUL 29-AUG 01, 2003.

[253] Haw, J. Y., Assad, S. M., Lance, A. M., Ng, N. H. Y., Sharma, V., Lam,P. K., and Symul, T. Maximization of Extractable Randomness in a Quan-tum Random-Number Generator. PHYSICAL REVIEW APPLIED 3, 5 (MAY 112015).

[254] Hay, N. J. Simulation complexity. FUNDAMENTA INFORMATICAE 83, 1-2(2008), 117–140.

[255] Hermens, R. Conway-Kochen and the Finite Precision Loophole. FOUNDA-TIONS OF PHYSICS 44, 10 (OCT 2014), 1038–1048.

[256] Hertling, P., and Weihrauch, K. Randomness spaces. In AUTOMATA,LANGUAGES AND PROGRAMMING (1998), Larsen, KG and Skyum, S andWinskel, G, Ed., vol. 1443 of LECTURE NOTES IN COMPUTER SCIENCE,European Assoc Theoret Comp Sci, pp. 796–807. 25th International Colloquium onAutomata, Languages and Programming (ICALP 98), AALBORG, DENMARK,JUL 13-17, 1998.

[257] Higuchi, K., Hudelson, W. M. P., Simpson, S. G., and Yokoyama, K.Propagation of partial randomness. ANNALS OF PURE AND APPLIED LOGIC165, 2 (FEB 2014), 742–758.

[258] Hintikka, J. Who Has Kidnapped the Notion of Information? In SOCRATICEPISTEMOLOGY: EXPLORATIONS OF KNOWLEDGE-SEEKING BY QUES-TIONING. 2007, pp. 189–210.

[259] Hitchcock, J. M., and Mayordomo, E. Base invariance of feasible dimension.INFORMATION PROCESSING LETTERS 113, 14-16 (JUL-AUG 2013), 546–551.

[260] Hiyama, S., Moritani, Y., Gojo, R., Takeuchi, S., and Sutoh, K.Biomolecular-motor-based autonomous delivery of lipid vesicles as nano- or mi-croscale reactors on a chip. LAB ON A CHIP 10, 20 (2010), 2741–2748.

[261] Hodson-Tole, E. F., and Wakeling, J. M. Variations in motor unit re-cruitment patterns occur within and between muscles in the running rat (Rattusnorvegicus). JOURNAL OF EXPERIMENTAL BIOLOGY 210, 13 (JUL 1 2007),2333–2345.

73

[262] Hoelzl, R., Kraeling, T., Stephan, F., and Wu, G. Initial Segment Com-plexities of Randomness Notions. In THEORETICAL COMPUTER SCIENCE(2010), Calude, CS and Sassone, V, Ed., vol. 323 of IFIP Advances in Informationand Communication Technology, IFIP Tech Comm 1; IFIP WG 2 2; SIGACT;EATCS, pp. 259–270. 6th IFIP International Conference on Theoretical ComputerScience, Brisbane, AUSTRALIA, SEP 20-23, 2010.

[263] Hoelzl, R., Kraeling, T., Stephan, F., and Wu, G. Initial segment complex-ities of randomness notions. INFORMATION AND COMPUTATION 234 (FEB2014), 57–67.

[264] Hormoz, S. Quantum collapse and the second law of thermodynamics. PHYSI-CAL REVIEW E 87, 2 (FEB 20 2013).

[265] Hu, H., and Shi, Z. The neural circuits designing and analysis by the universalfuzzy logical framework. In FOURTH INTERNATIONAL CONFERENCE ONFUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 4, PROCEEDINGS(2007), Lei, JS and Yu, J and Zhou, SG, Ed., Hainan Univ; IEEE Reliabil Soc;Asia Pacific Neural Network Assembly, pp. 524–529. 4th International Conferenceon Fuzzy Systems and Knowledge Discovery, Haikou, PEOPLES R CHINA, AUG24-27, 2007.

[266] Hu, Y., Yang, Y., Katz, E., and Song, H. Programming the quorumsensing-based AND gate in Shewanella oneidensis for logic gated-microbial fuelcells. CHEMICAL COMMUNICATIONS 51, 20 (2015), 4184–4187.

[267] Hudelson, W. M. P. MASS PROBLEMS AND INITIAL SEGMENT COM-PLEXITY. JOURNAL OF SYMBOLIC LOGIC 79, 1 (MAR 2014), 20–44.

[268] HUHNE, M. ON THE POWER OF SEVERAL QUEUES. THEORETICALCOMPUTER SCIENCE 113, 1 (MAY 24 1993), 75–91. 8TH ANNUAL SYMP ONTHEORETICAL ASPECTS OF COMPUTER SCIENCE ( STACS 91 ), HAM-BURG, GERMANY, FEB 14-16, 1991.

[269] Hyde, J., Laschos, V., Olsen, L., Petrykiewicz, I., and Shaw, A. IteratedCesaro averages, frequencies of digits, and Baire category. ACTA ARITHMETICA144, 3 (2010), 287–293.

[270] Iancu, M., and Kohlhase, M. A Flexiformal Model of Knowledge Disseminationand Aggregation in Mathematics. In INTELLIGENT COMPUTER MATHEMAT-ICS, CICM 2015 (2015), Kerber, M and Carette, J and Kaliszyk, C and Rabe, Fand Sorge, V, Ed., vol. 9150 of Lecture Notes in Artificial Intelligence, pp. 137–152.International Conference on Intelligent Computer Mathematics (CICM), Washing-ton, DC, JUL 13-17, 2015.

[271] Ibarra, O. H. A Look Back at Some Early Results in Membrane Computing. InMEMBRANE COMPUTING (2010), Paun, G and Perez Jimenez, MJ and RiscosNunez, A and Rozenberg, G and Salomaa, A, Ed., vol. 5957 of Lecture Notes inComputer Science, Int Assoc Pattern Recognit; Informat Technol Ind Dev Agcy;Microsoft Innovat Lab Cairo; Nile Univ; Univ Surrey; Univ Cagliari, pp. 66–73.10th International Workshop on Membrane Computing9th International Workshop

74

on Multiple Classifier Systems, Natl Coll Valaicu Voda Curtea de Arges, Curteade Arges, ROMANIACairo, EGYPT, AUG 24-27, 2009APR 07-09, 2010.

[272] Ibrahim, Z., Tsuboi, Y., Muhammad, M., Ono, O., and Khalid, M. DNAimplementation of k-shortest paths computation. In 2005 IEEE CONGRESS ONEVOLUTIONARY COMPUTATION, VOLS 1-3, PROCEEDINGS (2005), IEEECongress on Evolutionary Computation, IEEE; IEEE Computat Intelligence Soc;IEE; Evolut Programming Soc, pp. 707–713. IEEE Congress on EvolutionaryComputation, Edinburgh, SCOTLAND, SEP 02-05, 2005.

[273] Ibrahim, Z., Tsuboi, Y., Ono, O., and Khalid, M. Experimental implemen-tation of direct-proportional length-based DNA computing for numerical optimiza-tion of the shortest path problem. INTERNATIONAL JOURNAL OF UNCON-VENTIONAL COMPUTING 3, 1 (2007), 15–34. 8th European Conference onArtificial Life, Canterbury, ENGLAND, SEP 05-09, 2005.

[274] Ilie, L. On lengths of words in context-free languages. THEORETICAL COM-PUTER SCIENCE 242, 1-2 (JUL 6 2000), 327–359.

[275] Ilie, L., Paun, G., Rozenberg, G., and Salomaa, A. On strongly context-free languages. DISCRETE APPLIED MATHEMATICS 103, 1-3 (JUL 15 2000),153–165.

[276] Ionescu, M., and Sburlan, D. P systems with adjoining controlled communi-cation rules. In Fundamentals of Computation Theory, Proceedings (2007), Csuha-jVarju, E and Esik, Z, Ed., vol. 4639 of LECTURE NOTES IN COMPUTER SCI-ENCE, Hungarian Acad Sci, Comp & Automat Res Inst; Univ Szeged, Inst CompSci, pp. 353–364. 16th International Symposium on Fundamentals of ComputationTheory, Budapest, HUNGARY, AUG 27-30, 2007.

[277] ISTRATE, G., and PAUN, G. SOME COMBINATORIAL PROPERTIES OFSELF-READING SEQUENCES. DISCRETE APPLIED MATHEMATICS 55, 1(OCT 28 1994), 83–86.

[278] Joosten, J. J. Complexity, Universality and Intermediate Degrees. In NUMER-ICAL ANALYSIS AND APPLIED MATHEMATICS (ICNAAM 2012), VOLS AAND B (2012), Simos, TE and Psihoyios, G and Tsitouras, C and Anastassi,Z, Ed., vol. 1479 of AIP Conference Proceedings, European Soc Computat Meth-ods Sci, Engn & Technol (ESCMSET); R M Santilli Fdn, pp. 638–641. Interna-tional Conference of Numerical Analysis and Applied Mathematics (ICNAAM),Kos, GREECE, SEP 19-25, 2012.

[279] Juergensen, H. Complexity, information, energy. INTERNATIONAL JOUR-NAL OF FOUNDATIONS OF COMPUTER SCIENCE 19, 4 (AUG 2008), 781–793. 9th International Workshop on Descriptional Complexity of Formal Systems,Novy Smokovec, SLOVAKIA, JUL 20-22, 2007.

[280] Juergensen, H., and Matthews, D. E. Entropy and Higher Moments ofInformation. JOURNAL OF UNIVERSAL COMPUTER SCIENCE 16, 5 (2010),749–794.

[281] JURGENSEN, H., and STAIGER, L. LOCAL HAUSDORFF DIMENSION.ACTA INFORMATICA 32, 5 (AUG 1995), 491–507.

75

[282] Kari, L., Konstantinidis, S., and Sosik, P. On properties of bond-free DNAlanguages. THEORETICAL COMPUTER SCIENCE 334, 1-3 (APR 11 2005),131–159.

[283] Katz, E. Processing electrochemical signals at both sides of interface: electronicvs. chemical signal processing. JOURNAL OF SOLID STATE ELECTROCHEM-ISTRY 15, 7-8 (JUL 2011), 1471–1480.

[284] Katz, E. Biomolecular Information Processing: From Boolean Logic Gates toComplex Networked Systems INTRODUCTION. INTERNATIONAL JOURNALOF UNCONVENTIONAL COMPUTING 8, 5-6, SI (2012), 339–346.

[285] Katz, E. Biocomputing - tools, aims, perspectives. CURRENT OPINION INBIOTECHNOLOGY 34 (AUG 2015), 202–208.

[286] Katz, E., Bocharova, V., and Privman, M. Electronic interfaces switchableby logically processed multiple biochemical and physiological signals. JOURNALOF MATERIALS CHEMISTRY 22, 17 (2012), 8171–8178.

[287] Katz, E., and Gueven, A. Multi-Signal Processing Biosensors and Bioac-tuators Based on Biocomputing Concept. In NANOANTENNA: PLASMON-ENHANCED SPECTROSCOPIES FOR BIOTECHNOLOGICAL APPLICA-TIONS, DeLaChapelle, ML and Pucci, A, Ed., vol. 1 of Pan Stanford Series onthe High-Tech of Biotechnology. 2013, pp. 387–405.

[288] Katz, E., and Minko, S. Enzyme-based logic systems interfaced with signal-responsive materials and electrodes. CHEMICAL COMMUNICATIONS 51, 17(2015), 3493–3500.

[289] Katz, E., Minko, S., Halamek, J., MacVittie, K., and Yancey, K. Elec-trode interfaces switchable by physical and chemical signals for biosensing, biofuel,and biocomputing applications. ANALYTICAL AND BIOANALYTICAL CHEM-ISTRY 405, 11 (APR 2013), 3659–3672.

[290] Katz, E., and Privman, V. Enzyme-based logic systems for information pro-cessing. CHEMICAL SOCIETY REVIEWS 39, 5 (2010), 1835–1857.

[291] Katz, E., Wang, J., Privman, M., and Halamek, J. Multianalyte DigitalEnzyme Biosensors with Built-in Boolean Logic. ANALYTICAL CHEMISTRY 84,13 (JUL 3 2012), 5463–5469.

[292] Kelarev, A. An algorithm for BCH codes extended with finite state automata.FUNDAMENTA INFORMATICAE 84, 1 (2008), 51–60. 17th Australian Work-shop on Combinatorial Algorithms, Uluru, AUSTRALIA, JUL 13-19, 2006.

[293] Khan, M. S., Kulathuramaiyer, N., and Maurer, H. Applications of mash-ups for a digital journal. JOURNAL OF UNIVERSAL COMPUTER SCIENCE14, 10 (2008), 1695–1716.

[294] Khoussainov, B. Randomness, computability, and algebraic specifications. AN-NALS OF PURE AND APPLIED LOGIC 91, 1 (JAN 12 1998), 1–15.

76

[295] Khoussainov, B., Semukhin, P., and Stephan, F. Applications of Kol-mogorov complexity to computable model theory. JOURNAL OF SYMBOLICLOGIC 72, 3 (SEP 2007), 1041–1054.

[296] Kieu, T. An anatomy of a quantum adiabatic algorithm that transcends the Tur-ing computability. INTERNATIONAL JOURNAL OF QUANTUM INFORMA-TION 3, 1 (MAR 2005), 177–182. International Meeting on Quantum InformationScience, Univ Camerino, Camerino, ITALY, APR 16-19, 2004.

[297] Kihara, T., and Miyabe, K. Unified characterizations of lowness propertiesvia Kolmogorov complexity. ARCHIVE FOR MATHEMATICAL LOGIC 54, 3-4(MAY 2015), 329–358.

[298] Kjos-Hanssen, B., Merkle, W., and Stephan, F. KOLMOGOROV COM-PLEXITY AND THE RECURSION THEOREM. TRANSACTIONS OF THEAMERICAN MATHEMATICAL SOCIETY 363, 10 (OCT 2011), 5465–5480.

[299] Kleijn, J., and Koutny, M. Processes of membrane systems with promoters andinhibitors. THEORETICAL COMPUTER SCIENCE 404, 1-2 (SEP 6 2008), 112–126. 33rd International Colloquium on Automata, Languages and Programming,Venice, ITALY, JUL 10-14, 2006.

[300] Kleijn, J., and Koutny, M. Petri Nets with Localities and Testing. In APPLI-CATIONS AND THEORY OF PETRI NETS, PROCEEDINGS (2010), Lilius, Jand Penczek, W, Ed., vol. 6128 of Lecture Notes in Computer Science, Inst Poly-tecn Beja, pp. 19–38. 31st International Conference on Applications and Theoryof Petri Nets and Other Models of Concurrency, Univ Minho, Sch Engn, Braga,PORTUGAL, JUN 21-25, 2010.

[301] KNOEBEL, R. EXPONENTIALS REITERATED. AMERICAN MATHEMAT-ICAL MONTHLY 88, 4 (1981), 235–252.

[302] Koh, D. E., Hall, M. J. W., Setiawan, Pope, J. E., Marletto, C., Kay,A., Scarani, V., and Ekert, A. Effects of Reduced Measurement Independenceon Bell-Based Randomness Expansion. PHYSICAL REVIEW LETTERS 109, 16(OCT 18 2012).

[303] Kojman, M., Lee, G., Omri, E., and Weiermann, A. Sharp thresholds for thephase transition between primitive recursive and Ackermannian Ramsey numbers.JOURNAL OF COMBINATORIAL THEORY SERIES A 115, 6 (AUG 2008),1036–1055.

[304] Kojman, M., and Shelah, S. Regressive Ramsey numbers are Ackermannian.JOURNAL OF COMBINATORIAL THEORY SERIES A 86, 1 (APR 1999), 177–181.

[305] Konstantinidis, S., and Silva, P. V. Computing Maximal Error-detectingCapabilities and Distances of Regular Languages. FUNDAMENTA INFORMAT-ICAE 101, 4 (2010), 257–270.

[306] Kramosil, I. Searching algorithms implemented on probabilistic systolic arrays.INTERNATIONAL JOURNAL OF GENERAL SYSTEMS 25, 1 (1996), 7–45.

77

[307] KRAMOSIL, I., and SINDELAR, J. ON PSEUDO RANDOM SEQUENCESAND THEIR RELATION TO A CLASS OF STOCHASTICAL LAWS. KYBER-NETIKA 28, 5 (1992), 383–391.

[308] Krishna, S., and Rama, R. On the power of tissue P systems working in theminimal mode. In UNCONVENTIONAL MODELS IN COMPUTATION, PRO-CEEDINGS (2002), Calude, C and Dinneen, MJ and Peper, F, Ed., vol. 2509 ofLECTURE NOTES IN COMPUTER SCIENCE, Ctr Discrete Math & TheoretComp Sci; Adv Res Ctr Commun Res Lab, pp. 208–219. 3rd International Con-ference on Unconventional Models of Computation, KOBE, JAPAN, OCT 15-19,2002.

[309] Kucera, A., and Slaman, T. Randomness and recursive enumerability. SIAMJOURNAL ON COMPUTING 31, 1 (JUL 29 2001), 199–211.

[310] Kulkarni, A., Kim, B., Dugasani, S. R., Joshirao, P., Kim, J. A., Vyas,C., Manchanda, V., Kim, T., and Park, S. H. A novel nanometric DNA thinfilm as a sensor for alpha radiation. SCIENTIFIC REPORTS 3 (JUN 24 2013).

[311] Kummer, M. Kolmogorov complexity and instance complexity of recursively enu-merable sets. SIAM JOURNAL ON COMPUTING 25, 6 (DEC 1996), 1123–1143.

[312] Kuppusamy, L., Mahendran, A., and Krithivasan, K. ON THE AMBIGU-ITY OF INSERTION SYSTEMS. INTERNATIONAL JOURNAL OF FOUNDA-TIONS OF COMPUTER SCIENCE 22, 7, SI (NOV 2011), 1747–1758.

[313] Kuzaev, G., and Lebedeva, T. New logic components for processing complexmeasurement data. MEASUREMENT TECHNIQUES 43, 12 (DEC 2000), 1070–1073.

[314] Latif, A., Afzal, M. T., and Maurer, H. Weaving Scholarly Legacy Datainto Web of Data. JOURNAL OF UNIVERSAL COMPUTER SCIENCE 18, 16(2012), 2301–2318.

[315] Latkowski, R. Application of data decomposition to incomplete informationsystems. In INTELLIGENT INFORMATION SYSTEMS 2002, PROCEEDINGS(2002), Klopotek, MA and Wierzchon, ST and Michalewicz, M, Ed., ADVANCESIN SOFT COMPUTING, Polish Acad Sci, Inst Comp Sci, pp. 321–330. Symposiumon Intelligent Information Systems (IIS 2002), SOPOT, POLAND, JUN 03-06,2002.

[316] Lattimore, T., and Hutter, M. On Martin-Lof (non-)convergence ofSolomonoff’s universal mixture. THEORETICAL COMPUTER SCIENCE 588(JUL 11 2015), 2–15.

[317] Lecue, F., Delteil, A., and Leger, A. Towards the Composition of Statefuland Independent Semantic Web Services. In APPLIED COMPUTING 2008, VOLS1-3 (2008), ACM SIGAC; Univ Fortaleza; Federal Univ Ceara, pp. 2279–2285. 23rdAnnual ACM Symposium on Applied Computing, Fortaleza, BRAZIL, MAR 16-20,2008.

78

[318] Legg, S. Is there an elegant universal theory of prediction? In ALGORITHMICLEARNING THEORY, PROCEEDINGS (2006), Balcazar, JL and Long, PM andStephan, F, Ed., vol. 4264 of LECTURE NOTES IN ARTIFICIAL INTELLI-GENCE, Spanish Minist Sci; Google; Pascal Network Excellence; PASCAL Dia-logues 2006; Univ Politecn Calalunya; Idescat, Stat Inst Catalonia; Univ Lubeck,Inst Theoret Informatik; Hokkaido Univ, Div Comp Sci, pp. 274–287. 17th In-ternational Conference on Algorithmic Learning Theory (ALT 2006), Barcelona,SPAIN, OCT 07-10, 2006.

[319] Legg, S., and Hutter, M. Universal intelligence: A definition of machineintelligence. MINDS AND MACHINES 17, 4 (DEC 2007), 391–444.

[320] LENNON, J., and MAURER, H. APPLICATIONS OF HYPERMEDIA SYS-TEMS. PROGRAMMING AND COMPUTER SOFTWARE 21, 3 (MAY-JUN1995), 121–134.

[321] Lesniak, K. ON DISCRETE STOCHASTIC PROCESSES WITH DISJUNC-TIVE OUTCOMES. BULLETIN OF THE AUSTRALIAN MATHEMATICALSOCIETY 90, 1 (AUG 2014), 149–159.

[322] Lesniak, K. Random iteration for infinite nonexpansive iterated function systems.CHAOS 25, 8 (AUG 2015).

[323] Lewis, A. E. M., and Barmpalias, G. Random reals and Lipschitz continu-ity. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE 16, 5 (OCT2006), 737–749. 1st Conference on Computability in Europe - New ComputationalParadigms, Univ Amsterdam, Amsterdam, NETHERLANDS, JUN, 2005.

[324] Lewis, A. E. M., and Barmpalias, G. Randomness and the linear degrees ofcomputability. ANNALS OF PURE AND APPLIED LOGIC 145, 3 (MAR 2007),252–257.

[325] Li, C.-C. Speed-up theorems in type-2 computation. In Computation and Logicin the Real World, Proceedings (2007), Cooper, SB and Lowe, B and Sorbi, A,Ed., vol. 4497 of LECTURE NOTES IN COMPUTER SCIENCE, Dept Math &Comp Sci Roberto Magari; Fondazione Monte Paschi Siena; Ist Nazl Alta Matemat;Gruppo Nazl Strutture Algebriche; INDAM GNSAGA; Univ Siena; Assoc ItalianaLog & Applicazioni; Assoc Symbol Log; European Assoc Comp Sci Log; EuropeanAssoc Theoret Comp Sci; Assoc Log, Language & Informat; Comm Status WomenComp Res, pp. 478–487. 3rd Conference on Computability in Europe (CiE 2007),Siena, ITALY, JUN 18-23, 2007.

[326] Li, C.-C. Speed-Up Theorems in Type-2 Computations Using Oracle Turing Ma-chines. THEORY OF COMPUTING SYSTEMS 45, 4 (NOV 2009), 880–896. 3rdComputability in Europe Conference 2007, Univ Siena, Siena, ITALY, 2007.

[327] Li, L., and Qiu, D. On the State Minimization of Fuzzy Automata. IEEETRANSACTIONS ON FUZZY SYSTEMS 23, 2 (APR 2015), 434–443.

[328] Liu, C. Generalization of complexity oscillations in infinite sequences. In ICNC2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPU-TATION, VOL 1, PROCEEDINGS (2008), Guo, MZ and Zhao, L and Wang, LP,

79

Ed., Int Nat Computat & Knowledge Discovery Assoc; Shandong Univ, pp. 299–303. 4th International Conference on Natural Computation (ICNC 2008), Jian,PEOPLES R CHINA, OCT 18-20, 2008.

[329] Liu, C. The quasi-equivalence between the definitions of partial randomness.In ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURALCOMPUTATION, VOL 1, PROCEEDINGS (2008), Guo, MZ and Zhao, L andWang, LP, Ed., Int Nat Computat & Knowledge Discovery Assoc; Shandong Univ,pp. 371–375. 4th International Conference on Natural Computation (ICNC 2008),Jian, PEOPLES R CHINA, OCT 18-20, 2008.

[330] Liu, X., Matsikoudis, E., and Lee, E. A. Modeling timed concurrent systems.In CONCUR 2006 - CONCURRENCY THEORY, PROCEEDINGS (2006), Baier,C and Hermanns, H, Ed., vol. 4137 of Lecture Notes in Computer Science, pp. 1–15.17th International Conference on Concurrency Theory, Bonn, GERMANY, AUG27-30, 2006.

[331] Lloyd, S. A Turing test for free will. PHILOSOPHICAL TRANSACTIONS OFTHE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEER-ING SCIENCES 370, 1971, SI (JUL 28 2012), 3597–3610.

[332] Longo, G. Incomputability in Physics. In PROGRAMS, PROOFS, PROCESSES(2010), Ferreira, F and Lowe, B and Mayordomo, E and Gomes, LM, Ed., vol. 6158of Lecture Notes in Computer Science, pp. 276–285. 6th Conference on Computabil-ity in Europe (CiE 2010), Univ Azores, Ponta Delgada, PORTUGAL, JUN 30-JUL04, 2010.

[333] Longo, G. Incomputability in Physics and Biology. MATHEMATICAL STRUC-TURES IN COMPUTER SCIENCE 22, 5, SI (OCT 2012), 880–900.

[334] Longo, G., Miquel, P.-A., Sonnenschein, C., and Soto, A. M. Is infor-mation a proper observable for biological organization? PROGRESS IN BIO-PHYSICS & MOLECULAR BIOLOGY 109, 3 (AUG 2012), 108–114.

[335] Luo, L. The future of lattice-gas and lattice Boltzmann methods. In COMPU-TATIONAL AEROSCIENCES IN THE 21ST CENTURY (2000), Salas, MD andAnderson, WK, Ed., vol. 8 of ICASE/LARC INTERDISCIPLINARY SERIES INSCIENCE AND ENGINEERING, Inst Comp Applicat Sci & Engn; NASA Lang-ley Res Ctr; Natl Sci Fdn; USA, Off Res, pp. 165–187. ICAS/LaRC/NSF/AROWorkshop on Computational Aerosciences in the 21st Century, HAMPTON, VA,APR 22-24, 1998.

[336] Lupacchini, R. Proof as a path of light. In DEDUCTION, COMPUTATION,EXPERIMENT: EXPLORING THE EFFECTIVENESS OF PROOF (2008), Lu-pacchini, R and Corsi, G, Ed., Univ Bologna, pp. 195–221. Workshop on Deduc-tion, Computation, Experiment - Exploring the Effectiveness of Proof‘, Bologna,ITALY, APR 03-04, 2007.

[337] Lupacchini, R., and Tamburrini, G. Grounding effective processes in empiricallaws: introductory remarks. In GROUNDING EFFECTIVE PROCESSES IN EM-PIRICAL LAWS: REFLECTIONS ON THE NOTION OF ALGORITHM (1999),Lupacchini, R and Tamburrini, G, Ed., Comune Cesena; F Enriques Ctr; ELSAG,

80

pp. 9–21. Workshop on Symbols, Physical Processes, Biological Processes-RecentExplorations of the Notion of Algorithm, CESENA, ITALY, FEB 16, 1999.

[338] MacVittie, K., Halamek, J., and Katz, E. Enzyme-based D-flip-flop memorysystem. CHEMICAL COMMUNICATIONS 48, 96 (2012), 11742–11744.

[339] MacVittie, K., Halamek, J., and Katz, E. Enzyme-Based T-Flip-Flop Mem-ory System. INTERNATIONAL JOURNAL OF UNCONVENTIONAL COM-PUTING 8, 5-6, SI (2012), 383–389.

[340] MacVittie, K., and Katz, E. Electrochemical System with MemimpedanceProperties. JOURNAL OF PHYSICAL CHEMISTRY C 117, 47 (NOV 28 2013),24943–24947.

[341] MacVittie, K., and Katz, E. Biochemical flip-flop memory systems: essen-tial additions to autonomous biocomputing and biosensing systems. INTERNA-TIONAL JOURNAL OF GENERAL SYSTEMS 43, 7, SI (2014), 722–739.

[342] MacVittie, K., and Katz, E. Self-powered electrochemical memristor based ona biofuel cell - towards memristors integrated with biocomputing systems. CHEM-ICAL COMMUNICATIONS 50, 37 (2014), 4816–4819.

[343] Mailloux, S., Gerasimova, Y. V., Guz, N., Kolpashchikov, D. M., andKatz, E. Bridging the Two Worlds: A Universal Interface between Enzymaticand DNA Computing Systems. ANGEWANDTE CHEMIE-INTERNATIONALEDITION 54, 22 (MAY 26 2015), 6562–6566.

[344] Maldonado, C. E., and Gomez Cruz, N. A. Biological Hypercomputation: ANew Research Problem in Complexity Theory. COMPLEXITY 20, 4 (MAR-APR2015), 8–18.

[345] Malescio, G. Predicting with unpredictability. NATURE 434, 7037 (APR 282005), 1073.

[346] Manca, V., Martin-Vide, C., and Paun, G. New computing paradigms sug-gested by DNA computing: computing by carving. BIOSYSTEMS 52, 1-3 (OCT1999), 47–54. 4th International Meeting on DNA Based Computers, UNIV PENN-SYLVANIA, PHILADELPHIA, PENNSYLVANIA, JUN 15-19, 1998.

[347] MANDOIU, I. ON A THEOREM OF GACS. INTERNATIONAL JOURNALOF COMPUTER MATHEMATICS 48, 3-4 (1993), 157–169.

[348] Mandoiu, I. Optimum extensions of prefix codes. INFORMATION PROCESS-ING LETTERS 66, 1 (APR 15 1998), 35–40.

[349] Manin, Y. I. Infinities in Quantum Field Theory and in Classical Computing:Renormalization Program. In PROGRAMS, PROOFS, PROCESSES (2010), Fer-reira, F and Lowe, B and Mayordomo, E and Gomes, LM, Ed., vol. 6158 of LectureNotes in Computer Science, pp. 307–316. 6th Conference on Computability inEurope (CiE 2010), Univ Azores, Ponta Delgada, PORTUGAL, JUN 30-JUL 04,2010.

81

[350] Manin, Y. I. Renormalisation and computation II: time cut-off and the HaltingProblem. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE 22, 5,SI (OCT 2012), 729–751.

[351] Manin, Y. I. Complexity vs energy: theory of computation and theoreti-cal physics. In 3QUANTUM: ALGEBRA GEOMETRY INFORMATION (QQQCONFERENCE 2012) (2014), vol. 532 of Journal of Physics Conference Series,ITGP N W ESF; AGMP. Conference on 3Quantum - Algebra Geometry Informa-tion (QQQ), Tallinn Univ Technol, Tallinn, ESTONIA, JUL 10-13, 2012.

[352] Manin, Y. I. Zipf’s law and L. Levin probability distributions. FUNCTIONALANALYSIS AND ITS APPLICATIONS 48, 2 (APR 2014), 116–127.

[353] Marcus, S. Bridging two hierarchies of infinite words. JOURNAL OF UNIVER-SAL COMPUTER SCIENCE 8, 2 (2002), 292–296.

[354] Marcus, S. Proofs and mistakes: Their syntactics, semantics, and pragmatics.SEMIOTICA 188, 1-4, SI (2012), 139–155.

[355] Maroosi, A., and Muniyandi, R. C. Enhancement of membrane computingmodel implementation on GPU by introducing matrix representation for balancingoccupancy and reducing inter-block communications. JOURNAL OF COMPUTA-TIONAL SCIENCE 5, 6, SI (NOV 2014), 861–871.

[356] Martin-Delgado, M. A. On Quantum Effects in a Theory of Biological Evolu-tion. SCIENTIFIC REPORTS 2 (MAR 12 2012).

[357] Martin-Delgado, M.-A. ALAN TURING AND THE ORIGINS OF COM-PLEXITY. ARBOR-CIENCIA PENSAMIENTO Y CULTURA 189, 764 (2013).

[358] Marzlin, K.-P., and Landry, T. On the connection between the theorems ofGleason and of Kochen and Specker. CANADIAN JOURNAL OF PHYSICS 93,12 (DEC 2015), 1446–1452.

[359] Mateescu, A., Paun, G., Rozenberg, G., and Salomaa, A. Characteriza-tions of RE languages starting from internal contextual languages. INTERNA-TIONAL JOURNAL OF COMPUTER MATHEMATICS 66, 3-4 (1998), 179–197.

[360] Matsueda, H. Coherent modes in an ensemble of quantum dots generated bydynamic dipole-dipole interactions. SUPERLATTICES AND MICROSTRUC-TURES 24, 6 (1998), 423–433.

[361] Matsueda, H. Spatiotemporal dynamics of quantum computing dipole-dipoleblock systems. CHAOS SOLITONS & FRACTALS 10, 10 (OCT 1999), 1737–1748.

[362] Matsueda, H., and Cohen, D. Quantum logical diagram of quantum computingevolution. In QUANTUM COHERENCE AND DECOHERENCE (1999), Ono,YA and Fujikawa, K, Ed., NORTH-HOLLAND DELTA SERIES, Phys Soc Japan;Japan Soc Appl Phys; Adv Res Lab, Hitachi Ltd, pp. 37–40. 6th InternationalSymposium on Foundations of Quantum Mechanics in the Light of New Technology(ISQM-Tokyo 98), ADV RES LAB, HITACHI LTD, HATOYAMA, JAPAN, AUG24-27, 1998.

82

[363] Matvejchuk, M., and Utkina, E. Kochen-Specker Theorem in Krein Space.INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS 53, 10 (OCT2014), 3658–3665.

[364] Maurer, H. Hypermedia systems as Internet tools. In COMPUTER SCI-ENCE TODAY, vol. 1000 of LECTURE NOTES IN COMPUTER SCIENCE.1995, pp. 608–624.

[365] Merkle, W., and Mihailovic, N. On the construction of effective random sets.In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002 (2002),Diks, K and Rytter, W, Ed., vol. 2420 of LECTURE NOTES IN COMPUTERSCIENCE, Warsaw Univ, Inst Informat; Fdn Informat Technol Dev, pp. 568–580.27th International Symposium on Mathematical Foundations of Computer Science,WARSAW, POLAND, AUG 26-30, 2002.

[366] Merkle, W., Mihailovic, N., and Slaman, T. A. Some results on effectiverandomness. THEORY OF COMPUTING SYSTEMS 39, 5 (SEP 2006), 707–721.

[367] Messner, J., and Thierauf, T. A Kolmogorov complexity proof of the Lo-vasz Local Lemma for satisfiability. THEORETICAL COMPUTER SCIENCE461 (NOV 23 2012), 55–64. 17th International Computing and CombinatoricsConference (COCOON), Dallas, TX, AUG 14-16, 2011.

[368] Meyer, T., Schreckling, D., Tschudin, C., and Yamamoto, L. Robust-ness to Code and Data Deletion in Autocatalytic Quines. In TRANSACTIONSON COMPUTATIONAL SYSTEMS BIOLOGY X (2008), Priami, C and Akan,OB and Dressler, F and Ngom, A, Ed., vol. 5410 of Lecture Notes in ComputerScience, pp. 20–40. 2nd International Conference on Bio-Inspired Models of Net-work, Information and Computing Systems, Budapest, HUNGARY, DEC 10-13,2007.

[369] Meyer, T., and Tschudin, C. Robust Network Services with Distributed CodeRewriting. In BIOLOGICALLY INSPIRED NETWORKING AND SENSING:ALGORITHMS AND ARCHITECTURES. 2012, pp. 36–57.

[370] Meyer, T., Yamamoto, L., and Tschudin, C. An Artificial Chemistry for Net-working. In BIO-INSPIRED COMPUTING AND COMMUNICATION (2008),Lio, P and Yoneki, E and Verma, DC, Ed., vol. 5151 of Lecture Notes in ComputerScience, pp. 45–57. 1st Workshop on Bio-Inspired Design of Networks, Cambridge,ENGLAND, APR 02-05, 2007.

[371] Mieszkowicz-Rolka, A., and Rolka, L. Determining significance of attributesin the unified rough set approach. In Rough Sets, Fuzzy Sets, Data Mining andGranular Computing, Proceedings (2007), An, A and Stefanowski, J and Ramanna,S and Butz, CJ and Pedrycz, W and Wang, G, Ed., vol. 4482 of LECTURENOTES IN ARTIFICIAL INTELLIGENCE, Infobright Inc; MaRS Discovery Dist;York Univ; Int Rough Set Soc; Int Fuzzy Syst Assoc; Chinese Assoc ArtificialIntelligence, Rough Sets & Soft Computat Soc; Natl Res Council Canada, pp. 71–78. 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining andGranular Computing (RSFDGrC 2007), Toronto, CANADA, MAY 14-16, 2007.

83

[372] Miller, J. S., and Nies, A. Randomness and computability: Open questions.BULLETIN OF SYMBOLIC LOGIC 12, 3 (SEP 2006), 390–410.

[373] Miranda, E. R. Harnessing the Intelligence of Physarum Polycephalum for Un-conventional Computing-Aided Musical Composition. INTERNATIONAL JOUR-NAL OF UNCONVENTIONAL COMPUTING 10, 3, SI (2014), 251–268.

[374] Miranda, E. R., Adamatzky, A., and Jones, J. Sounds Synthesis with SlimeMould of Physarum Polycephalum. JOURNAL OF BIONIC ENGINEERING 8,2 (JUN 2011), 107–113.

[375] Miranda, E. R., Bull, L., Gueguen, F., and Uroukov, I. S. ComputerMusic Meets Unconventional Computing: Towards Sound Synthesis with In VitroNeuronal Networks. COMPUTER MUSIC JOURNAL 33, 1 (SPR 2009), 9–18.

[376] Miszczak, J. A. Generating and using truly random quantum states in Mathe-matica. COMPUTER PHYSICS COMMUNICATIONS 183, 1 (JAN 2012), 118–124.

[377] Mitchell, M. W., Abellan, C., and Amaya, W. Strong experimental guar-antees in ultrafast quantum random number generation. PHYSICAL REVIEW A91, 1 (JAN 12 2015).

[378] Miyabe, K. The difference between optimality and universality. LOGIC JOUR-NAL OF THE IGPL 20, 1 (FEB 2012), 222–234.

[379] Miyamoto, S. Bags, Toll Sets, and Fuzzy Sets. In INTEGRATED UN-CERTAINTY MANAGEMENT AND APPLICATIONS (2010), Huynh, VN andNakamori, Y and Lawry, J and Inuiguchi, M, Ed., vol. 68 of Advances in Intelligentand Soft Computing, pp. 307–317. International Symposium on Integrated Uncer-tainty Management and Applications, Japan Adv Inst Sci & Technol, Ishikawa,JAPAN, APR 09-11, 2010.

[380] Miyamoto, S. Different generalizations of bags. ANNALS OF OPERATIONSRESEARCH 195, 1 (MAY 2012), 221–236.

[381] Miyamoto, S., and Mizutani, K. Fuzzy multiset space and c-means clusteringusing kernels with application to information retrieval. In FUZZY SETS ANDSYSTEMS - IFSA 2003, PROCEEDINGS (2003), Bilgic, T and DeBaets, B andKaynak, O, Ed., vol. 2715 of LECTURE NOTES IN ARTIFICIAL INTELLI-GENCE, Bogazici Univ Fdn; Turkish Sci & Tech Res Council, pp. 387–395. 10thInternational-Fuzzy-Systems-Association World Congress, ISTANBUL, TURKEY,JUN 30-JUL 02, 2003.

[382] Moseley, F., Halamek, J., Kramer, F., Poghossian, A., Schoening,M. J., and Katz, E. An enzyme-based reversible CNOT logic gate realizedin a flow system. ANALYST 139, 8 (2014), 1839–1842.

[383] MOSS, G. NEW INFORMATION TECHNOLOGIES IN HIGHER-EDUCATION- CALUDE,C, CHITORAN,D, MALITZA,M. HIGHER EDUCATION 21, 2 (MAR1991), 271.

84

[384] Muller, S. Asymmetry: The Foundation of Information. In ASYMMETRY:THE FOUNDATION OF INFORMATION, Frontiers Collection. 2007, pp. 1–165.

[385] Murphy, N., Naughton, T. J., Woods, D., Henley, B., McDermott, K.,Duffy, E., van der Burgt, P. J. M., and Woods, N. Implementations ofa model of physical sorting. INTERNATIONAL JOURNAL OF UNCONVEN-TIONAL COMPUTING 4, 1 (2008), 3–12.

[386] NADIN, M. INTERFACE DESIGN - A SEMIOTIC PARADIGM. SEMIOTICA69, 3-4 (1988), 269–302.

[387] Nagy, B., and Valyi, S. A Characterization of NP Within Interval-Valued Com-puting. In MACHINES, COMPUTATIONS, AND UNIVERSALITY, MCU 2015(2015), DurandLose, J and Nagy, B, Ed., vol. 9288 of Lecture Notes in ComputerScience, Eastern Mediterranean Univ, pp. 164–179. 7th International Conferenceon Machines, Computations and Universality (MCU), Famagusta, CYPRUS, SEP09-11, 2015.

[388] Narimani, H., and Khosravifard, M. The Supertree of the Compact Codes. In2008 INTERNATIONAL SYMPOSIUM ON TELECOMMUNICATIONS, VOLS1 AND 2 (2008), pp. 649–655. International Symposium on Telecommunications,Tehran, IRAN, AUG 27-28, 2008.

[389] Nayebi, A. Practical Intractability: A Critique of the Hypercomputation Move-ment. MINDS AND MACHINES 24, 3 (AUG 2014), 275–305.

[390] Nehaniv, C. L., Rhodes, J., Egri-Nagy, A., Dini, P., Morris, E. R.,Horvath, G., Karimi, F., Schreckling, D., and Schilstra, M. J. Sym-metry structure in discrete models of biochemical systems: natural subsystemsand the weak control hierarchy in a new model of computation driven by in-teractions. PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETYA-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES 373, 2046(JUL 28 2015).

[391] Ng, T., Rappaport, D., and Salomaa, K. State Complexity of Neigh-bourhoods and Approximate Pattern Matching. In DEVELOPMENTS IN LAN-GUAGE THEORY (DLT 2015) (2015), Potapov, I, Ed., vol. 9168 of Lecture Notesin Computer Science, Univ Liverpool, pp. 389–400. 19th International Conferenceon Developments in Language Theory (DLT), Liverpool, ENGLAND, JUL 27-30,2015.

[392] Niculiu, T., Copilau, A., Lupu, C., and Manolescu, A. HIERARCHICALINTELLIGENT ANALOG SIMULATION. In EMSS 2008: 20TH EUROPEANMODELING AND SIMULATION SYMPOSIUM (2008), Bruzzone, A and Longo,F and Piera, MA and Aguilar, RM and Frydman, C, Ed., Univ Calabria, MechDept; MSC-LES Modelin and Simulat Ctr, Lab Enterprise Solut; Univ Genoa,DIPTEM; Liophant Simulat; IEEE; Soc Comp Simulat Int; McLeod Inst SimulaSci; Modeling & Simulat Network; Int Mediterranean and Latin Amer CouncilSimulat; Auton Univ Barcelona; Univ La Laguna; Management & Adv Solut &Technol; Tonno Callipo; Liquiriszie Amarelli; Giulio Barca Prodotti Pelle, pp. 323–332. 20th European Modeling and Simulation Symposium, Amantea, ITALY, SEP17-19, 2008.

85

[393] Niculiu, T.-R., and Niculiu, M. CONSCIENTIOUSLY LOOKING FOR CON-SCIENCE. EUROPEAN JOURNAL OF SCIENCE AND THEOLOGY 9, 3 (JUN2013), 15–28.

[394] Nolte, D., and Priese, L. Abstract fairness and semantics. THEORETICALCOMPUTER SCIENCE 177, 1 (APR 30 1997), 139–153. 10th Conference on theMathematical Foundations of Programming Semantics, KANSAS STATE UNIV,LAWRENCE, KS, MAR, 1994.

[395] Nowicki, R. Rough Neuro-Fuzzy Structures for Classification With Missing Data.IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS 39, 6 (DEC 2009), 1334–1347.

[396] Nugent, M. A., Porter, R., and Kenyon, G. T. Reliable computing withunreliable components: Using separable environments to stabilize long-term infor-mation storage. PHYSICA D-NONLINEAR PHENOMENA 237, 9 (JUL 1 2008),1196–1206.

[397] Nunes de Castro, L. Fundamentals of natural computing: an overview.PHYSICS OF LIFE REVIEWS 4, 1 (MAR 2007), 1–36.

[398] Okubo, F. REACTION AUTOMATA WORKING IN SEQUENTIAL MAN-NER. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS 48, 1(JAN 2014), 23–38.

[399] Okubo, F., Kobayashi, S., and Yokomori, T. On the properties of languageclasses defined by bounded reaction automata. THEORETICAL COMPUTERSCIENCE 454 (OCT 5 2012), 206–221.

[400] Okubo, F., Kobayashi, S., and Yokomori, T. Reaction automata. THEO-RETICAL COMPUTER SCIENCE 429 (APR 20 2012), 247–257.

[401] Okubo, F., and Yokomori, T. Finite Automata with Multiset Memory: A NewCharacterization of Chomsky Hierarchy. FUNDAMENTA INFORMATICAE 138,1-2, SI (2015), 31–44.

[402] Omri, E., and Weiermann, A. Classifying the phase transition threshold forAckermannian functions. ANNALS OF PURE AND APPLIED LOGIC 158, 3(APR 2009), 156–162. 3rd International Conference on Methods of Logic in Math-ematics, Euler Inst, St Petersburg, RUSSIA, JUN 01-07, 2006.

[403] Palmer, T. N., and O’Shea, M. Solving difficult problems creatively: a rolefor energy optimised deterministic/stochastic hybrid computing. FRONTIERS INCOMPUTATIONAL NEUROSCIENCE 9 (OCT 12 2015).

[404] Panu, G. Spiking Neural P Systems. A Quick Survey and Some Research Topics.In 16TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERICALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2014) (2014), Win-kler, F and Negru, V and Ida, T and Jebelean, T and Petcu, D and Watt, S andZaharie, D, Ed., IEEE; IEEE Comp Soc, pp. 20–25. 16th International Sympo-sium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC),Timisoara, ROMANIA, SEP 22-25, 2014.

86

[405] Paterek, T., Kofler, J., Prevedel, R., Klimek, P., Aspelmeyer, M.,Zeilinger, A., and Brukner, C. Logical independence and quantum random-ness. NEW JOURNAL OF PHYSICS 12 (JAN 20 2010).

[406] Paun, G. Distributed architectures in DNA computing based on splicing: Lim-iting the size of components. In UNCONVENTIONAL MODELS OF COMPU-TATION (1998), Calude, CS and Casti, J and Dinneen, MJ, Ed., SPRINGERSERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTERSCIENCE, Univ Auckland; Ctr Discrete Math & Theoret Comp Sci; Santa Fe Inst,pp. 323–335. 1st International Conference on Unconventional Models of Computa-tion (UMC 98), UNIV AUCKLAND, AUCKLAND, NEW ZEALAND, JAN 05-09,1998.

[407] Paun, G. DNA computing based on splicing: universality results. THEORETI-CAL COMPUTER SCIENCE 231, 2 (JAN 28 2000), 275–296. 2nd InternationalColloquium on Universal Machines and Computations (MCU 98), INST UNIVTECHNOL METZ, METZ, FRANCE, MAR 23-27, 1998.

[408] Paun, G. From cells to computers: computing with membranes (P systems).BIOSYSTEMS 59, 3 (MAR 2001), 139–158. Workshop on Grammar Systems,BAD ISCHL, AUSTRIA, JUL, 2000.

[409] Paun, G. Membrane computing. In FUNDAMENTALS OF COMPUTATIONTHEORY, PROCEEDINGS (2003), Lingas, A and Nilsson, BJ, Ed., vol. 2751 ofLECTURE NOTES IN COMPUTER SCIENCE, Lung Univ; Malmo Univ Coll;Swedish Res Council, pp. 284–295. 14th International Symposium on Fundamentalsof Computation Theory, MALMO, SWEDEN, AUG 12-15, 2003.

[410] Paun, G. Tracing some open problems in membrane computing. ROMANIANJOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY 10, 4 (2007),303–314.

[411] Paun, G. Unconventional Computing: Do We Dream Too Much? In EVOLVINGCOMPUTABILITY (2015), Beckmann, A and Mitrana, V and Soskova, M, Ed.,vol. 9136 of Lecture Notes in Computer Science, pp. 63–70. 11th Conference onComputability in Europe (CiE), Univ Bucharest, Fac Math & Comp Sci, Bucharest,ROMANIA, JUN 29-JUL 03, 2015.

[412] Paun, G., Suzuki, Y., and Tanaka, H. P systems with energy accounting.INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 78, 3 (2001),343–364.

[413] Pavel, A. B., and Buiu, C. Using enzymatic numerical P systems for modelingmobile robot controllers. NATURAL COMPUTING 11, 3, SI (SEP 2012), 387–393.

[414] Pavlov, B., Roach, G., and Yafyasov, A. Resonance scattering and design ofquantum gates. In UNCONVENTIONAL MODELS OF COMPUTATION (1998),Calude, CS and Casti, J and Dinneen, MJ, Ed., SPRINGER SERIES IN DIS-CRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, UnivAuckland; Ctr Discrete Math & Theoret Comp Sci; Santa Fe Inst, pp. 336–351.1st International Conference on Unconventional Models of Computation (UMC98), UNIV AUCKLAND, AUCKLAND, NEW ZEALAND, JAN 05-09, 1998.

87

[415] Piccinini, G. The Physical Church-Turing Thesis: Modest or Bold? BRITISHJOURNAL FOR THE PHILOSOPHY OF SCIENCE 62, 4 (DEC 2011), 733–769.

[416] Pina-Garcia, C. A., and Garcia-Vega, V. A. A hybrid methodology forrobotic architectures with a cellular approach. In 2006 1st IEEE InternationalConference on E-Learning in Industrial Electronics (2006), IEEE, pp. 156–160.1st IEEE International Conference on E-Learning in Industrial Electronics, Ham-mamet, TUNISIA, DEC 18-20, 2006.

[417] Planat, M., and Saniga, M. Five-qubit contextuality, noise-like distributionof distances between maximal bases and finite geometry. PHYSICS LETTERS A376, 46 (OCT 15 2012), 3485–3490.

[418] Plonka, P. M., Passeron, T., Brenner, M., Tobin, D. J., Shibahara, S.,Thomas, A., Slominski, A., Kadekaro, A. L., Hershkovitz, D., Peters,E., Nordlund, J. J., Abdel-Malek, Z., Takeda, K., Paus, R., Ortonne,J. P., Hearing, V. J., and Schallreuter, K. U. What are melanocytesreally doing all day long...? EXPERIMENTAL DERMATOLOGY 18, 9 (SEP2009), 799–819.

[419] Porrot, S., Dauchet, M., Durand, B., and Vereshchagin, N. Determin-istic rational transducers and random sequences. In FOUNDATIONS OF SOFT-WARE SCIENCE AND COMPUTATION STRUCTURES (1998), Nivat, M, Ed.,vol. 1378 of LECTURE NOTES IN COMPUTER SCIENCE, Portugal Telecom;TAP Air Portugal; Luso Amer Dev Fdn; British Council; Commiss European Com-munities, Programme Training & Mobil Researchers; Univ Lisbon; European AssocTheoret Comp Sci; European Assoc Programming Languages & Syst; GulbenkianFdn, pp. 258–272. 1st International Conference on Foundations of Software Scienceand Computation Structures (FoSSaCS 98) at the Joint European Conf on Theoryand Practice of Software, LISBON, PORTUGAL, MAR 28-APR 04, 1998.

[420] Potgieter, P. H. Zeno machines and hypercomputation. THEORETICALCOMPUTER SCIENCE 358, 1 (JUL 31 2006), 23–33.

[421] Povarov, G. A. Regularity of a Dynamic Neighborhood of a Regular Language.PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS 267, 1(DEC 2009), S201–S209.

[422] Privman, V., Domanskyi, S., Mailloux, S., Holade, Y., and Katz, E.Kinetic Model for a Threshold Filter in an Enzymatic System for Bioanalytical andBiocomputing Applications. JOURNAL OF PHYSICAL CHEMISTRY B 118, 43(OCT 30 2014), 12435–12443.

[423] Privman, V., Fratto, B. E., Zavalov, O., Halamek, J., and Katz, E.Enzymatic AND Logic Gate with Sigmoid Response Induced by PhotochemicallyControlled Oxidation of the Output. JOURNAL OF PHYSICAL CHEMISTRY B117, 25 (JUN 27 2013), 7559–7568.

[424] Privman, V., and Katz, E. Can bio-inspired information processing steps berealized as synthetic biochemical processes? PHYSICA STATUS SOLIDI A-APPLICATIONS AND MATERIALS SCIENCE 212, 2 (FEB 2015), 219–228.

88

[425] Privman, V., Zavalov, O., Halamkova, L., Moseley, F., Halamek, J.,and Katz, E. Networked Enzymatic Logic Gates with Filtering: New Theoret-ical Modeling Expressions and Their Experimental Application. JOURNAL OFPHYSICAL CHEMISTRY B 117, 48 (DEC 5 2013), 14928–14939.

[426] Putz, V., and Svozil, K. Can a Computer be “Pushed” to Perform Faster-Than-Light? INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING8, 1, SI (2012), 99–105.

[427] Qiu, D., and Yu, S. Hierarchy and equivalence of multi-letter quantum finiteautomata. THEORETICAL COMPUTER SCIENCE 410, 30-32 (AUG 20 2009),3006–3017.

[428] Ratsaby, J. An empirical study of the complexity and randomness of predic-tion error sequences. COMMUNICATIONS IN NONLINEAR SCIENCE ANDNUMERICAL SIMULATION 16, 7 (JUL 2011), 2832–2844.

[429] Rettinger, R., and Zheng, X. Hierarchy of monotonically computable realnumbers. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE2001 (2001), Sgall, J and Pultr, A and Kolman, P, Ed., vol. 2136 of Lecture Notesin Computer Science, Acad Sci Czech Republ, Math Inst; Inst Theoret CompSci; Inst Comp Sci; Act M Agcy, pp. 633–644. 26th International Symposium onMathematical Foundations of Computer Science, MARIANSKE LAZNE, CZECHREPUBLIC, AUG 27-31, 2001.

[430] Rettinger, R., and Zheng, X. Solovay reducibility on d-c.e real numbers.In COMPUTING AND COMBINATORICS, PROCEEDINGS (2005), Wang, LH,Ed., vol. 3595 of Lecture Notes in Computer Science, Chinese Acad Sci, Acad Math& Syst Sci, pp. 359–368. 11th Annual International Conference on Computing andCombinatorics (COCOON 2005), Kunming, PEOPLES R CHINA, AUG 16-29,2005.

[431] Rettinger, R., Zheng, X., Gengler, R., and von Braunmuhl, B. Monoton-ically computable real numbers. In COMBINATORICS, COMPUTABILITY ANDLOGIC (2001), Calude, CS and Dinneen, MJ and Sburlan, S, Ed., DISCRETEMATHEMATICS AND THEORETICAL COMPUTER SCIENCE (SERIES), FacMath & Comp Sci; Ovidius Univ; Univ Auckland, Ctr Discrete Math & Theo-ret Sci, pp. 187–201. 3rd International Conference on Discrete Mathematics andTheoretical Computer Science (DMTCS 01), CONSTANTA, ROMANIA, 2001.

[432] Rettinger, R., Zheng, X., Gengler, R., and von Braunmuhl, B. Weaklycomputable real numbers and total computable real functions. In COMPUTINGAND COMBINATORICS (2001), Wang, J, Ed., vol. 2108 of Lecture Notes in Com-puter Science, Chinese Acad Sci; China Comp Federat, pp. 586–595. 7th AnnualInternational Computing and Combinatorics Conference, GUILIN, PEOPLES RCHINA, AUG 20-23, 2001.

[433] Rettinger, R., Zheng, X., Gengler, R., and von Braunmuhl, B. Mono-tonically computable real numbers. MATHEMATICAL LOGIC QUARTERLY 48,3 (2002), 459–479.

89

[434] Ricotta, C., and Anand, M. Spatial complexity of ecological communities:Bridging the gap between probabilistic and non-probabilistic uncertainty measures.ECOLOGICAL MODELLING 197, 1-2 (AUG 10 2006), 59–66.

[435] Rivals, E., and Delahaye, J. Optimal representation in average using Kol-mogorov complexity. THEORETICAL COMPUTER SCIENCE 200, 1-2 (JUN 281998), 261–287.

[436] Rodriguez Velasquez, J. O. A method for forecasting the seasonal dynamicof malaria in the municipalities of Colombia. REVISTA PANAMERICANA DESALUD PUBLICA-PAN AMERICAN JOURNAL OF PUBLIC HEALTH 27, 3(MAR 2010), 211–218.

[437] Rovan, B., and Zeman, M. Modeling time criticality of information. INFOR-MATION PROCESSING LETTERS 114, 3 (MAR 2014), 147–151.

[438] Ryabko, B. Applications of Kolmogorov complexity and universal codes to Non-parametric estimation of characteristics of time series. FUNDAMENTA INFOR-MATICAE 83, 1-2 (2008), 177–196.

[439] Salomaa, K., and Schofield, P. State complexity of additive weighted finiteautomata. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTERSCIENCE 18, 6 (DEC 2007), 1407–1416.

[440] SANTEAN, L. A HIERARCHY OF UNARY PRIMITIVE RECURSIVESTRING-FUNCTIONS. LECTURE NOTES IN COMPUTER SCIENCE 464(1990), 225–233.

[441] SCHAFER, G. A NOTE ON CONJECTURES OF CALUDE ABOUT THETOPOLOGICAL SIZE OF SETS OF PARTIAL RECURSIVE FUNCTIONS.ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DERMATHEMATIK 31, 3 (1985), 279–280.

[442] Schaller, M., and Svozil, K. Scale-invariant cellular automata and self-similarPetri nets. EUROPEAN PHYSICAL JOURNAL B 69, 2 (MAY 2009), 297–311.

[443] Schmidhuber, J. The Fastest Way of Computing All Universes. In COM-PUTABLE UNIVERSE: UNDERSTANDING AND EXPLORING NATURE ASCOMPUTATION, Zenil, H, Ed. 2013, pp. 381–398.

[444] SCHMIDT, M. ON THE POWER OF SEVERAL QUEUES. LECTURE NOTESIN COMPUTER SCIENCE 480 (1991), 64–75.

[445] Schwarz, S., and Staiger, L. Topologies Refining the Cantor Topology onX-omega. In THEORETICAL COMPUTER SCIENCE (2010), Calude, CS andSassone, V, Ed., vol. 323 of IFIP Advances in Information and CommunicationTechnology, IFIP Tech Comm 1; IFIP WG 2.2; SIGACT; EATCS, pp. 271–285.6th IFIP International Conference on Theoretical Computer Science, Brisbane,AUSTRALIA, SEP 20-23, 2010.

[446] Sempere, J. M., and Lopez, D. Characterizing membrane structures throughmultiset tree automata. In MEMBRANE COMPUTING (2007), Eleftherakis, Gand Kefalas, P and Paun, G and Rozenberg, G and Salomaa, A, Ed., vol. 4860 of

90

LECTURE NOTES IN COMPUTER SCIENCE, pp. 428–437. 8th InternationalWorkshop on Membrane Computing, Thessaloniki, GREECE, JUN 25-28, 2007.

[447] Shagrir, O. Supertasks do not increase computational power. NATURAL COM-PUTING 11, 1, SI (MAR 2012), 51–58.

[448] Shmulevich, I., and Povel, D. Measures of temporal pattern complexity.JOURNAL OF NEW MUSIC RESEARCH 29, 1 (2000), 61–69.

[449] Sicard, A., Ospina, J., and Velez, M. Quantum hypercomputation based onthe dynamical algebra su(1,1). JOURNAL OF PHYSICS A-MATHEMATICALAND GENERAL 39, 40 (OCT 6 2006), 12539–12558.

[450] Simpson, S. G., and Stephan, F. Cone avoidance and randomness preservation.ANNALS OF PURE AND APPLIED LOGIC 166, 6 (JUN 2015), 713–728.

[451] Sindelar, J., and Bocek, P. Kolmogorov complexity and probability measures.KYBERNETIKA 38, 6 (2002), 729–745.

[452] Sindelar, J., and Bocek, P. Kolmogorov complexity, pseudorandom generatorsand statistical models testing. KYBERNETIKA 38, 6 (2002), 747–759.

[453] Small, J. Why do quantum systems implement self-referential logic? A simplequestion with a catastrophic answer. In COMPUTING ANTICIPATORY SYS-TEMS (2006), Dubois, DM, Ed., vol. 839 of AIP Conference Proceedings, FNRS;Minist Communaute Francaise Belgique; Adm Gen Enseignement & Rech Sci; HECManagement Sch; Univ Liege; Euro View Serv SA; Hotel Ville Liege, pp. 167–183.7th International Conference on Computing Anticipatory Systems (CASYS 05),Liege, BELGIUM, AUG 08-13, 2005.

[454] Soler-Toscano, F., Zenil, H., Delahaye, J.-P., and Gauvrit, N. Calcu-lating Kolmogorov Complexity from the Output Frequency Distributions of SmallTuring Machines. PLOS ONE 9, 5 (MAY 8 2014).

[455] Solis, A., Angulo Martinez, A. M., Ramirez Alarcon, R.,Cruz Ramirez, H., U’Ren, A. B., and Hirsch, J. G. How random are randomnumbers generated using photons? PHYSICA SCRIPTA 90, 7, SI (JUL 2015).

[456] Solis, A., and Hirsch, J. G. Quantumness, Randomness and Computabil-ity. In INTERNATIONAL CONFERENCE ON QUANTUM CONTROL, EXACTOR PERTURBATIVE, LINEAR OR NONLINEAR TO CELEBRATE 50 YEARSOF THE SCIENTIFIC CAREER OF PROFESSOR BOGDAN MIELNIK (MIEL-NIK50) (2015), Breton, N and Fernandez, D and Kielanowski, P, Ed., vol. 624 ofJournal of Physics Conference Series, Cinvestav; Consejo Nacl Ciencia & Tecnolo-gia. International Conference on Quantum Control, Exact or Perturbative, Linearor Nonlinear, Mexico City, MEXICO, OCT 22-24, 2014.

[457] Sosik, P., and Matysek, J. Membrane computing: When communication isenough. In UNCONVENTIONAL MODELS IN COMPUTATION, PROCEED-INGS (2002), Calude, C and Dinneen, MJ and Peper, F, Ed., vol. 2509 of LEC-TURE NOTES IN COMPUTER SCIENCE, Ctr Discrete Math & Theoret CompSci; Adv Res Ctr Commun Res Lab, pp. 264–275. 3rd International Conference onUnconventional Models of Computation, KOBE, JAPAN, OCT 15-19, 2002.

91

[458] Speidel, U. An Extended Similarity Distance for Use with Computable Informa-tion Estimators. In 2014 INTERNATIONAL SYMPOSIUM ON INFORMATIONTHEORY AND ITS APPLICATIONS (ISITA) (2014), Res Soc Informat Theory& Applicat; Engn Sci Soc; IEEE Informat Theory Soc; Monash Univ; MelbourneConvent Bur; KDDI Fdn; Support Ctr Adv Telecommunicat Technol Res, pp. 304–308. International Symposium on Information Theory and its Applications (ISITA),Melbourne, AUSTRALIA, OCT 26-29, 2014.

[459] Sprenger, K. Some hierarchies of primitive recursive functions on term algebras.MATHEMATICAL LOGIC QUARTERLY 43, 2 (1997), 251–286.

[460] Stadler, B. M. R., and Stadler, P. F. Connectivity Spaces. MATHEMATICSIN COMPUTER SCIENCE 9, 4 (DEC 2015), 409–436.

[461] STAIGER, L. REPRESENTABLE MARTINLOF,P TESTS. KYBERNETIKA21, 3 (1985), 235–243.

[462] Staiger, L. A tight upper bound on Kolmogorov complexity and uniformly opti-mal prediction. THEORY OF COMPUTING SYSTEMS 31, 3 (MAY-JUN 1998),215–229.

[463] Staiger, L. The Kolmogorov complexity of real numbers. In FUNDAMENTALSOF COMPUTATION THEORY (1999), Ciobanu, G and Paun, G, Ed., vol. 1684of LECTURE NOTES IN COMPUTER SCIENCE, Assoc Comp Machinery; NatlAgcy Sci Technol & Innovat; Motorola, pp. 536–546. 12th International Symposiumon Fundamental of Computation Theory, IASI, ROMANIA, AUG 30-SEP 03, 1999.

[464] Staiger, L. How large is the set of disjunctive sequences? In COMBINA-TORICS, COMPUTABILITY AND LOGIC (2001), Calude, CS and Dinneen,MJ and Sburlan, S, Ed., DISCRETE MATHEMATICS AND THEORETICALCOMPUTER SCIENCE (SERIES), Fac Math & Comp Sci; Ovidius Univ; UnivAuckland, Ctr Discrete Math & Theoret Sci, pp. 215–225. 3rd International Con-ference on Discrete Mathematics and Theoretical Computer Science (DMTCS 01),CONSTANTA, ROMANIA, 2001.

[465] Staiger, L. How large is the set of disjunctive sequences. JOURNAL OF UNI-VERSAL COMPUTER SCIENCE 8, 2 (2002), 348–362.

[466] Staiger, L. The Kolmogorov complexity of infinite words. THEORETICALCOMPUTER SCIENCE 383, 2-3 (SEP 18 2007), 187–199. Meeting of theAmerican-Mathematical-Society, Santa Barbara, CA, APR, 2005.

[467] Stambuk, N. Universal metric properties of the genetic code. CROATICA CHEM-ICA ACTA 73, 4 (DEC 2000), 1123–1139. 14th Dubrovnik International Courseand Conference on the Interfaces between Mathematics, Chemistry and ComputerSciences, DUBROVNIK, CROATIA, JUN 21-26, 1999.

[468] Stamenkovic, A., and Ciric, M. Construction of fuzzy automata from fuzzyregular expressions. FUZZY SETS AND SYSTEMS 199 (JUL 16 2012), 1–27.

[469] Stamenkovic, A., Ciric, M., and Ignjatovic, J. Reduction of fuzzy automataby means of fuzzy quasi-orders. INFORMATION SCIENCES 275 (AUG 10 2014),168–198.

92

[470] Stanislav, J. M. A 43 YEARS HISTORY, PASSING FROM THE GUTEN-BERG PROJECT INITIATIVE TO THE OPEN EDUCATIONAL RESOURCESMOVEMENT. In LET’S BUILD THE FUTURE THROUGH LEARNING INNO-VATION!, VOL IV (2014), Roceanu, I, Ed., eLearning and Software for Education,pp. 433–440. 10th International Scientific Conference on eLearning and Softwarefor Education, Bucharest, ROMANIA, APR 24-25, 2014.

[471] Stannett, M. Specification, testing and verification of unconventional compu-tations using generalized X-machines. INTERNATIONAL JOURNAL OF GEN-ERAL SYSTEMS 43, 7, SI (2014), 713–721.

[472] Stephan, F., and Teutsch, J. AN INCOMPLETE SET OF SHORTEST DE-SCRIPTIONS. JOURNAL OF SYMBOLIC LOGIC 77, 1 (MAR 2012), 291–307.

[473] Stephan, F., and Teutsch, J. Things that can be made into themselves. IN-FORMATION AND COMPUTATION 237 (OCT 2014), 174–186.

[474] STREINU, I. GRAMMAR DIRECTED GODEL NUMBERINGS. INTERNA-TIONAL JOURNAL OF COMPUTER MATHEMATICS 14, 3-4 (1983), 223–237.

[475] Sutner, K. The Ehrenfeucht-Mycielski sequence. In IMPLEMENTATIONAND APPLICATION OF AUTOMATA, PROCEEDINGS (2003), Ibarra, OH andDang, Z, Ed., vol. 2759 of LECTURE NOTES IN COMPUTER SCIENCE, UnivCalif Santa Barbara, Comp Sci Dept; Univ Calif Santa Barbara, Coll Engn; UnivCalif Santa Barbara, Grad Div; AT&T Labs Res; Expertcity Inc, pp. 282–293.8th International Conference on Implementation and Application of Automata,UNIV CALIF SANTA BARBARA, SANTA BARBARA, CALIFORNIA, JUL 16-18, 2003.

[476] Suzuki, T., and Kumabe, M. Weak randomness, genericity and Boolean decisiontrees. In PROCEEDINGS OF THE 10TH ASIAN LOGIC CONFERENCE (2010),Arai, T and Brendle, J and Kikyo, H and Chong, CT and Downey, R and Feng,Q and Ono, H, Ed., Assoc Symbol Log; Japan Soc Promot Sci; Inoue Fdn Sci,pp. 322–344. 10th Asian Logic Conference, Kobe Univ, Kobe, JAPAN, SEP 01-06,2008.

[477] Suzuki, Y., Fujiwara, Y., Takabayashi, J., and Tanaka, H. Artificial lifeapplications of a class of P systems: Abstract rewriting systems on multisets. InMULTISET PROCESSING: MATHEMATICAL, COMPUTER SCIENCE, ANDMOLECULAR COMPUTING POINTS OF VIEW (2001), Calude, CS and Paun,G and Rozenberg, G and Salomaa, A, Ed., vol. 2235 of Lecture Notes in ComputerScience, Romanian Acad, Simion Stoilow Inst Math; Polytech Univ Madrid, Arti-ficial Intelligence Dept; Auckland Univ, Ctr Discrete Math & Theoret Comp Sci,pp. 299–346. Workshop on Multiset Processing, CURTEA DE ARGES, ROMA-NIA, AUG, 2000.

[478] SVOZIL, K. ARE CHAOTIC SYSTEMS DYNAMICALLY RANDOM.PHYSICS LETTERS A 140, 1-2 (SEP 4 1989), 5–9.

[479] SVOZIL, K. CONSTRUCTIVE CHAOS BY CELLULAR AUTOMATA ANDPOSSIBLE SOURCES OF AN ARROW OF TIME. PHYSICA D 45, 1-3 (SEP1990), 420–427. WORKSHOP ON CELLULAR AUTOMATA : THEORY AND

93

EXPERIMENT, LOS ALAMOS NATL LAB, LOS ALAMOS, NM, SEP 09-12,1989.

[480] SVOZIL, K. ON THE COMPUTATIONAL POWER OF PHYSICAL SYS-TEMS, UNDECIDABILITY, THE CONSISTENCY OF PHENOMENA, ANDTHE PRACTICAL USES OF PARADOXES. In FUNDAMENTAL PROBLEMSIN QUANTUM THEORY: A CONFERENCE HELD IN HONOR OF PROFES-SOR JOHN A. WHEELER (1995), Greenberger, DM and Zeilinger, A, Ed.,vol. 755 of Annals of the New York Academy of Sciences, New York Acad Sci,pp. 834–841. Conference on Fundamental Problems in Quantum Theory, A Con-ference held in Honor of Professor John A. Wheeler, BALTIMORE, MD, JUN18-22, 1994.

[481] Svozil, K. Set theory and physics. FOUNDATIONS OF PHYSICS 25, 11 (NOV1995), 1541–1560.

[482] Svozil, K. The church-turing thesis as a guiding principle for physics. In UNCON-VENTIONAL MODELS OF COMPUTATION (1998), Calude, CS and Casti, Jand Dinneen, MJ, Ed., SPRINGER SERIES IN DISCRETE MATHEMATICSAND THEORETICAL COMPUTER SCIENCE, Univ Auckland; Ctr DiscreteMath & Theoret Comp Sci; Santa Fe Inst, pp. 371–385. 1st International Confer-ence on Unconventional Models of Computation (UMC 98), UNIV AUCKLAND,AUCKLAND, NEW ZEALAND, JAN 05-09, 1998.

[483] Svozil, K. Logic of reversible automata. INTERNATIONAL JOURNAL OFTHEORETICAL PHYSICS 39, 3 (MAR 2000), 893–899. Quantum Structures 98Conference, LIPTOVSKY JAN, SLOVAKIA, AUG 30-SEP 05, 1998.

[484] Svozil, K. Quantum information: The new frontier. In UNCONVENTIONALMODELS OF COMPUTATION UMC’ 2K, PROCEEDINGS (2001), Antoniou,I and Calude, CS and Dinneen, MJ, Ed., DISCRETE MATHEMATICS ANDTHEORETICAL COMPUTER SCIENCE (SERIES), Univ Auckland, Ctr DiscreteMath & Theoret Comp Sci; Vrije Univ Brussels, Theoret Phys Div; Int SolvayInst Phys & Chem; Belgium Prime Minister’s Off; Fed Off Sci Techn & CulturalAffairs; Pukekohe Travel; Interuniv Poles Attract Program Contract P4/08 BelgianState, pp. 248–272. 2nd International Conference on Unconventional Models ofComputation (UMC’2K), SOLVAY INST, BRUSSELS, BELGIUM, DEC 13-16,2000.

[485] Svozil, K. Three criteria for quantum random-number generators based on beamsplitters. PHYSICAL REVIEW A 79, 5 (MAY 2009).

[486] Svozil, K. Quantum value indefiniteness. NATURAL COMPUTING 10, 4, SI(DEC 2011), 1371–1382.

[487] Svozil, K. How much contextuality? NATURAL COMPUTING 11, 2, SI (JUN2012), 261–265.

[488] Svozil, K. Non-contextual chocolate balls versus value indefinite quantum cryp-tography. THEORETICAL COMPUTER SCIENCE 560, 1 (DEC 4 2014), 82–90.

94

[489] Svozil, K. Physical Aspects of Oracles for Randomness and Hadamard’s Con-jecture. In COMPUTING WITH NEW RESOURCES: ESSAYS DEDICATEDTO JOZEF GRUSKA ON THE OCCASION OF HIS 80TH BIRTHDAY, Calude,CS and Freivalds, R and Kazuo, I, Ed., vol. 8808 of Lecture Notes in ComputerScience. 2014, pp. 223–230.

[490] Svozil, K. Unscrambling the Quantum Omelette. INTERNATIONAL JOURNALOF THEORETICAL PHYSICS 53, 10 (OCT 2014), 3648–3657.

[491] Svozil, K. Space and Time in a Quantized World. INTERNATIONAL JOURNALOF THEORETICAL PHYSICS 54, 12 (DEC 2015), 4376–4385.

[492] Svozil, K., Calude, C., and Stay, M. From Heisenberg to Godel via Chaitin.INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS 44, 7 (JUL 2005),1053–1065. International Conference on Quantum Structures 2002, Vienna, AUS-TRIA, JUL 01-07, 2002.

[493] Svozil, K., and Neufeld, N. ‘Linear’ chaos via paradoxical set decompositions.CHAOS SOLITONS & FRACTALS 7, 5 (MAY 1996), 785–793.

[494] Syropoulos, A. Theory of Fuzzy Computation. In THEORY OF FUZZY COM-PUTATION, vol. 31 of IFSR International Series on System Science and Engi-neering. 2014, pp. 1–162.

[495] Tadaki, K. A statistical mechanical interpretation of instantaneous codes. In2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORYPROCEEDINGS, VOLS 1-7 (2007), IEEE, pp. 1906–1910. IEEE InternationalSymposium on Information Theory, Nice, FRANCE, JUN 24-29, 2007.

[496] Tadaki, K. The Tsallis entropy and the Shannon entropy of a universal prob-ability. In 2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATIONTHEORY PROCEEDINGS, VOLS 1-6 (2008), IEEE; RIM; Ontario Cent Excel-lence; IBM Res; Microsoft Res, pp. 2111–2115. IEEE International Symposium onInformation Theory, Toronto, CANADA, JUL 06-11, 2008.

[497] Tadaki, K. A New Representation of Chaitin Omega Number Based on Com-pressible Strings. In UNCONVENTIONAL COMPUTATION, PROCEEDINGS(2010), Calude, CS and Hagiya, M and Morita, K and Rozenberg, G and Timmis,J, Ed., vol. 6079 of Lecture Notes in Computer Science, EATCS; Acad Europaea;Ctr Discrete Math & Theoret Comp Sci, pp. 127–139. 9th International Conferenceon Unconventional Computation, Univ Tokyo, Hongo Campus, Tokyo, JAPAN,JUN 21-25, 2010.

[498] Tadaki, K. The Hausdorff dimension of the halting self-similar sets of T-universalprefix-free machines. In 2010 IEEE INTERNATIONAL SYMPOSIUM ON IN-FORMATION THEORY (2010), IEEE International Symposium on InformationTheory, IEEE, pp. 1287–1291. 2010 IEEE International Symposium on InformationTheory, Austin, TX, JUL 13-13, 2010.

[499] Tadaki, K. A Chaitin Omega number based on compressible strings. NATURALCOMPUTING 11, 1, SI (MAR 2012), 117–128.

95

[500] Tadaki, K. A statistical mechanical interpretation of algorithmic informationtheory III: composite systems and fixed points. MATHEMATICAL STRUCTURESIN COMPUTER SCIENCE 22, 5, SI (OCT 2012), 752–770.

[501] Tadaki, K. Fixed point theorems on partial randomness. ANNALS OF PUREAND APPLIED LOGIC 163, 7, SI (JUL 2012), 763–774.

[502] Takenaka, Y., and Hashimoto, A. Shortening the computational time ofthe fluorescent DNA computing. In DNA COMPUTING (2003), Hagiya, M andOhuchi, A, Ed., vol. 2568 of LECTURE NOTES IN COMPUTER SCIENCE,Japan Sci & Technol Corp, pp. 85–94. 8th International Workshop on DNA-BasedComputers, HOKKAIDO UNIV, SAPPORO, JAPAN, JUN 10-13, 2002.

[503] TANGUIANE, A. MUSIC RECOGNITION BASED ON ARTIFICIAL PER-CEPTION APPROACH. INTERFACE-JOURNAL OF NEW MUSIC RE-SEARCH 22, 2 (MAY 1993), 133–149. 1ST GENERAL ASSEMBLY OF THEEUROPEAN SOC FOR THE COGNITIVE SCIENCES OF MUSIC, TRIESTE,ITALY, OCT 27-29, 1991.

[504] TANGUIANE, A. A PRINCIPLE OF CORRELATIVITY OF PERCEPTIONAND ITS APPLICATION TO MUSIC RECOGNITION. MUSIC PERCEPTION11, 4 (SUM 1994), 465–502.

[505] TANGUIANE, A. TOWARDS AXIOMATIZATION OF MUSIC PERCEPTION.JOURNAL OF NEW MUSIC RESEARCH 24, 3 (SEP 1995), 247–281.

[506] Tarau, P. Hereditarily Finite Representations of Natural Numbers and Self-Delimiting Codes. In MSFP 2010: PROCEEDINGS OF THE 2010 ACM SIG-PLAN WORKSHOP ON MATHEMATICALLY STRUCTURED FUNCTIONALPROGRAMMING (2010), ACM SIGPLAN, pp. 11–17. 3rd Workshop on Mathe-matically Structured Functional Programming, Baltimore, MD, SEP 25, 2010.

[507] Tarau, P. On Arithmetic Computations with Hereditarily Finite Sets, Functionsand Types. In THEORETICAL ASPECTS OF COMPUTING (2010), Cavalcanti,A and Deharbe, D and Gaudel, MC and Woodcock, J, Ed., vol. 6255 of LectureNotes in Computer Science, Univ Fed Rio Grande Norte; Univ York, pp. 367–381.7th International Colloquium Theoretical Aspects of Computing, Natal, BRAZIL,SEP 01-03, 2010.

[508] Toffoli, T., Capobianco, S., and Mentrasti, P. When - and how - can acellular automaton be rewritten as a lattice gas? THEORETICAL COMPUTERSCIENCE 403, 1 (AUG 20 2008), 71–88.

[509] Tomescu, I. On words containing all short subwords. THEORETICAL COM-PUTER SCIENCE 197, 1-2 (MAY 15 1998), 235–240.

[510] Tomescu, I. On the number of words containing the factor (aba)(k). DISCRETEAPPLIED MATHEMATICS 155, 11 (JUN 1 2007), 1506–1511.

[511] Trautteur, G. Analog computation and the continuum-discrete conundrum.In GROUNDING EFFECTIVE PROCESSES IN EMPIRICAL LAWS: REFLEC-TIONS ON THE NOTION OF ALGORITHM (1999), Lupacchini, R and Tam-burrini, G, Ed., Comune Cesena; F Enriques Ctr; ELSAG, pp. 23–42. Workshop

96

on Symbols, Physical Processes, Biological Processes-Recent Explorations of theNotion of Algorithm, CESENA, ITALY, FEB 16, 1999.

[512] Turiel, T. P. Quantum random bit generators. AMERICAN STATISTICIAN61, 3 (AUG 2007), 255–259.

[513] Um, M., Zhang, X., Zhang, J., Wang, Y., Yangchao, S., Deng, D. L.,Duan, L.-M., and Kim, K. Experimental Certification of Random Numbers viaQuantum Contextuality. SCIENTIFIC REPORTS 3 (APR 9 2013).

[514] Uspensky, V., and Shen, A. Relations between varieties of Kolmogorov com-plexities. MATHEMATICAL SYSTEMS THEORY 29, 3 (MAY-JUN 1996), 271–292.

[515] Vasilieva, A., and Mischenko-Slatenkova, T. Quantum Query Algorithmsfor Conjunctions. In UNCONVENTIONAL COMPUTATION, PROCEEDINGS(2010), Calude, CS and Hagiya, M and Morita, K and Rozenberg, G and Timmis, J,Ed., vol. 6079 of Lecture Notes in Computer Science, EATCS; Acad Europaea; CtrDiscrete Math & Theoret Comp Sci, pp. 140–151. 9th International Conference onUnconventional Computation, Univ Tokyo, Hongo Campus, Tokyo, JAPAN, JUN21-25, 2010.

[516] Vassiliadis, V., and Dounias, G. NATURE-INSPIRED INTELLIGENCE:A REVIEW OF SELECTED METHODS AND APPLICATIONS. INTERNA-TIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS 18, 4 (AUG2009), 487–516.

[517] Vazirani, U., and Vidick, T. Certifiable quantum dice. PHILOSOPHICALTRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSI-CAL AND ENGINEERING SCIENCES 370, 1971, SI (JUL 28 2012), 3432–3448.

[518] Wang, J., Yin, M., and Gu, W. Fuzzy multiset finite automata and theirlanguages. SOFT COMPUTING 17, 3 (MAR 2013), 381–390.

[519] Weerakoon, W. A. C., Karunananda, A. S., and Dias, N. G. J. A Tac-tics Memory for a New Theory of Computing. In PROCEEDINGS OF THE 20138TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDU-CATION (ICCSE 2013) (2013), Inst Elect & Elect Engineers; Natl Res CouncilComp Educ Coll & Univ; Inst Elect & Elect Engineers Sri Lanka Sect, pp. 153–158. 8th International Conference on Computer Science and Education (ICCSE),Sri Lanka Inst Informat Technol, Colombo, SRI LANKA, APR 26-28, 2013.

[520] WIEDERHOLD, G. DIGITAL LIBRARIES, VALUE, AND PRODUCTIVITY.COMMUNICATIONS OF THE ACM 38, 4 (APR 1995), 85–96.

[521] Wiedermann, J., and van Leeuwen, J. Relativistic computers and non-uniform complexity theory. In UNCONVENTIONAL MODELS IN COMPUTA-TION, PROCEEDINGS (2002), Calude, C and Dinneen, MJ and Peper, F, Ed.,vol. 2509 of Lecture Notes in Computer Science, Ctr Discrete Math & TheoretComp Sci; Adv Res Ctr Commun Res Lab, pp. 287–299. 3rd International Con-ference on Unconventional Models of Computation, KOBE, JAPAN, OCT 15-19,2002.

97

[522] Wiedermann, J., and van Leeuwen, J. What is Computation: An EpistemicApproach. In SOFSEM 2015: THEORY AND PRACTICE OF COMPUTER SCI-ENCE (2015), Italiano, GF and MargariaSteffen, T and Pokorny, J and Quisquater,JJ and Wattenhofer, R, Ed., vol. 8939 of Lecture Notes in Computer Science, CzechSoc Cybernet & Informat, pp. 1–13. 41st International Conference on CurrentTrends in Theory and Practice of Computer Science ((SOFSEM), Pecpod Snezkou,CZECH REPUBLIC, JAN 24-29, 2015.

[523] Wolf, M. J. Computation as Information Processing. In PHYSICAL COMPU-TATION AND COGNITIVE SCIENCE, vol. 12 of Studies in Applied PhilosophyEpistemology and Rational Ethics. 2014, pp. 133–166.

[524] Wu, C.-R., Chang, C.-W., and Chen, C.-C. Applying Expert Diagnosis Modelto Collaborative Design Systems. ADVANCED SCIENCE LETTERS 4, 4-5 (APR-MAY 2011), 1860–1861.

[525] Wu, G. Prefix-free languages and initial segments of computably enumerable de-grees. In COMPUTING AND COMBINATORICS (2001), Wang, J, Ed., vol. 2108of LECTURE NOTES IN COMPUTER SCIENCE, Chinese Acad Sci; China CompFederat, pp. 576–585. 7th Annual International Conference on Computing andCombinatorics, GUILIN, PEOPLES R CHINA, AUG 20-23, 2001.

[526] Xylogiannopoulos, K. F., Karampelas, P., and Alhajj, R. Experimen-tal Analysis on the Normality of pi, e, phi, root 2 Using Advanced Data-MiningTechniques. EXPERIMENTAL MATHEMATICS 23, 2 (2014), 105–128.

[527] Yamamoto, L. Code regulation in open ended evolution. In Genetic Program-ming, Proceedings (2007), ONeill, M and Ekart, A and Vanneschi, L and Es-parciaAlcazar, AI, Ed., vol. 4445 of LECTURE NOTES IN COMPUTER SCI-ENCE, pp. 271–280. 10th European Conference on Genetic Programming, Valen-cia, SPAIN, APR 11-13, 2007.

[528] YANG, E., and SHEN, S. CHAITIN COMPLEXITY, SHANNON-INFORMATION CONTENT OF A SINGLE EVENT AND INFINITE RANDOMSEQUENCES .1. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICSASTRONOMY & TECHNOLOGICAL SCIENCES 34, 10 (OCT 1991), 1183–1193.

[529] YANG, E., and SHEN, S. CHAITIN COMPLEXITY, SHANNON-INFORMATION CONTENT OF A SINGLE EVENT, AND INFINITE RANDOMSEQUENCES .2. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICSASTRONOMY 34, 11 (NOV 1991), 1307–1319.

[530] Yanofsky, N. Outer Limits of Reason: What Science, Mathematics, and LogicCannot Tell Us. In OUTER LIMITS OF REASON: WHAT SCIENCE, MATHE-MATICS, AND LOGIC CANNOT TELL US. 2013, pp. 1–403.

[531] Yun, A., Jeong, D., and Kim, J. AN EFFICIENT AND ACCURATE NU-MERICAL SCHEME FOR TURING INSTABILITY ON A PREDATOR-PREYMODEL. INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS 22,6 (JUN 2012).

[532] Zajicek, L. On sigma-porous sets in abstract spaces. ABSTRACT AND AP-PLIED ANALYSIS, 5 (2005), 509–534.

98

[533] Zavalov, O., Bocharova, V., Halamek, J., Halamkova, L., Korkmaz, S.,Arugula, M. A., Chinnapareddy, S., Katz, E., and Privman, V. Two-Input Enzymatic Logic Gates Made Sigmoid by Modifications of the BiocatalyticReaction Cascades. INTERNATIONAL JOURNAL OF UNCONVENTIONALCOMPUTING 8, 5-6, SI (2012), 347–365.

[534] Zavalov, O., Bocharova, V., Privman, V., and Katz, E. Enzyme-BasedLogic: OR Gate with Double-Sigmoid Filter Response. JOURNAL OF PHYSICALCHEMISTRY B 116, 32 (AUG 16 2012), 9683–9689.

[535] Zenil, H. Introducing the Computable Universe. In COMPUTABLE UNIVERSE:UNDERSTANDING AND EXPLORING NATURE AS COMPUTATION, Zenil,H, Ed. 2013, pp. 1–20.

[536] Zenil, H. Turing patterns with Turing machines: emergence and low-level struc-ture formation. NATURAL COMPUTING 12, 2, SI (JUN 2013), 291–303.

[537] Zenil, H., Delahaye, J.-P., and Gaucherel, C. Image characterization andclassification by physical complexity. COMPLEXITY 17, 3 (JAN-FEB 2012), 26–42.

[538] Zenil, H., Gershenson, C., Marshall, J. A. R., and Rosenblueth, D. A.Life as Thermodynamic Evidence of Algorithmic Structure in Natural Environ-ments. ENTROPY 14, 11 (NOV 2012), 2173–2191.

[539] Zenil, H., Kiani, N. A., and Tegner, J. Algorithmic complexity of motifs clus-ters superfamilies of networks. In 2013 IEEE INTERNATIONAL CONFERENCEON BIOINFORMATICS AND BIOMEDICINE (BIBM) (2013), Li, GZ and Kim,S and Hughes, M and McLachlan, G and Sun, H and Hu, X and Ressom, H andLiu, B and Liebman, M, Ed., IEEE International Conference on Bioinformaticsand Biomedicine-BIBM, IEEE; IEEE Comp Soc; Tongji Univ; IEEE Comp SocTech Comm Life Sci; China Acad Chinese Med Sci; Shanghai Assoc Syst Simulat.IEEE International Conference on Bioinformatics and Biomedicine (IEEE BIBM),Shanghai, PEOPLES R CHINA, DEC 18-21, 2013.

[540] Zenil, H., Soler-Toscano, F., Dingle, K., and Louis, A. A. Correlation ofautomorphism group size and topological properties with program-size complexityevaluations of graphs and complex networks. PHYSICA A-STATISTICAL ME-CHANICS AND ITS APPLICATIONS 404 (JUN 15 2014), 341–358.

[541] Zenil, H., Soler-Toscano, F., and Joosten, J. J. Empirical Encounters withComputational Irreducibility and Unpredictability. MINDS AND MACHINES 22,3 (AUG 2012), 149–165.

[542] Zenil, H., and Villarreal-Zapata, E. ASYMPTOTIC BEHAVIOR ANDRATIOS OF COMPLEXITY IN CELLULAR AUTOMATA. INTERNATIONALJOURNAL OF BIFURCATION AND CHAOS 23, 9 (SEP 2013).

[543] Zhang, B.-T. Hypernetworks: A molecular evolutionary architecture for cognitivelearning and memory. IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE3, 3 (AUG 2008), 49–63.

99

[544] Zhang, F., Liu, B., Liu, W., and Zhang, Q. DNA computing model based onlab-on-a-chip and its application on solving the timetabling problem. PROGRESSIN NATURAL SCIENCE-MATERIALS INTERNATIONAL 18, 5 (MAY 10 2008),633–637.

[545] Zheng, X. Closure properties of real number classes under limits and computableoperators. In COMPUTING AND COMBINATORICS, PROCEEDINGS (2000),Du, DZ and Eades, P and EstivillCastro, V and Lin, X and Sharma, A, Ed.,vol. 1858 of Lecture Notes in Computer Science, Univ New S Wales; Univ New-castle; Univ Sydney; Comp Sci Assoc Australasia, pp. 170–179. 6th Annual Inter-national Computing and Combinatorics Conference (COCOON 2000), SYDNEY,AUSTRALIA, JUL 26-28, 2000.

[546] Zheng, X. Recursive approximability of real numbers. MATHEMATICAL LOGICQUARTERLY 48, 1 (2002), 131–156. Dagstuhl Seminar on Computability andComplexity in Analysis, SCHLOSS DAGSTUHL, GERMANY, NOV 11-16, 2001.

[547] Zheng, X. On the hierarchies of Delta(0)(2)-real numbers. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS 41, 1 (JAN-MAR2007), 3–25. 6th Conference on Real Numbers and Computers, Dagstuhl, GER-MANY, NOV, 2004.

[548] Zheng, X., Lu, D., and Bao, K. Divergence bounded computable real numbers.THEORETICAL COMPUTER SCIENCE 351, 1 (FEB 14 2006), 27–38.

[549] Zhu, J., Zhang, L., Dong, S., and Wang, E. Four-Way Junction-Driven DNAStrand Displacement and Its Application in Building Majority Logic Circuit. ACSNANO 7, 11 (NOV 2013), 10211–10217.

[550] Ziegler, M. Physically-relativized Church-Turing Hypotheses: Physical foun-dations of computing and complexity theory of computational physics. APPLIEDMATHEMATICS AND COMPUTATION 215, 4 (OCT 15 2009), 1431–1447. Inter-national Workshop on Physics and Computation, Vienna, AUSTRIA, AUG 25-28,2008.

[551] ZIMAND, M. ON THE TOPOLOGICAL SIZE OF SETS OF RANDOMSTRINGS. ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUND-LAGEN DER MATHEMATIK 32, 1 (1986), 81–88.

[552] ZIMAND, M. ON RELATIVIZATIONS WITH RESTRICTED NUMBER OFACCESSES TO THE ORACLE SET. MATHEMATICAL SYSTEMS THEORY20, 1 (1987), 1–11.

[553] ZIMAND, M. IF NOT EMPTY, NP-P IS TOPOLOGICALLY LARGE. THEO-RETICAL COMPUTER SCIENCE 119, 2 (OCT 25 1993), 293–310.

[554] ZIMAND, M. ON THE TOPOLOGICAL SIZE OF P-M-COMPLETE DE-GREES. THEORETICAL COMPUTER SCIENCE 147, 1-2 (AUG 7 1995), 137–147.

[555] Zimand, M. A high-low Kolmogorov complexity law equivalent to the 0-1 Law.INFORMATION PROCESSING LETTERS 57, 2 (JAN 29 1996), 59–64.

100

[556] Zimand, M. Two sources are better than one for increasing the Kolmogorovcomplexity of infinite sequences. In COMPUTER SCIENCE - THEORY ANDAPPLICATIONS (2008), Hirsch, EA and Razborov, AA and Semenov, A andSlissenko, A, Ed., vol. 5010 of LECTURE NOTES IN COMPUTER SCIENCE,Russian Acad Sci, Inst Syst Programming; Moscow State Univ; Moscow Inst OPenEduc; Inst New Technol, pp. 326–338. 3rd International Computer Science Sym-posium, Russian Acad Sci, Dorodinicyn Comp Ctr, Moscow, RUSSIA, JUN 07-12,2008.

[557] Zimand, M. Counting Dependent and Independent Strings. In MATHEMATI-CAL FOUNDATIONS OF COMPUTER SCIENCE 2010 (2010), Hlineny, P andKucera, A, Ed., vol. 6281 of Lecture Notes in Computer Science, European ResConsortium Informat & Math, pp. 689–700. 35th International Symposium onMathematical Foundations of Computer Science, Brno, CZECH REPUBLIC, AUG23-27, 2010.

[558] Zimand, M. Impossibility of Independence Amplification in Kolmogorov Com-plexity Theory. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCI-ENCE 2010 (2010), Hlineny, P and Kucera, A, Ed., vol. 6281 of Lecture Notesin Computer Science, European Res Consortium Informat & Math, pp. 701–712.35th International Symposium on Mathematical Foundations of Computer Science,Brno, CZECH REPUBLIC, AUG 23-27, 2010.

[559] Zimand, M. Generating Kolmogorov random strings from sources with limitedindependence. JOURNAL OF LOGIC AND COMPUTATION 23, 4, SI (AUG2013), 909–924.

[560] Zimand, M. Counting Dependent and Independent Strings. FUNDAMENTAINFORMATICAE 131, 3-4 (2014), 485–497.

Recent

References

[1] Philosophy and The Hitchhiker’s Guide to the Galaxy Preface. In PHILOSO-PHY AND THE HITCHHIKER’S GUIDE TO THE GALAXY, Joll, N, Ed. 2012,pp. XI+.

[2] Abbott, A., Calude, C., and Svozil, K. Alastair Abbott, Cristian Calude andKarl Svozil describe - A QUANTUM RANDOM ORACLE. In ALAN TURING:HIS WORK AND IMPACT, Cooper, SB and VanLeeuwen, J, Ed. 2013, pp. 206–210.

[3] Abbott, A. A. De-quantisation of the quantum Fourier transform. APPLIEDMATHEMATICS AND COMPUTATION 219, 1 (SEP 15 2012), 3–13. 3rd In-ternational Workshop on Physics and Computation, EGYPT, AUG 30-SEP 06,2010.

[4] Abbott, A. A. The Deutsch-Jozsa problem: de-quantisation and entanglement.NATURAL COMPUTING 11, 1, SI (MAR 2012), 3–11.

101

[5] Abbott, A. A., Bechmann, M., Calude, C. S., and Sebald, A. A Nu-clear Magnetic Resonance Implementation of a Classical Deutsch-Jozsa Algorithm.INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING 8, 2(2012), 161–175.

[6] Abbott, A. A., Calude, C. S., Conder, J., and Svozil, K. Strong Kochen-Specker theorem and incomputability of quantum randomness. PHYSICAL RE-VIEW A 86, 6 (DEC 17 2012).

[7] Abbott, A. A., Calude, C. S., and Svozil, K. A quantum random numbergenerator certified by value indefiniteness. MATHEMATICAL STRUCTURES INCOMPUTER SCIENCE 24, 3, SI (JUN 2014).

[8] Abbott, A. A., Calude, C. S., and Svozil, K. Value-indefinite observablesare almost everywhere. PHYSICAL REVIEW A 89, 3 (MAR 10 2014).

[9] Abbott, A. A., Calude, C. S., and Svozil, K. A variant of the Kochen-Specker theorem localising value indefiniteness. JOURNAL OF MATHEMATICALPHYSICS 56, 10 (OCT 2015).

[10] Abbott, A. A., Calude, C. S., and Svozil, K. On the Unpredictabilityof Individual Quantum Measurement Outcomes. In FIELDS OF LOGIC ANDCOMPUTATION II: ESSAYS DEDICATED TO YURI GUREVICH ON THEOCCASION OF HIS 75TH BIRTHDAY (2015), Beklemishev, LD and Blass, Aand Dershowitz, N and Finkbeiner, B and Schulte, W, Ed., vol. 9300 of LectureNotes in Computer Science, pp. 69–86. Symposium on Logic in Computer ScienceCelebrating Yuri Gurevich’s 75th Birthday (YuriFest), Tech Univ Berlin, Berlin,GERMANY, SEP 11-12, 2015.

[11] Adamatzky, A. Encapsulating reaction-diffusion computers. In MACHINES,COMPUTATIONS, AND UNIVERSALITY, PROCEEDINGS (2007), Durand-Lose, J and Margenstern, M, Ed., vol. 4664 of Lecture Notes in Computer Science,Lab Informat Fond Orleans; Univ Orleans; Univ Meta, LITA; Conseil Reg, RegCtr; Conseil Gen Loiret; Mairie Orleans; GDR 673 CNRS Informat Math, pp. 1–11. 5th International Conference on Machines, Computations, and Universality,Orleans, FRANCE, SEP 10-13, 2007.

[12] Adamatzky, A. Hot ice computer. PHYSICS LETTERS A 374, 2 (DEC 282009), 264–271.

[13] Adamatzky, A. Advances in Physarum Machines Gates, Hulls, Mazes and Rout-ing with Slime Mould. In APPLICATIONS, TOOLS AND TECHNIQUES ONTHE ROAD TO EXASCALE COMPUTING (2012), DeBosschere, K and DHol-lander, EH and Joubert, GR and Padua, D and Peters, F, Ed., vol. 22 of Advancesin Parallel Computing, pp. 41–54. 14th Biennial ParCo Conference (ParCo), Ghent,BELGIUM, AUG 31-SEP 03, 2011.

[14] Adamatzky, A. Towards plant wires. BIOSYSTEMS 122 (AUG 2014), 1–6.

[15] Adamatzky, A., and Martinez, G. J. Bio-Imitation of Mexican MigrationRoutes to the USA with Slime Mould on 3D Terrains. JOURNAL OF BIONICENGINEERING 10, 2 (APR 2013), 242–250.

102

[16] Adamatzky, A. I. Route 20, Autobahn 7, and Slime Mold: Approximating theLongest Roads in USA and Germany With Slime Mold on 3-D Terrains. IEEETRANSACTIONS ON CYBERNETICS 44, 1 (JAN 2014), 126–136.

[17] Akl, S. G. Even accelerating machines are not universal. INTERNATIONALJOURNAL OF UNCONVENTIONAL COMPUTING 3, 2 (2007), 105–121.

[18] Akl, S. G. Evolving Computational Systems. In HANDBOOK OF PARALLELCOMPUTING: MODELS, ALGORITHMS AND APPLICATIONS, Rajasekaran,S and Reif, J, Ed., Chapman & Hall-CRC Computer and Information ScienceSeries. 2008.

[19] Alexandru, A., and Ciobanu, G. Algebraic Properties of Generalized Mul-tisets. In 2013 15TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC ANDNUMERIC ALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2013)(2014), Bjorner, N and Negru, V and Ida, T and Jebelean, T and Petcu, D andWatt, S and Zaharie, D, Ed., IEEE; IEEE Comp Soc, pp. 367–374. 15th Interna-tional Symposium on Symbolic and Numeric Algorithms for Scientific Computing(SYNASC), Timisoara, ROMANIA, SEP 23-26, 2013.

[20] Alford, G. Explicitly constructing universal extended H systems. In UNCON-VENTIONAL MODELS OF COMPUTATION (1998), Calude, CS and Casti, Jand Dinneen, MJ, Ed., SPRINGER SERIES IN DISCRETE MATHEMATICSAND THEORETICAL COMPUTER SCIENCE, Univ Auckland; Ctr DiscreteMath & Theoret Comp Sci; Santa Fe Inst, pp. 108–117. 1st International Confer-ence on Unconventional Models of Computation (UMC 98), UNIV AUCKLAND,AUCKLAND, NEW ZEALAND, JAN 05-09, 1998.

[21] Alhazov, A., Freund, R., and Morita, K. Reversibility and Determinism inSequential Multiset Rewriting. In UNCONVENTIONAL COMPUTATION, PRO-CEEDINGS (2010), Calude, CS and Hagiya, M and Morita, K and Rozenberg, Gand Timmis, J, Ed., vol. 6079 of Lecture Notes in Computer Science, EATCS; AcadEuropaea; Ctr Discrete Math & Theoret Comp Sci, pp. 21–31. 9th InternationalConference on Unconventional Computation, Univ Tokyo, Hongo Campus, Tokyo,JAPAN, JUN 21-25, 2010.

[22] Alhazov, A., Freund, R., and Morita, K. Sequential and maximally parallelmultiset rewriting: reversibility and determinism. NATURAL COMPUTING 11,1, SI (MAR 2012), 95–106.

[23] Alhazov, A., and Morita, K. On Reversibility and Determinism in P Systems.In MEMBRANE COMPUTING (2010), Paun, G and Perez Jimenez, MJ andRiscos Nunez, A and Rozenberg, G and Salomaa, A, Ed., vol. 5957 of Lecture Notesin Computer Science, Int Assoc Pattern Recognit; Informat Technol Ind Dev Agcy;Microsoft Innovat Lab Cairo; Nile Univ; Univ Surrey; Univ Cagliari, pp. 158–168.10th International Workshop on Membrane Computing9th International Workshopon Multiple Classifier Systems, Natl Coll Valaicu Voda Curtea de Arges, Curteade Arges, ROMANIACairo, EGYPT, AUG 24-27, 2009APR 07-09, 2010.

[24] Aman, B., and Ciobanu, G. Verification of membrane systems with delays viaPetri nets with delays. THEORETICAL COMPUTER SCIENCE 598 (SEP 202015), 87–101.

103

[25] Aman, B., Csuhaj-Varju, E., and Freund, R. Red-Green P Automata. InMEMBRANE COMPUTING (CMC 2014) (2014), Gheorghe, M and Rozenberg,G and Salomaa, A and Sosik, P and Zandron, C, Ed., vol. 8961 of Lecture Notes inComputer Science, Silesian Univ, Fac Philosophy & Sci, Inst Comp Sci, pp. 139–157. 15th International Conference on Membrane Computing (CMC), Prague,CZECH REPUBLIC, AUG 20-22, 2014.

[26] Ambos-Spies, K., Weihrauch, K., and Zheng, X. Weakly computable realnumbers. JOURNAL OF COMPLEXITY 16, 4 (DEC 2000), 676–690.

[27] An, L., Tong, L., and Fan, W. Mining decision rules based on in-sim-dominancerelations. In PROGRESS IN INTELLIGENCE COMPUTATION AND APPLI-CATIONS, PROCEEDINGS (2007), Zeng, S and Liu, Y and Zhang, Q and Kang,L, Ed., pp. 448–452. 2nd International Symposium on Intelligence Computationand Application (ISICA 2007), Wuhan, PEOPLES R CHINA, SEP 21-23, 2007.

[28] Andreka, H., Madarasz, J. X., Nemeti, I., Stannett, M., and Szekely,G. Faster than light motion does not imply time travel. CLASSICAL AND QUAN-TUM GRAVITY 31, 9 (MAY 7 2014).

[29] Androutsopoulos, K., Clark, D., Harman, M., Hierons, R. M., Li, Z.,and Tratt, L. Amorphous Slicing of Extended Finite State Machines. IEEETRANSACTIONS ON SOFTWARE ENGINEERING 39, 7 (JUL 2013), 892–909.

[30] Apolloni, B., and Gentile, C. Sample size lower bounds in PAC learning byAlgorithmic Complexity Theory. THEORETICAL COMPUTER SCIENCE 209,1-2 (DEC 6 1998), 141–162.

[31] Archibald, M., Brattka, V., and Heuberger, C. Randomness with respectto the signed-digit representation. FUNDAMENTA INFORMATICAE 83, 1-2(2008), 1–19.

[32] Arrighi, P., and Dowek, G. THE PHYSICAL CHURCH-TURING THESISAND THE PRINCIPLES OF QUANTUM THEORY. INTERNATIONAL JOUR-NAL OF FOUNDATIONS OF COMPUTER SCIENCE 23, 5, SI (AUG 2012),1131–1145.

[33] Artacho, F. J. A., Bailey, D. H., Borwein, J. M., and Borwein, P. B.Walking on Real Numbers. MATHEMATICAL INTELLIGENCER 35, 1 (MAR2013), 42–60.

[34] Arugula, M. A., Shroff, N., Katz, E., and He, Z. Molecular AND logicgate based on bacterial anaerobic respiration. CHEMICAL COMMUNICATIONS48, 82 (2012), 10174–10176.

[35] Arulanandham, J. Implementing bead-sort with P systems. In UNCONVEN-TIONAL MODELS IN COMPUTATION, PROCEEDINGS (2002), Calude, C andDinneen, MJ and Peper, F, Ed., vol. 2509 of LECTURE NOTES IN COMPUTERSCIENCE, Ctr Discrete Math & Theoret Comp Sci; Adv Res Ctr Commun ResLab, pp. 115–125. 3rd International Conference on Unconventional Models of Com-putation, KOBE, JAPAN, OCT 15-19, 2002.

104

[36] Aur, D., Jog, M., and Poznanski, R. R. Computing by physical interactionin neurons. JOURNAL OF INTEGRATIVE NEUROSCIENCE 10, 4 (DEC 2011),413–422.

[37] Aur, D., and Jog, M. S. Models of Brain Computation. In NEUROELECTRO-DYNAMICS: UNDERSTANDING THE BRAIN LANGUAGE, vol. 74 of Biomed-ical and Health Research. 2010, pp. 95–166.

[38] Baez, J., and Stay, M. Algorithmic thermodynamics. MATHEMATICALSTRUCTURES IN COMPUTER SCIENCE 22, 5, SI (OCT 2012), 771–787.

[39] Bailey, D. H., Barrio, R., and Borwein, J. M. High-precision computation:Mathematical physics and dynamics. APPLIED MATHEMATICS AND COMPU-TATION 218, 20 (JUN 15 2012), 10106–10121.

[40] Bailey, D. H., and Borwein, J. Pi Day Is Upon Us Again and We Still Do NotKnow if Pi Is Normal. AMERICAN MATHEMATICAL MONTHLY 121, 3 (MAR2014), 191–206.

[41] Bailey, D. H., and Borwein, J. M. Nonnormality of Stoneham constants.RAMANUJAN JOURNAL 29, 1-3 (DEC 2012), 409–422.

[42] Bailey, D. H., Borwein, J. M., Calude, C. S., Dinneen, M. J., Du-mitrescu, M., and Yee, A. An Empirical Approach to the Normality of pi.EXPERIMENTAL MATHEMATICS 21, 4 (2012), 375–384.

[43] Bailly, F., and Longo, G. Phenomenology of incompleteness: From formaldeductions to mathematics and physics. In DEDUCTION, COMPUTATION, EX-PERIMENT: EXPLORING THE EFFECTIVENESS OF PROOF (2008), Lupac-chini, R and Corsi, G, Ed., Univ Bologna, pp. 243–271. Workshop on Deduction,Computation, Experiment - Exploring the Effectiveness of Proof‘, Bologna, ITALY,APR 03-04, 2007.

[44] Bakshi, S., Zavalov, O., Halamek, J., Privman, V., and Katz, E. Mod-ularity of Biochemical Filtering for Inducing Sigmoid Response in Both Inputs inan Enzymatic AND Gate. JOURNAL OF PHYSICAL CHEMISTRY B 117, 34(AUG 29 2013), 9857–9865.

[45] Balanescu, T., Gheorghe, M., Holcombe, M., and Ipate, F. EilenbergP systems. In MEMBRANE COMPUTING (2003), Paun, G and Rozenberg, Gand Salomaa, A and Zandron, C, Ed., vol. 2597 of LECTURE NOTES IN COM-PUTER SCIENCE, pp. 43–57. International Workshop on Membrane Computing,CURTEA DE ARGES, ROMANIA, AUG 19-23, 2002.

[46] Banatre, J. P., Fradet, P., and Radenac, Y. Generalised multisets forchemical programming. MATHEMATICAL STRUCTURES IN COMPUTER SCI-ENCE 16, 4 (AUG 2006), 557–580. 1st International Workshop on Developmentsin Computational Models (DCM), Lisbon, PORTUGAL, JUL 10, 2005.

[47] Barbagallo, S., Consoli, S., Pappalardo, N., Greco, S., and Zimbone,S. Discovering reservoir operating rules by a Rough Set approach. WATER RE-SOURCES MANAGEMENT 20, 1 (FEB 2006), 19–36.

105

[48] Barbuti, R., Maggiolo-Schettini, A., Milazzo, P., and Tini, S. Mem-brane Systems Working in Generating and Accepting Modes: Expressiveness andEncodings. In MEMBRANE COMPUTING (2010), Gheorghe, M and Hinze, Tand Paun, G and Rozenberg, G and Salomaa, A, Ed., vol. 6501 of Lecture Notesin Computer Science, pp. 103–118. 11th International Conference on MembraneComputing, Jena, GERMANY, AUG 24-27, 2010.

[49] Barmpalias, G. ALGORITHMIC RANDOMNESS AND MEASURES OF COM-PLEXITY. BULLETIN OF SYMBOLIC LOGIC 19, 3 (SEP 2013), 318–350.

[50] Barmpalias, G., Brodhead, P., Cenzer, D., Dashti, S., and Weber, R.Algorithmic randomness of closed sets. JOURNAL OF LOGIC AND COMPU-TATION 17, 6 (DEC 2007), 1041–1062. Conference on Logical Approaches toComputational Barriers, Univ Wales Swansea, Swansea, WALES, JUL, 2006.

[51] Barmpalias, G., and Dowe, D. L. Universality probability of a prefix-freemachine. PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES 370, 1971, SI(JUL 28 2012), 3488–3511.

[52] Barmpalias, G., and Downey, R. G. EXACT PAIRS FOR THE IDEAL OFTHE K-TRIVIAL SEQUENCES IN THE TURING DEGREES. JOURNAL OFSYMBOLIC LOGIC 79, 3 (SEP 2014), 676–692.

[53] Barmpalias, G., Hoelzl, R., Lewis, A. E. M., and Merkle, W. Analoguesof Chaitin’s Omega in the computably enumerable sets. INFORMATION PRO-CESSING LETTERS 113, 5-6 (MAR 2013), 171–178.

[54] Barmpalias, G., and Lewis, A. The ibT degrees of computably enumerablesets are not dense. ANNALS OF PURE AND APPLIED LOGIC 141, 1-2 (AUG2006), 51–60.

[55] Barmpalias, G., and Li, A. Kolmogorov complexity and computably enumer-able sets. ANNALS OF PURE AND APPLIED LOGIC 164, 12, SI (DEC 2013),1187–1200.

[56] Barnett, N. S., and Dragomir, S. S. Some remarks on the noiseless cod-ing theorem. In Inequality Theory and Applications, Vol 4 (2007), Kim, JK andDragomir, SS, Ed., vol. 4 of Inequality Theory and Applications, Kyungnam Univ,Inst Basic Sci Res; GNU Res, Inst Natl Sci; Korean Math Soc; Nova Sci Publish-ers, pp. 11–14. 8th International Conference on Nonlinear Functional Analysis andApplications, Gyeongsang Natl Univ, Chinju, SOUTH KOREA, AUG 09-13, 2004.

[57] Barnsley, M. F., and Lesniak, K. The Chaos Game on a General IteratedFunction System from a Topological Point of View. INTERNATIONAL JOURNALOF BIFURCATION AND CHAOS 24, 11 (NOV 2014).

[58] Basic, B. ON “VERY PALINDROMIC” SEQUENCES. JOURNAL OF THEKOREAN MATHEMATICAL SOCIETY 52, 4 (JUL 2015), 765–780.

[59] Becher, V., Daicz, S., and Chaitin, G. A highly random number. In COMBI-NATORICS, COMPUTABILITY AND LOGIC (2001), Calude, CS and Dinneen,

106

MJ and Sburlan, S, Ed., DISCRETE MATHEMATICS AND THEORETICALCOMPUTER SCIENCE (SERIES), Fac Math & Comp Sci; Ovidius Univ; UnivAuckland, Ctr Discrete Math & Theoret Sci, pp. 55–68. 3rd International Con-ference on Discrete Mathematics and Theoretical Computer Science (DMTCS 01),CONSTANTA, ROMANIA, 2001.

[60] Becher, V., Figueira, S., Grigorieff, S., and Miller, J. S. Randomnessand halting probabilities. JOURNAL OF SYMBOLIC LOGIC 71, 4 (DEC 2006),1411–1430.

[61] Becher, V., and Grigorieff, S. Random reals a la Chaitin with or withoutprefix-freeness. THEORETICAL COMPUTER SCIENCE 385, 1-3 (OCT 15 2007),193–201.

[62] Becher, V., and Heiber, P. A. A linearly computable measure of string com-plexity. THEORETICAL COMPUTER SCIENCE 438 (JUN 22 2012), 62–73.

[63] Bechmann, M., Sebald, A., and Stepney, S. Boolean Logic Gate Design Prin-ciples in Unconventional Computers: an NMR Case Study. INTERNATIONALJOURNAL OF UNCONVENTIONAL COMPUTING 8, 2 (2012), 139–159.

[64] Beggs, E., Costa, J. F., Loff, B., and Tucker, J. V. Oracles and adviceas measurements. In UNCONVENTIONAL COMPUTATION, PROCEEDINGS(2008), Calude, CS and Costa, JF and Freund, R and Oswald, M and Rozenberg,G, Ed., vol. 5204 of LECTURE NOTES IN COMPUTER SCIENCE, EATCS;Vienna Univ Technol; Ctr Discrete Math & Theoret Comp Sci, pp. 33–50. 7th In-ternational Conference on Unconventional Computation, Vienna, AUSTRIA, AUG25-28, 2008.

[65] Beggs, E. J., Costa, J. F., and Tucker, J. V. Axiomatizing physical ex-periments as oracles to algorithms. PHILOSOPHICAL TRANSACTIONS OFTHE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEER-ING SCIENCES 370, 1971, SI (JUL 28 2012), 3359–3384.

[66] Bel-Enguix, G., and Jimenez-Lopez, M. D. Dynamic meaning membranesystems: An application to the description of semantic change. FUNDAMENTAINFORMATICAE 76, 3 (MAR 2007), 219–237.

[67] Benatti, F., Oskouei, S. K., and Abad, A. S. D. Gacs quantum algorithmicentropy in infinite dimensional Hilbert spaces. JOURNAL OF MATHEMATICALPHYSICS 55, 8 (AUG 2014).

[68] Bergeron, A., and Hamel, S. Fast implementations of automata computations.In IMPLEMENTATION AND APPLICATION OF AUTOMATA (2001), Yu, Sand Paun, A, Ed., vol. 2088 of LECTURE NOTES IN COMPUTER SCIENCE,EATCS; ACM SIGACT, pp. 47–56. 5th International Conference on Implemen-tation and Application of Automata, UNIV WESTERN ONTARIO, LONDON,CANADA, JUL 24-25, 2000.

[69] Bienvenu, L., Desfontaines, D., and Shen, A. What Percentage of ProgramsHalt? In Automata, Languages, and Programming, Pt I (2015), Halldorsson, MMand Iwama, K and Kobayashi, N and Speckmann, B, Ed., vol. 9134 of Lecture Notes

107

in Computer Science, pp. 219–230. 42nd International Colloquium on Automata,Languages and Programming (ICALP), Kyoto, JAPAN, JUL 06-10, 2015.

[70] Bienvenu, L., Doty, D., and Stephan, F. Constructive Dimension and TuringDegrees. THEORY OF COMPUTING SYSTEMS 45, 4 (NOV 2009), 740–755. 3rdComputability in Europe Conference 2007, Univ Siena, Siena, ITALY, 2007.

[71] Bienvenu, L., Romashchenko, A., Shen, A., Taveneaux, A., and Ver-meeren, S. The axiomatic power of Kolmogorov complexity. ANNALS OF PUREAND APPLIED LOGIC 165, 9, SI (SEP 2014), 1380–1402.

[72] Bienvenu, L., and Sablik, M. The dynamics of cellular automata in shift-invariant topologies. In Developments in Language Theory, Proceedings (2007),Harju, T and Karhumaki, J and Lepisto, A, Ed., vol. 4588 of LECTURE NOTESIN COMPUTER SCIENCE, Acak Finland; Finnish Cultural Fdn; Finnish AcadSci & Letters; Nokia Fdn; Turku Univ Fdn; Ctr Hotel; Univ Turku, Dept Math &Ctr Fundamentals Comp & Discrete Math, pp. 84–95. 11th International Confer-ence on Developments in Language Theory, Univ Turku, Turku, FINLAND, JUL03-06, 2007.

[73] Blanchard, F., Cervelle, J., and Formenti, E. Periodicity and transitivityfor cellular automata in Besicovitch topologies. In MATHEMATICAL FOUN-DATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS (2003), Rovan, Band Vojtas, P, Ed., vol. 2747 of LECTURE NOTES IN COMPUTER SCIENCE,Slovak Soc Comp Sci; Comenius Univ, Fac Math, Phys & Informat, pp. 228–238.28th International Symposium on Mathematical Foundations of Computer Science,BRATISLAVA, SLOVAKIA, AUG 25-29, 2003.

[74] Bocharova, V., MacVittie, K., Chinnapareddy, S., Halamek, J., Priv-man, V., and Katz, E. Realization of Associative Memory in an EnzymaticProcess: Toward Biomolecular Networks with Learning and Unlearning Function-alities. JOURNAL OF PHYSICAL CHEMISTRY LETTERS 3, 10 (MAY 17 2012),1234–1237.

[75] Bocharova, V., Zavalov, O., MacVittie, K., Arugula, M. A., Guz, N. V.,Dokukin, M. E., Halamek, J., Sokolov, I., Privman, V., and Katz, E.A biochemical logic approach to biomarker-activated drug release. JOURNAL OFMATERIALS CHEMISTRY 22, 37 (2012), 19709–19717.

[76] Borwein, J. M. The Future of Mathematics 1965 to 2065. In CENTURY OFADVANCING MATHEMATICS, Kennedy, SF, Ed. 2015, pp. 313–329.

[77] Boschetti, F., and Gray, R. A Turing Test for Emergence. In ADVANCESIN APPLIED SELF-ORGANIZING SYSTEMS, Prokopenko, M, Ed., AdvancedInformation and Knowledge Processing. 2008, pp. 349–364.

[78] BRIDGES, D. CONSTRUCTIVE MATHEMATICS AND UNBOUNDED OP-ERATORS - A REPLY TO HELLMAN. JOURNAL OF PHILOSOPHICALLOGIC 24, 5 (OCT 1995), 549–561.

[79] BRIDGES, D., and CALUDE, C. ON RECURSIVE BOUNDS FOR THEEXCEPTIONAL VALUES IN SPEED-UP. THEORETICAL COMPUTER SCI-ENCE 132, 1-2 (SEP 26 1994), 387–394.

108

[80] Bridges, D., Ishihara, H., Mines, R., Richman, F., Schuster, P., andVita, L. Almost locatedness in uniform spaces. CZECHOSLOVAK MATHE-MATICAL JOURNAL 57, 1 (2007), 1–12.

[81] Bridges, D., Schuster, P., and Vita, L. Apartness, topology, and uniformity:a constructive view. MATHEMATICAL LOGIC QUARTERLY 48, 1 (2002), 16–28. Dagstuhl Seminar on Computability and Complexity in Analysis, SCHLOSSDAGSTUHL, GERMANY, NOV 11-16, 2001.

[82] Brown, S. R. Emergence in the central nervous system. COGNITIVE NEURO-DYNAMICS 7, 3 (JUN 2013), 173–195.

[83] Brukner, C. Quantum experiments can test mathematical undecidability. In UN-CONVENTIONAL COMPUTATION, PROCEEDINGS (2008), Calude, CS andCosta, JF and Freund, R and Oswald, M and Rozenberg, G, Ed., vol. 5204 ofLecture Notes in Computer Science, EATCS; Vienna Univ Technol; Ctr DiscreteMath & Theoret Comp Sci, pp. 1–5. 7th International Conference on Uncon-ventional Computation/International Workshop on Computing with Biomolecules,Vienna, AUSTRIA, AUG 25-28, 2008.

[84] Brunet, O. A priori knowledge and the Kochen-Specker theorem. PHYSICSLETTERS A 365, 1-2 (MAY 21 2007), 39–43.

[85] Buhagiar, D., Chetcuti, E., and Dvurecenskij, A. On Gleason’s Theoremwithout Gleason. FOUNDATIONS OF PHYSICS 39, 6 (JUN 2009), 550–558.

[86] Burgin, M. Measuring Power of Algorithms, Computer Programs and Informa-tion Automata. In MEASURING POWER OF ALGORITHMS, COMPUTERPROGRAMS AND INFORMATION AUTOMATA. 2010, pp. 1–347.

[87] Burgin, M., Calude, C. S., and Calude, E. INDUCTIVE COMPLEXITYMEASURES FOR MATHEMATICAL PROBLEMS. INTERNATIONAL JOUR-NAL OF FOUNDATIONS OF COMPUTER SCIENCE 24, 4 (JUN 2013), 487–500.

[88] Busi, N. Causality in membrane systems. In MEMBRANE COMPUTING (2007),Eleftherakis, G and Kefalas, P and Paun, G and Rozenberg, G and Salomaa, A,Ed., vol. 4860 of Lecture Notes in Computer Science, pp. 160–171. 8th InternationalWorkshop on Membrane Computing, Thessaloniki, GREECE, JUN 25-28, 2007.

[89] Busi, N. Using well-structured transition systems to decide divergence for catalyticP systems. THEORETICAL COMPUTER SCIENCE 372, 2-3 (MAR 15 2007),125–135. 4th Brainstorming Week on Membrane Computing, Seville, SPAIN, JAN30-FEB 03, 2006.

[90] Calu, D. J., Stalnaker, T. A., Franz, T. M., Singh, T., Shaham, Y., andSchoenbaum, G. Withdrawal from cocaine self-administration produces long-lasting deficits in orbitofrontal-dependent reversal learning in rats. LEARNING &MEMORY 14, 5 (MAY 2007), 325–328.

[91] CALUDE, C. METRIZABILITY OF FREE MONOIDS. DISCRETE MATHE-MATICS 15, 4 (1976), 307–310.

109

[92] CALUDE, C. DARBOUX PROPERTY AND PRIMITIVE RECURSIVEFUNCTIONS. REVUE ROUMAINE DE MATHEMATIQUES PURES ET AP-PLIQUEES 26, 9 (1981), 1187–1192.

[93] CALUDE, C. NOTE ON A HIERARCHY OF PRIMITIVE RECURSIVEFUNCTIONS. REVUE ROUMAINE DE MATHEMATIQUES PURES ET AP-PLIQUEES 27, 9 (1982), 935–936.

[94] CALUDE, C. SUPER-EXPONENTIALS NONPRIMITIVE RECURSIVE, BUTRUDIMENTARY. INFORMATION PROCESSING LETTERS 25, 5 (JUL 101987), 311–315.

[95] CALUDE, C. RELATIVIZED TOPOLOGICAL SIZE OF SETS OF PARTIALRECURSIVE FUNCTIONS. THEORETICAL COMPUTER SCIENCE 87, 2(SEP 23 1991), 347–352.

[96] Calude, C., Calude, E., Svozil, K., and Yu, S. Physical versus computa-tional complementarity .1. INTERNATIONAL JOURNAL OF THEORETICALPHYSICS 36, 7 (JUL 1997), 1495–1523.

[97] CALUDE, C., and CAMPEANU, C. NOTE ON THE TOPOLOGICAL-STRUCTURE OF RANDOM STRINGS. THEORETICAL COMPUTER SCI-ENCE 112, 2 (MAY 10 1993), 383–390.

[98] CALUDE, C., and CHITESCU, I. STRONG NON-COMPUTABILITY OFRANDOM STRINGS. INTERNATIONAL JOURNAL OF COMPUTER MATH-EMATICS 11, 1 (1982), 43–45.

[99] CALUDE, C., and CHITESCU, I. ON REPRESENTABILITY OF P-MARTIN-LOF TESTS. KYBERNETIKA 19, 1 (1983), 42–47.

[100] CALUDE, C., and CHITESCU, I. REPRESENTABILITY OF RECURSIVEMARTINLOF,P. TESTS. KYBERNETIKA 19, 6 (1983), 526–536.

[101] CALUDE, C., and CHITESCU, I. A COMBINATORIAL CHARACTERIZA-TION OF SEQUENTIAL MARTINLOF,P TESTS. INTERNATIONAL JOUR-NAL OF COMPUTER MATHEMATICS 17, 1 (1985), 53–64.

[102] CALUDE, C., and CHITESCU, I. QUALITATIVE PROPERTIES OFMARTIN-LOF,P. RANDOM SEQUENCES. BOLLETTINO DELLA UNIONEMATEMATICA ITALIANA 3B, 1 (MAR 1989), 229–240.

[103] CALUDE, C., and CHITESCU, I. UPPER LIMITATION OF KOL-MOGOROV COMPLEXITY AND UNIVERSAL MARTINLOF,P. TESTS.JOURNAL OF COMPUTATIONAL MATHEMATICS 7, 1 (JAN 1989), 61–70.

[104] CALUDE, C., and ISTRATE, G. DETERMINING AND STATIONARY SETSFOR SOME CLASSES OF PARTIAL RECURSIVE FUNCTIONS. THEORETI-CAL COMPUTER SCIENCE 82, 1 (MAY 22 1991), 151–155.

[105] CALUDE, C., ISTRATE, G., and ZIMAND, M. RECURSIVE BAIRE CLAS-SIFICATION AND SPEEDABLE FUNCTIONS. ZEITSCHRIFT FUR MATH-EMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK 38, 2 (1992),169–178.

110

[106] CALUDE, C., JURGENSEN, H., and ZIMAND, M. IS INDEPENDENCEAN EXCEPTION. APPLIED MATHEMATICS AND COMPUTATION 66, 1(NOV 1994), 63–76.

[107] CALUDE, C., and SANTEAN, L. ON A THEOREM OF ASSER,GUNTER.ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DERMATHEMATIK 36, 2 (1990), 143–147.

[108] Calude, C., Staiger, L., and Stay, M. Cristian Calude, Ludwig Staiger andMichael Stay on - HALTING AND NON-HALTING TURING COMPUTATIONS.In ALAN TURING: HIS WORK AND IMPACT, Cooper, SB and VanLeeuwen,J, Ed. 2013, pp. 105–109.

[109] CALUDE, C., and TATARAM, M. UNIVERSAL SEQUENCES OF PRIM-ITIVE RECURSIVE FUNCTIONS. REVUE ROUMAINE DE MATHEMA-TIQUES PURES ET APPLIQUEES 28, 5 (1983), 381–389.

[110] CALUDE, C., and VAIDA, D. EHRENFEUCHT TEST SET THEOREMAND HILBERT BASIS THEOREM - A CONSTRUCTIVE GLIMPSE. LEC-TURE NOTES IN COMPUTER SCIENCE 379 (1989), 177–184.

[111] CALUDE, C., and ZIMAND, M. A RELATION BETWEEN CORRECTNESSAND RANDOMNESS IN THE COMPUTATION OF PROBABILISTIC ALGO-RITHMS. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 16,1 (1984), 47–53.

[112] Calude, C., and Zimand, M. Effective category and measure in abstract com-plexity theory. THEORETICAL COMPUTER SCIENCE 154, 2 (FEB 5 1996),307–327.

[113] Calude, C. S., and Calude, E. Algorithmic Complexity of Mathematical Prob-lems: An Overview of Results and Open Problems. INTERNATIONAL JOURNALOF UNCONVENTIONAL COMPUTING 9, 3-4 (2013), 327–343.

[114] Calude, C. S., Calude, E., and Queen, M. S. The complexity of Euler’sinteger partition theorem. THEORETICAL COMPUTER SCIENCE 454 (OCT5 2012), 72–80.

[115] Calude, C. S., and Cooper, S. B. Introduction: computability of the physical.MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE 22, 5, SI (OCT2012), 723–728.

[116] Calude, C. S., and Desfontaines, D. Anytime Algorithms for Non-EndingComputations. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COM-PUTER SCIENCE 26, 4 (JUN 2015), 465–475.

[117] Calude, C. S., and Desfontaines, D. Universality and Almost Decidability.FUNDAMENTA INFORMATICAE 138, 1-2, SI (2015), 77–84.

[118] Calude, C. S., and Gheorghe, M. Formal Models - Computability, Complexity,Applications Preface. FUNDAMENTA INFORMATICAE 131, 3-4 (2014), I–IV.

111

[119] Calude, C. S., and Lewis, J. P. Is there a universal image generator? AP-PLIED MATHEMATICS AND COMPUTATION 218, 16, SI (APR 15 2012),8151–8159. International Workshop on Infinite and Infinitesimal in Mathemat-ics, Computing and Natural Sciences (INFINITY), Cetraro, ITALY, MAY 17-21,2010.

[120] Calude, C. S., Staiger, L., and Stephan, F. Finite State IncompressibleInfinite Sequences. In THEORY AND APPLICATIONS OF MODELS OF COM-PUTATION (TAMC 2014) (2014), Gopal, TV and Agrawal, M and Li, A andCooper, SB, Ed., vol. 8402 of Lecture Notes in Computer Science, Anna Univ, CollEngn Guindy, Vivekananda Auditorium, pp. 50–66. 11th Annual Conference onTheory and Applications of Models of Computation (TAMC), Chennai, INDIA,APR 11-13, 2014.

[121] Calude, C. S., and Svozil, K. Is Feasibility in Physics Limited by FantasyAlone? In COMPUTABLE UNIVERSE: UNDERSTANDING AND EXPLORINGNATURE AS COMPUTATION, Zenil, H, Ed. 2013, pp. 539–547.

[122] Calude, C. S., and Tadaki, K. Spectral Representation of Some ComputablyEnumerable Sets with an Application to Quantum Provability. In UNCONVEN-TIONAL COMPUTATION AND NATURAL COMPUTATION (2013), Mauri, Gand Dennunzio, A and Manzoni, L and Porreca, AE, Ed., vol. 7956 of Lecture Notesin Computer Science, Univ Milano Bicocca; European Assoc Theoret Comp Sci,Italian Chapter; Micron Fdn; Dipartimento Informatica, Sistemistica & Comuni-cazione, pp. 43–54. 12th International Conference on Unconventional Computationand Natural Computation (UCNC), Milan, ITALY, JUL 01-05, 2013.

[123] Calude, C. S., Walter Meyerstein, F., and Salomaa, A. The Universeis Lawless or “Panton chrematon metron anthropon einai”. In COMPUTABLEUNIVERSE: UNDERSTANDING AND EXPLORING NATURE AS COMPUTA-TION, Zenil, H, Ed. 2013, pp. 525–537.

[124] Calude, E. Fermat’s last theorem and chaoticity. NATURAL COMPUTING 11,2, SI (JUN 2012), 241–245.

[125] Calude, E. The Complexity of Riemann’s Hypothesis. JOURNAL OFMULTIPLE-VALUED LOGIC AND SOFT COMPUTING 18, 3-4 (2012), 257–265.

[126] Calude, E., and Lipponen, M. Deterministic incomplete automats: Simulation,universality and complementarity. In UNCONVENTIONAL MODELS OF COM-PUTATION (1998), Calude, CS and Casti, J and Dinneen, MJ, Ed., SPRINGERSERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTERSCIENCE, Univ Auckland; Ctr Discrete Math & Theoret Comp Sci; Santa Fe Inst,pp. 131–149. 1st International Conference on Unconventional Models of Computa-tion (UMC 98), UNIV AUCKLAND, AUCKLAND, NEW ZEALAND, JAN 05-09,1998.

[127] Campeanu, C. DESCRIPTIONAL COMPLEXITY IN ENCODED BLUMSTATIC COMPLEXITY SPACES. INTERNATIONAL JOURNAL OF FOUN-DATIONS OF COMPUTER SCIENCE 25, 7, SI (NOV 2014), 917–932.

112

[128] Campeanu, C., and Paun, A. Computing beyond the turing limit using the Hsystems. In DNA COMPUTING (2005), Ferretti, C and Mauri, G and Zandron,C, Ed., vol. 3384 of LECTURE NOTES IN COMPUTER SCIENCE, Univ MilanoBicocca, Dept Informat; Brainspark plc Comerson; Etnoteam; European Commiss;STMicroelectronics, pp. 24–34. 10th International Workshop on DNA Computing(DNA10), Univ Milano Bicocca, Milan, ITALY, JUN 07-10, 2004.

[129] Capobianco, S., Guillon, P., and Kari, J. Surjective cellular automata farfrom the Garden of Eden. DISCRETE MATHEMATICS AND THEORETICALCOMPUTER SCIENCE 15, 3 (2013), 41–60.

[130] Cardelli, L., and Mardare, R. The Measurable Space of Stochastic Processes.FUNDAMENTA INFORMATICAE 131, 3-4 (2014), 351–371.

[131] Carsetti, A. Life, cognition and metabiology. COGNITIVE PROCESSING 15,4 (NOV 2014), 423–434.

[132] Casasnovas, J., and Vicente Riera, J. Aggregation of Bounded Fuzzy NaturalNumber-Valued Multisets. In MODELING DECISIONS FOR ARTIFICIAL IN-TELLIGENCE (MDAI) (2010), Torra, V and Narukawa, Y and Daumas, M, Ed.,vol. 6408 of Lecture Notes in Artificial Intelligence, pp. 67–78. 7th InternationalConference on Modeling Decisions for Artificial Intelligence (MDAI), Perpignan,FRANCE, OCT 27-29, 2010.

[133] Case, J., Jain, S., Seah, S., and Stephan, F. AUTOMATIC FUNCTIONS,LINEAR TIME AND LEARNING. LOGICAL METHODS IN COMPUTER SCI-ENCE 9, 3 (2013).

[134] Castellanos, J., Paun, G., and Rodriguez-Paton, A. Computing withmembranes: P systems with Worm-Objects. In SPIRE 2000: SEVENTH INTER-NATIONAL SYMPOSIUM ON STRING PROCESSING AND INFORMATIONRETRIEVAL - PROCEEDINGS (2000), Cyted-Amyri Res Project; IEEE, pp. 65–74. 7th International Symposium on String Processing and Information Retrieval(SPIRE 2000), LA CORUNA, SPAIN, SEP 27-29, 2000.

[135] Cavaliere, M., Freund, R., Oswald, M., and Sburlan, D. Multiset randomcontext grammars, checkers, and transducers. THEORETICAL COMPUTER SCI-ENCE 372, 2-3 (MAR 15 2007), 136–151. 4th Brainstorming Week on MembraneComputing, Seville, SPAIN, JAN 30-FEB 03, 2006.

[136] Cervelle, J., Durand, B., and Formenti, E. Algorithmic information the-ory and cellular automata dynamics. In MATHEMATICAL FOUNDATIONS OFCOMPUTER SCIENCE 2001 (2001), Sgall, J and Pultr, A and Kolman, P, Ed.,vol. 2136 of LECTURE NOTES IN COMPUTER SCIENCE, Acad Sci Czech Re-public, Math Inst; Inst Theoret Comp Sci; Inst Comp Sci; Act M Agcy, pp. 248–259. 26th International Symposium on Mathematical Foundations of ComputerScience, MARIANSKE LAZNE, CZECH REPUBLIC, AUG 27-31, 2001.

[137] Chaitin, G. Probability and program-size for functions. FUNDAMENTA IN-FORMATICAE 71, 4 (JUN 2006), 367–370.

[138] Chaitin, G. An algebraic characterization of the halting probability. FUNDA-MENTA INFORMATICAE 79, 1-2 (2007), 17–23.

113

[139] Chaitin, G. How much information can there be in a real number? INTER-NATIONAL JOURNAL OF BIFURCATION AND CHAOS 17, 6 (JUN 2007),1933–1935.

[140] Chaitin, G. Life as Evolving Software. In COMPUTABLE UNIVERSE: UN-DERSTANDING AND EXPLORING NATURE AS COMPUTATION, Zenil, H,Ed. 2013, pp. 277–302.

[141] Chaplin, J. C., Krasnogor, N., and Russell, N. A. Photochromic molecularimplementations of universal computation. BIOSYSTEMS 126 (DEC 2014), 12–26.

[142] Chatelin, F. A computational journey into the mind. NATURAL COMPUTING11, 1, SI (MAR 2012), 67–79.

[143] Chen, S., Ma, B., and Zhang, K. On the similarity metric and the distancemetric. THEORETICAL COMPUTER SCIENCE 410, 24-25 (MAY 28 2009),2365–2376.

[144] Chevalier, G., Dvurecenskij, A., and Svozil, K. Piron’s and Bell’s geomet-ric Lemmas and Gleason’s theorem. FOUNDATIONS OF PHYSICS 30, 10 (OCT2000), 1737–1755.

[145] Chitescu, I., and Plavitu, A. Sugeno Measures on the Code Space. ROMA-NIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY 17, 3(2014), 289–301.

[146] Cho, F., and Squier, R. K. Religion as a Complex and Dynamic System.JOURNAL OF THE AMERICAN ACADEMY OF RELIGION 81, 2 (JUN 2013),357–398.

[147] Chong, C. T., Hoi, G., Stephan, F., and Turetsky, D. PARTIAL FUNC-TIONS AND DOMINATION. LOGICAL METHODS IN COMPUTER SCIENCE11, 3 (2015).

[148] Chown, M. The omega man - He shattered mathematics with a single number.And that was just for starters. NEW SCIENTIST 169, 2281 (MAR 10 2001),28–31.

[149] Ciobanu, G., and Rudeanu, S. Final and sequential behaviours of M-automata.ACTA INFORMATICA 46, 5 (AUG 2009), 361–374.

[150] Ciric, M., Ignjatovic, J., Basic, M., and Jancic, I. Nondeterministic au-tomata: Equivalence, bisimulations, and uniform relations. INFORMATION SCI-ENCES 261 (MAR 10 2014), 185–218.

[151] Ciric, M., Ignjatovic, J., Damljanovic, N., and Basic, M. Bisimulationsfor fuzzy automata. FUZZY SETS AND SYSTEMS 186, 1 (JAN 1 2012), 100–139.

[152] Ciric, M., Stamenkovic, A., Ignjatovic, J., and Petkovic, T. Factor-ization of fuzzy automate. In Fundamentals of Computation Theory, Proceedings(2007), CsuhajVarju, E and Esik, Z, Ed., vol. 4639 of LECTURE NOTES IN COM-PUTER SCIENCE, Hungarian Acad Sci, Comp & Automat Res Inst; Univ Szeged,

114

Inst Comp Sci, pp. 213–225. 16th International Symposium on Fundamentals ofComputation Theory, Budapest, HUNGARY, AUG 27-30, 2007.

[153] Clark, G., and Teutsch, J. Maximizing T-complexity. FUNDAMENTA IN-FORMATICAE 139, 1 (2015), 1–19.

[154] Cockshott, P., and Michaelson, G. Are there new models of computation?Reply to Wegner and Eberbach. COMPUTER JOURNAL 50, 2 (MAR 2007),232–247.

[155] Cooper, S. B. Incomputability, Emergence and the Turing Universe. In CAUSAL-ITY, MEANINGFUL COMPLEXITY AND EMBODIED COGNITION, Carsetti,A, Ed., vol. 46 of Theory and Decision Library Series A Philosophy and Method-ology of the Social Sciences. 2010, pp. 135–153.

[156] Cooper, S. B. The Computational Roots of Hyper-Causality. INTERNATIONALJOURNAL OF UNCONVENTIONAL COMPUTING 6, 5, SI (2010), 437–449. 8thInternational Conference on Unconventional Computation, Ponta Delgada, POR-TUGAL, SEP 07-11, 2009.

[157] Cooper, S. B. Turing’s Titanic Machine? COMMUNICATIONS OF THE ACM55, 3 (MAR 2012), 74–83.

[158] Cooper, S. B. The Mathematician’s Bias - and the Return to Embodied Compu-tation. In COMPUTABLE UNIVERSE: UNDERSTANDING AND EXPLORINGNATURE AS COMPUTATION, Zenil, H, Ed. 2013, pp. 125–142.

[159] Copeland, B. Narrow versus wide mechanism: Including a re-examination ofTuring’s views on the mind-machine issue. JOURNAL OF PHILOSOPHY 97, 1(JAN 2000), 5–32.

[160] Copeland, B., and Sylvan, R. Beyond the universal Turing machine. AUS-TRALASIAN JOURNAL OF PHILOSOPHY 77, 1 (MAR 1999), 46–67.

[161] Copeland, B. J., and Shagrir, O. Physical computation: How general areGandy’s principles for mechanisms? MINDS AND MACHINES 17, 2 (SUM 2007),217–231.

[162] Copeland, B. J., and Shagrir, O. Do Accelerating Turing Machines Computethe Uncomputable? MINDS AND MACHINES 21, 2 (MAY 2011), 221–239.

[163] Cordy, B., and Salomaa, K. On the existence of regular approximations. THE-ORETICAL COMPUTER SCIENCE 387, 2 (NOV 12 2007), 125–135. 8th Inter-national Workshop on Descriptional Complexity of Forman Systems, Las Cruces,NM, JUN 21-23, 2006.

[164] Cornelis, C., Jensen, R., Hurtado, G., and Slezak, D. Attribute selectionwith fuzzy decision reducts. INFORMATION SCIENCES 180, 2 (JAN 15 2010),209–224.

[165] Corolli, L., Maj, C., Marini, F., Besozzi, D., and Mauri, G. An ex-cursion in reaction systems: From computer science to biology. THEORETICALCOMPUTER SCIENCE 454 (OCT 5 2012), 95–108.

115

[166] Crolard, T., Polonowski, E., and Valarcher, P. Extending the LoopLanguage with Higher-Order Procedural Variables. ACM TRANSACTIONS ONCOMPUTATIONAL LOGIC 10, 4 (AUG 2009).

[167] Csuhaj-Varju, E., Di Nola, A., Paun, G., Perez-Jimenez, M. J., andVaszil, G. Editing configurations of P systems. FUNDAMENTA INFORMATI-CAE 82, 1-2 (2008), 29–46.

[168] CsuhajVarju, E., Kari, L., and Paun, G. Test tube distributed systems basedon splicing. COMPUTERS AND ARTIFICIAL INTELLIGENCE 15, 2-3 (1996),211–232.

[169] D’Abramo, G. Asymptotic behavior and halting probability of Turing Machines.CHAOS SOLITONS & FRACTALS 37, 1 (JUL 2008), 210–214.

[170] Dal Negro, L., and Boriskina, S. V. Deterministic aperiodic nanostructuresfor photonics and plasmonics applications. LASER & PHOTONICS REVIEWS 6,2 (MAR 2012), 178–218.

[171] Dal Negro, L., Forestiere, C., Lawrence, N., Lee, S., Trevino, J., andWalsh, G. Aperiodic Order in Nanoplasmonics. In PLASMONICS: THEORYAND APPLICATIONS, Shahbazyan, TV and Stockman, MI, Ed., vol. 15 of Chal-lenges and Advances in Computational Chemistry and Physics. 2013, pp. 329–377.

[172] Dal Negro, L., Lawrence, N., Trevino, J., and Walsh, G. Aperiodic Orderfor Nanophotonics. In OPTICS OF APERIODIC STRUCTURES: FUNDAMEN-TALS AND DEVICE APPLICATIONS, DalNegro, L, Ed. 2014, pp. 1–56.

[173] Dassow, J., Paun, G., Thierrin, G., and Yu, S. Tree-systems of morphisms.ACTA INFORMATICA 38, 2 (NOV 2001), 131–153.

[174] Davie, G. Recursive events in random sequences. ARCHIVE FOR MATHEMAT-ICAL LOGIC 40, 8 (NOV 2001), 629–638.

[175] Davie, G. Kolmogorov complexity and noncomputability. MATHEMATICALLOGIC QUARTERLY 48, 4 (2002), 574–580.

[176] Davie, G., and Fouche, W. L. On the computability of a construction of Brow-nian motion. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE 23,6 (DEC 2013), 1257–1265.

[177] Delahaye, J.-P., and Zenil, H. Numerical evaluation of algorithmic complexityfor short strings: A glance into the innermost structure of randomness. APPLIEDMATHEMATICS AND COMPUTATION 219, 1 (SEP 15 2012), 63–77. 3rd In-ternational Workshop on Physics and Computation, EGYPT, AUG 30-SEP 06,2010.

[178] Devine, S. The Insights of Algorithmic Entropy. ENTROPY 11, 1 (MAR 2009),85–110. Conference on Concepts of Entropy and Their Applications, Melbourne,AUSTRALIA, NOV 26-DEC 12, 2007.

[179] Diacu, F. The solution of the n-body problem. MATHEMATICAL INTELLI-GENCER 18, 3 (SUM 1996), 66–70.

116

[180] Dickhaut, J., Lunawat, R., Pronin, K., and Stecher, J. Decision makingand trade without probabilities. ECONOMIC THEORY 48, 2-3 (OCT 2011), 275–288.

[181] Dinneen, M. J., Kim, Y.-B., and Nicolescu, R. Synchronization in P Modules.In UNCONVENTIONAL COMPUTATION, PROCEEDINGS (2010), Calude, CSand Hagiya, M and Morita, K and Rozenberg, G and Timmis, J, Ed., vol. 6079 ofLecture Notes in Computer Science, EATCS; Acad Europaea; Ctr Discrete Math& Theoret Comp Sci, pp. 32–44. 9th International Conference on UnconventionalComputation, Univ Tokyo, Hongo Campus, Tokyo, JAPAN, JUN 21-25, 2010.

[182] Dittrich, P., Ziegler, J., and Banzhaf, W. Artificial chemistries - A review.ARTIFICIAL LIFE 7, 3 (FAL 2001), 225–275.

[183] Downey, R., Hirschfeldt, D., and LaForte, G. Randomness and reducibil-ity. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001(2001), Sgall, J and Pultr, A and Kolman, P, Ed., vol. 2136 of LECTURE NOTESIN COMPUTER SCIENCE, Acad Sci Czech Republic, Math Inst; Inst TheoretComp Sci; Inst Comp Sci; Act M Agcy, pp. 316–327. 26th International Sympo-sium on Mathematical Foundations of Computer Science, MARIANSKE LAZNE,CZECH REPUBLIC, AUG 27-31, 2001.

[184] Downey, R., Hirschfeldt, D. R., and LaForte, G. Undecidability of thestructure of the Solovay degrees of c.e. reals. JOURNAL OF COMPUTER ANDSYSTEM SCIENCES 73, 5 (AUG 2007), 769–787.

[185] Downey, R., Hirschfeldt, D. R., Nies, A., and Terwijn, S. A. Calibratingrandomness. BULLETIN OF SYMBOLIC LOGIC 12, 3 (SEP 2006), 411–491.

[186] Downey, R., Merkle, W., and Reimann, J. Schnorr dimension. MATHE-MATICAL STRUCTURES IN COMPUTER SCIENCE 16, 5 (OCT 2006), 789–811. 1st Conference on Computability in Europe - New Computational Paradigms,Univ Amsterdam, Amsterdam, NETHERLANDS, JUN, 2005.

[187] Downey, R., and Terwijn, S. Computably enumerable reals and uniformlypresentable ideals. MATHEMATICAL LOGIC QUARTERLY 48, 1 (2002), 29–40. Dagstuhl Seminar on Computability and Complexity in Analysis, SCHLOSSDAGSTUHL, GERMANY, NOV 11-16, 2001.

[188] Downey, R. G., and Hirschfeldt, D. R. Algorithmic Randomness and Com-plexity. In ALGORITHMIC RANDOMNESS AND COMPLEXITY, Theory andApplications of Computability. 2010, pp. 401+.

[189] Dragomir, N., Dragomir, S., Pearce, C., and Sunde, J. Kraft’s numberand ideal word packing. In UNSOLVED PROBLEMS OF NOISE AND FLUC-TUATIONS (2000), Abbott, D and Kish, LB, Ed., vol. 511 of AIP CONFER-ENCE PROCEEDINGS, IEEE Electron Devoces Soc; Inst Phys; US Off NavalRes; USAF Res Labs; Ctr Biomed Engn, Adelaide; Natl Inst Theoret Phys; DeptInd Sci & Resources Australia; Defence Sci & Technol Org; Inst Engineers, Aus-tralia, pp. 347–352. 2nd International Conference on Unsolved Problems of Noiseand Fluctuations (UPoN 99), ADELAIDE, AUSTRALIA, JUL 12-15, 1999.

117

[190] Dubacq, J., Durand, B., and Formenti, E. Kolmogorov complexity andcellular automata classification. THEORETICAL COMPUTER SCIENCE 259,1-2 (MAY 28 2001), 271–285.

[191] Durand, A., Jones, N. D., Makowsky, J. A., and More, M. FIFTY YEARSOF THE SPECTRUM PROBLEM: SURVEY AND NEW RESULTS. BULLETINOF SYMBOLIC LOGIC 18, 4 (DEC 2012), 505–553.

[192] Durand, B., and Porrot, S. Comparison between the complexity of a func-tion and the complexity of its graph. In MATHEMATICAL FOUNDATIONS OFCOMPUTER SCIENCE 1998 (1998), Brim, L and Gruska, J and Zlatuska, J, Ed.,vol. 1450 of LECTURE NOTES IN COMPUTER SCIENCE, pp. 732–739. 23rdInternational Symposium on the Mathematical Foudations of Computer Science(MFCS 98), BRNO, CZECH REPUBLIC, AUG 24-28, 1998.

[193] Dyckhoff, R., and Negri, S. Decision methods for linearly ordered Heytingalgebras. ARCHIVE FOR MATHEMATICAL LOGIC 45, 4 (MAY 2006), 411–422.

[194] Emch, G. Probabilistic issues in statistical mechanics. STUDIES IN HISTORYAND PHILOSOPHY OF MODERN PHYSICS 36B, 2 (JUN 2005), 303–322. Con-ference on Philosophical and Foundational Issues in Statistical Physics, Utrecht,NETHERLANDS, NOV 28-30, 2003.

[195] Enguix, G. Preliminaries about some possible applications of P systems in lin-guistics. In MEMBRANE COMPUTING (2003), Paun, G and Rozenberg, G andSalomaa, A and Zandron, C, Ed., vol. 2597 of LECTURE NOTES IN COM-PUTER SCIENCE, pp. 74–89. International Workshop on Membrane Computing,CURTEA DE ARGES, ROMANIA, AUG 19-23, 2002.

[196] Esbelin, H., and More, M. Rudimentary relations and primitive recursion:A toolbox. THEORETICAL COMPUTER SCIENCE 193, 1-2 (FEB 28 1998),129–148.

[197] Estevez-Rams, E., Lora Serrano, R., Aragon Fernandez, B., andBrito Reyes, I. On the non-randomness of maximum Lempel Ziv complexitysequences of finite size. CHAOS 23, 2 (JUN 2013).

[198] Estevez-Rams, E., Lora-Serrano, R., Nunes, C. A. J., and Aragon-Fernandez, B. Lempel-Ziv complexity analysis of one dimensional cellular au-tomata. CHAOS 25, 12 (DEC 2015).

[199] Etesi, G. A Proof of the Geroch-Horowitz-Penrose Formulation of the Strong Cos-mic Censor Conjecture Motivated by Computability Theory. INTERNATIONALJOURNAL OF THEORETICAL PHYSICS 52, 3 (MAR 2013), 946–960.

[200] Ewert, W., Marks, II, R. J., Thompson, B. B., and Yu, A. EvolutionaryInversion of Swarm Emergence Using Disjunctive Combs Control. IEEE TRANS-ACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 43, 5 (SEP 2013),1063–1076.

[201] Fan, C.-M., Huang, C. C., and Yu, S. S. On n-power prefix languages. INTER-NATIONAL JOURNAL OF COMPUTER MATHEMATICS 85, 5 (MAY 2008),703–715.

118

[202] Farhadinia, B. Hesitant fuzzy set lexicographical ordering and its applicationto multi-attribute decision making. INFORMATION SCIENCES 327 (JAN 102016), 233–245.

[203] Farr, G. Cost-effectiveness of algorithms. DISCRETE MATHEMATICS ANDTHEORETICAL COMPUTER SCIENCE 17, 1 (2015), 201–218.

[204] Ferbus-Zanda, M., and Grigorieff, S. Kolmogorov Complexity in Perspec-tive Part I: Information Theory and Randomness. In CONSTRUCTIVITY ANDCOMPUTABILITY IN HISTORICAL AND PHILOSOPHICAL PERSPECTIVE(2014), Dubucs, J and Bourdeau, M, Ed., vol. 34 of Logic Epistemology and theUnity of Science, pp. 57–94. Meeting on Computability and Constructivity in His-torical and Philosophical Perspective, Ecole Normale Superieure, Paris, FRANCE,DEC 17-18, 2006.

[205] Figueira, S., and Nies, A. Feasible Analysis, Randomness, and Base Invariance.THEORY OF COMPUTING SYSTEMS 56, 3, SI (APR 2015), 439–464.

[206] Figueira, S., Stephan, F., and Wu, G. Randomness and universal machines.JOURNAL OF COMPLEXITY 22, 6 (DEC 2006), 738–751. 2nd InternationalConference on Computability and Complexity in Analysis, Kyoto Univ, Kyoto,JAPAN, AUG 25-29, 2005.

[207] Fiorini, R. A. How Random is Your Tomographic Noise? A Number TheoreticTransform (NTT) Approach. FUNDAMENTA INFORMATICAE 135, 1-2 (2014),135–170.

[208] Fiske, M. S. Quantum Random Active Element Machine. In UNCONVEN-TIONAL COMPUTATION AND NATURAL COMPUTATION (2013), Mauri,G and Dennunzio, A and Manzoni, L and Porreca, AE, Ed., vol. 7956 of Lec-ture Notes in Computer Science, Univ Milano Bicocca; European Assoc TheoretComp Sci, Italian Chapter; Micron Fdn; Dipartimento Informatica, Sistemistica& Comunicazione, pp. 252–254. 12th International Conference on UnconventionalComputation and Natural Computation (UCNC), Milan, ITALY, JUL 01-05, 2013.

[209] Flaminio, T., Godo, L., and Hosni, H. On the logical structure of de Finetti’snotion of event. JOURNAL OF APPLIED LOGIC 12, 3, SI (SEP 2014), 279–301.

[210] Fouche, W., Heidema, J., Jones, G., and Potgieter, P. H. Universal-ity and programmability of quantum computers. THEORETICAL COMPUTERSCIENCE 403, 1 (AUG 20 2008), 121–129.

[211] Fratto, B. E., Guz, N., and Katz, E. Biomolecular Computing Realized inParallel Flow Systems: Enzyme-Based Double Feynman Logic Gate. PARALLELPROCESSING LETTERS 25, 1, SI (MAR 2015).

[212] Fratto, B. E., and Katz, E. Reversible Logic Gates Based on Enzyme-Biocatalyzed Reactions and Realized in Flow Cells: A Modular Approach.CHEMPHYSCHEM 16, 7 (MAY 18 2015), 1405–1415.

[213] Fratto, B. E., Roby, L. J., Guz, N., and Katz, E. Enzyme-based logic gatesswitchable between OR, NXOR and NAND Boolean operations realized in a flowsystem. CHEMICAL COMMUNICATIONS 50, 81 (2014), 12043–12046.

119

[214] Fresco, N. A Critical Survey of Some Competing Accounts of Concrete DigitalComputation. In ALGORITHMIC PROBABILITY AND FRIENDS: BAYESIANPREDICTION AND ARTIFICIAL INTELLIGENCE (2013), Dowe, DL, Ed.,vol. 7070 of Lecture Notes in Computer Science, AF Off Sci Res; Monash Univ,Fac Informat Technol; Natl ICT Australia; Asian Off Aerosp Res & Dev, pp. 155–173. Ray Solomonoff 85th Memorial Conference, Monash Univ Clayton Campus,Melbourne, AUSTRALIA, NOV 30-DEC 02, 2011.

[215] Fresco, N., and Staines, P. J. A Revised Attack on Computational Ontology.MINDS AND MACHINES 24, 1, SI (FEB 2014), 101–122.

[216] Freund, R. Energy-controlled P systems. In MEMBRANE COMPUTING (2003),Paun, G and Rozenberg, G and Salomaa, A and Zandron, C, Ed., vol. 2597 of LEC-TURE NOTES IN COMPUTER SCIENCE, pp. 247–260. International Workshopon Membrane Computing, CURTEA DE ARGES, ROMANIA, AUG 19-23, 2002.

[217] Freund, R., Kari, L., Oswald, M., and Sosik, P. Computationally universalP systems without priorities: two catalysts are sufficient. THEORETICAL COM-PUTER SCIENCE 330, 2 (FEB 2 2005), 251–266. 4th International Conferenceon Electromagnetic Wave Interaction with Water and Moist Substances, Mat Res& Testing Inst, Weimar, GERMANY, MAY, 2001.

[218] Freund, R., Kari, L., and Paun, G. DNA computing based on splicing: Theexistence of universal computers. THEORY OF COMPUTING SYSTEMS 32, 1(JAN-FEB 1999), 69–112.

[219] Freund, R., and Paun, A. Membrane systems with symport/antiport rules:Universality results. In MEMBRANE COMPUTING (2003), Paun, G and Rozen-berg, G and Salomaa, A and Zandron, C, Ed., vol. 2597 of LECTURE NOTESIN COMPUTER SCIENCE, pp. 270–287. International Workshop on MembraneComputing, CURTEA DE ARGES, ROMANIA, AUG 19-23, 2002.

[220] Ganea, M. Epistemic Optimism. PHILOSOPHIA MATHEMATICA 16, 3 (OCT2008), 333–353.

[221] Ganz, R. E. The Decimal Expansion of pi Is Not Statistically Random. EXPER-IMENTAL MATHEMATICS 23, 2 (2014), 99–104.

[222] Garcia-Arnau, M., Manrique, D., Rodriguez-Paton, A., and Sosik, P.A P system and a constructive membrane-inspired DNA algorithm for solving theMaximum Clique Problem. BIOSYSTEMS 90, 3 (NOV-DEC 2007), 687–697.

[223] Garola, C. Objectivity versus nonobjectivity in quantum mechanics. FOUNDA-TIONS OF PHYSICS 30, 9 (SEP 2000), 1539–1565.

[224] Gauvrit, N., Zenil, H., Delahaye, J.-P., and Soler-Toscano, F. Al-gorithmic complexity for short binary strings applied to psychology: a primer.BEHAVIOR RESEARCH METHODS 46, 3 (SEP 2014), 732–744.

[225] Gdor, E., Katz, E., and Mandler, D. Biomolecular AND Logic Gate Basedon Immobilized Enzymes with Precise Spatial Separation Controlled by ScanningElectrochemical Microscopy. JOURNAL OF PHYSICAL CHEMISTRY B 117, 50(DEC 19 2013), 16058–16065.

120

[226] Gelenbe, E. Natural Computation. COMPUTER JOURNAL 55, 7 (JUL 2012),848–851.

[227] Georgiev, I. Continued fractions of primitive recursive real numbers. MATHE-MATICAL LOGIC QUARTERLY 61, 4-5 (AUG 2015), 288–306.

[228] Gepp, A., and Stocks, P. A review of procedures to evolve quantum algorithms.GENETIC PROGRAMMING AND EVOLVABLE MACHINES 10, 2 (JUN 2009),181–228.

[229] Gheorghe, M., and Paun, G. Computing by Self-Assembly: DNA Molecules,Polyominoes, Cells. In SYSTEMS SELF-ASSEMBLY: MULTIDISCIPLINARYSNAPSHOTS, Krasnogor, N and Gustafson, S and Pelta, DA and Verdegay, JL,Ed., vol. 5 of Studies in Multidisciplinarity. 2008, pp. 49–78.

[230] Gheorghe, M., and Stannett, M. Membrane system models for super-Turingparadigms. NATURAL COMPUTING 11, 2, SI (JUN 2012), 253–259.

[231] Golding, J. Ecce Homo Sexual: Ontology and Eros in the Age of Incompletenessand Entanglement. PARALLAX 20, 3, SI (2014), 217–230.

[232] Gorecka, J. N., Gorecki, J., and Igarashi, Y. One dimensional chemical sig-nal diode constructed with two nonexcitable barriers. JOURNAL OF PHYSICALCHEMISTRY A 111, 5 (FEB 8 2007), 885–889.

[233] Gorecki, J., Gizynski, K., Guzowski, J., Gorecka, J. N., Garstecki, P.,Gruenert, G., and Dittrich, P. Chemical computing with reaction-diffusionprocesses. PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETYA-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES 373, 2046(JUL 28 2015).

[234] Grabowski, L. On Turing dynamical systems and the Atiyah problem. INVEN-TIONES MATHEMATICAE 198, 1 (OCT 2014), 27–69.

[235] Greco, S., Matarazzo, B., and Slowinski, R. Rough sets theory for mul-ticriteria decision analysis. EUROPEAN JOURNAL OF OPERATIONAL RE-SEARCH 129, 1 (FEB 16 2001), 1–47.

[236] Greco, S., Matarazzo, B., and Slowinski, R. Algebra and Topology forDominance-Based Rough Set Approach. In ADVANCES IN INTELLIGENT IN-FORMATION SYSTEMS, Ras, ZW and Tsay, LS, Ed., vol. 265 of Studies inComputational Intelligence. 2010, pp. 43–78.

[237] Greco, S., Matarazzo, B., and Slowinski, R. On Topological Dominance-based Rough Set Approach. In TRANSACTIONS ON ROUGH SETS XII, Peters,JF and Skowron, A and Slowinski, R and Lingras, P and Miao, DQ and Tsumoto,S, Ed., vol. 6190 of Lecture Notes in Computer Science. 2010, pp. 21–45.

[238] Greenberg, N., and Miller, J. S. Diagonally non-recursive functions andeffective Hausdorff dimension. BULLETIN OF THE LONDON MATHEMATICALSOCIETY 43, 4 (AUG 2011), 636–654.

121

[239] Gruska, J. De-quantisation. In 8TH INTERNATIONAL CONFERENCE ONPROGRESS IN THEORETICAL PHYSICS (ICPTP 2011) (2012), Mebarki, Nand Mimouni, J and Belaloui, N and Moussa, KA, Ed., vol. 1444 of AIP ConferenceProceedings, Algerian Minist Higher Educ & Sci Res; Directorate Gen Sci Res& Technol Dev (DGRSDT); Rectorate Mentouri Univ; Fac Sci Mentouri Univ,pp. 106–116. 8th International Conference on Progress in Theoretical Physics(ICPTP), Campus Mentouri Univ, Constantine, ALGERIA, OCT 23-25, 2011.

[240] Gruska, J. Grand Challenges of Informatics. In COMPUTING WITH NEWRESOURCES: ESSAYS DEDICATED TO JOZEF GRUSKA ON THE OCCA-SION OF HIS 80TH BIRTHDAY, Calude, CS and Freivalds, R and Kazuo, I, Ed.,vol. 8808 of Lecture Notes in Computer Science. 2014, pp. 449–461.

[241] Guitart, R. Cohomological Emergence of Sense in Discourses (As Living SystemsFollowing Ehresmann and Vanbremeersch). AXIOMATHES 19, 3 (SEP 2009), 245–270.

[242] Gurevich, Y., and Passmore, G. O. Impugning Randomness, Convincingly.STUDIA LOGICA 100, 1-2, SI (APR 2012), 193–222.

[243] Gustafson, K. Parallel computing forty years ago. MATHEMATICS AND COM-PUTERS IN SIMULATION 51, 1-2 (DEC 22 1999), 47–62.

[244] Guz, N., Halamek, J., Rusling, J. F., and Katz, E. A biocatalytic cas-cade with several output signals-towards biosensors with different levels of con-fidence. ANALYTICAL AND BIOANALYTICAL CHEMISTRY 406, 14 (MAY2014), 3365–3370.

[245] Hagar, A. Quantum algorithms: Philosophical lessons. MINDS AND MA-CHINES 17, 2 (SUM 2007), 233–247.

[246] Halamek, J., Bocharova, V., Arugula, M. A., Strack, G., Privman, V.,and Katz, E. Realization and Properties of Biochemical-Computing BiocatalyticXOR Gate Based on Enzyme Inhibition by a Substrate. JOURNAL OF PHYSI-CAL CHEMISTRY B 115, 32 (AUG 18 2011), 9838–9845.

[247] Halamek, J., Bocharova, V., Chinnapareddy, S., Windmiller, J. R.,Strack, G., Chuang, M.-C., Zhou, J., Santhosh, P., Ramirez, G. V.,Arugula, M. A., Wang, J., and Katz, E. Multi-enzyme logic network ar-chitectures for assessing injuries: digital processing of biomarkers. MOLECULARBIOSYSTEMS 6, 12 (2010), 2554–2560.

[248] Halamek, J., Zavalov, O., Halamkova, L., Korkmaz, S., Privman, V.,and Katz, E. Enzyme-Based Logic Analysis of Biomarkers at Physiological Con-centrations: AND Gate with Double-Sigmoid “Filter” Response. JOURNAL OFPHYSICAL CHEMISTRY B 116, 15 (APR 19 2012), 4457–4464.

[249] Halamkova, L., Halamek, J., Bocharova, V., Wolf, S., Mulier, K. E.,Beilman, G., Wang, J., and Katz, E. Analysis of biomarkers characteristic ofporcine liver injury-from biomolecular logic gates to an animal model. ANALYST137, 8 (2012), 1768–1770.

122

[250] Harding, S. L., Miller, J. F., and Rietman, E. A. Evolution in materio: Ex-ploiting the physics of materials for computation. INTERNATIONAL JOURNALOF UNCONVENTIONAL COMPUTING 4, 2 (2008), 155–194.

[251] Hartmann, S., and Link, S. Deciding implication for functional dependencies incomplex-value databases. THEORETICAL COMPUTER SCIENCE 364, 2 (NOV6 2006), 212–240. 11th Workshop on Logic, Language, Information and Compu-tation, Univ Paris, Fontainebleau Campus, Fontainebleau, FRANCE, JUL 19-22,2004.

[252] Hartmann, S., Link, S., and Schewe, K. Axiomatisations of functional de-pendencies in the presence of records, lists, sets and multisets. THEORETICALCOMPUTER SCIENCE 355, 2 (APR 11 2006), 167–196. 10th Workshop on Logic,Language, Information and Computation, Fed Univ Ouro Preto, Minas Gerais,BRAZIL, JUL 29-AUG 01, 2003.

[253] Haw, J. Y., Assad, S. M., Lance, A. M., Ng, N. H. Y., Sharma, V., Lam,P. K., and Symul, T. Maximization of Extractable Randomness in a Quan-tum Random-Number Generator. PHYSICAL REVIEW APPLIED 3, 5 (MAY 112015).

[254] Hay, N. J. Simulation complexity. FUNDAMENTA INFORMATICAE 83, 1-2(2008), 117–140.

[255] Hermens, R. Conway-Kochen and the Finite Precision Loophole. FOUNDA-TIONS OF PHYSICS 44, 10 (OCT 2014), 1038–1048.

[256] Hertling, P., and Weihrauch, K. Randomness spaces. In AUTOMATA,LANGUAGES AND PROGRAMMING (1998), Larsen, KG and Skyum, S andWinskel, G, Ed., vol. 1443 of LECTURE NOTES IN COMPUTER SCIENCE,European Assoc Theoret Comp Sci, pp. 796–807. 25th International Colloquium onAutomata, Languages and Programming (ICALP 98), AALBORG, DENMARK,JUL 13-17, 1998.

[257] Higuchi, K., Hudelson, W. M. P., Simpson, S. G., and Yokoyama, K.Propagation of partial randomness. ANNALS OF PURE AND APPLIED LOGIC165, 2 (FEB 2014), 742–758.

[258] Hintikka, J. Who Has Kidnapped the Notion of Information? In SOCRATICEPISTEMOLOGY: EXPLORATIONS OF KNOWLEDGE-SEEKING BY QUES-TIONING. 2007, pp. 189–210.

[259] Hitchcock, J. M., and Mayordomo, E. Base invariance of feasible dimension.INFORMATION PROCESSING LETTERS 113, 14-16 (JUL-AUG 2013), 546–551.

[260] Hiyama, S., Moritani, Y., Gojo, R., Takeuchi, S., and Sutoh, K.Biomolecular-motor-based autonomous delivery of lipid vesicles as nano- or mi-croscale reactors on a chip. LAB ON A CHIP 10, 20 (2010), 2741–2748.

[261] Hodson-Tole, E. F., and Wakeling, J. M. Variations in motor unit re-cruitment patterns occur within and between muscles in the running rat (Rattus

123

norvegicus). JOURNAL OF EXPERIMENTAL BIOLOGY 210, 13 (JUL 1 2007),2333–2345.

[262] Hoelzl, R., Kraeling, T., Stephan, F., and Wu, G. Initial Segment Com-plexities of Randomness Notions. In THEORETICAL COMPUTER SCIENCE(2010), Calude, CS and Sassone, V, Ed., vol. 323 of IFIP Advances in Informationand Communication Technology, IFIP Tech Comm 1; IFIP WG 2 2; SIGACT;EATCS, pp. 259–270. 6th IFIP International Conference on Theoretical ComputerScience, Brisbane, AUSTRALIA, SEP 20-23, 2010.

[263] Hoelzl, R., Kraeling, T., Stephan, F., and Wu, G. Initial segment complex-ities of randomness notions. INFORMATION AND COMPUTATION 234 (FEB2014), 57–67.

[264] Hormoz, S. Quantum collapse and the second law of thermodynamics. PHYSI-CAL REVIEW E 87, 2 (FEB 20 2013).

[265] Hu, H., and Shi, Z. The neural circuits designing and analysis by the universalfuzzy logical framework. In FOURTH INTERNATIONAL CONFERENCE ONFUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 4, PROCEEDINGS(2007), Lei, JS and Yu, J and Zhou, SG, Ed., Hainan Univ; IEEE Reliabil Soc;Asia Pacific Neural Network Assembly, pp. 524–529. 4th International Conferenceon Fuzzy Systems and Knowledge Discovery, Haikou, PEOPLES R CHINA, AUG24-27, 2007.

[266] Hu, Y., Yang, Y., Katz, E., and Song, H. Programming the quorumsensing-based AND gate in Shewanella oneidensis for logic gated-microbial fuelcells. CHEMICAL COMMUNICATIONS 51, 20 (2015), 4184–4187.

[267] Hudelson, W. M. P. MASS PROBLEMS AND INITIAL SEGMENT COM-PLEXITY. JOURNAL OF SYMBOLIC LOGIC 79, 1 (MAR 2014), 20–44.

[268] HUHNE, M. ON THE POWER OF SEVERAL QUEUES. THEORETICALCOMPUTER SCIENCE 113, 1 (MAY 24 1993), 75–91. 8TH ANNUAL SYMP ONTHEORETICAL ASPECTS OF COMPUTER SCIENCE ( STACS 91 ), HAM-BURG, GERMANY, FEB 14-16, 1991.

[269] Hyde, J., Laschos, V., Olsen, L., Petrykiewicz, I., and Shaw, A. IteratedCesaro averages, frequencies of digits, and Baire category. ACTA ARITHMETICA144, 3 (2010), 287–293.

[270] Iancu, M., and Kohlhase, M. A Flexiformal Model of Knowledge Disseminationand Aggregation in Mathematics. In INTELLIGENT COMPUTER MATHEMAT-ICS, CICM 2015 (2015), Kerber, M and Carette, J and Kaliszyk, C and Rabe, Fand Sorge, V, Ed., vol. 9150 of Lecture Notes in Artificial Intelligence, pp. 137–152.International Conference on Intelligent Computer Mathematics (CICM), Washing-ton, DC, JUL 13-17, 2015.

[271] Ibarra, O. H. A Look Back at Some Early Results in Membrane Computing. InMEMBRANE COMPUTING (2010), Paun, G and Perez Jimenez, MJ and RiscosNunez, A and Rozenberg, G and Salomaa, A, Ed., vol. 5957 of Lecture Notes inComputer Science, Int Assoc Pattern Recognit; Informat Technol Ind Dev Agcy;

124

Microsoft Innovat Lab Cairo; Nile Univ; Univ Surrey; Univ Cagliari, pp. 66–73.10th International Workshop on Membrane Computing9th International Workshopon Multiple Classifier Systems, Natl Coll Valaicu Voda Curtea de Arges, Curteade Arges, ROMANIACairo, EGYPT, AUG 24-27, 2009APR 07-09, 2010.

[272] Ibrahim, Z., Tsuboi, Y., Muhammad, M., Ono, O., and Khalid, M. DNAimplementation of k-shortest paths computation. In 2005 IEEE CONGRESS ONEVOLUTIONARY COMPUTATION, VOLS 1-3, PROCEEDINGS (2005), IEEECongress on Evolutionary Computation, IEEE; IEEE Computat Intelligence Soc;IEE; Evolut Programming Soc, pp. 707–713. IEEE Congress on EvolutionaryComputation, Edinburgh, SCOTLAND, SEP 02-05, 2005.

[273] Ibrahim, Z., Tsuboi, Y., Ono, O., and Khalid, M. Experimental implemen-tation of direct-proportional length-based DNA computing for numerical optimiza-tion of the shortest path problem. INTERNATIONAL JOURNAL OF UNCON-VENTIONAL COMPUTING 3, 1 (2007), 15–34. 8th European Conference onArtificial Life, Canterbury, ENGLAND, SEP 05-09, 2005.

[274] Ilie, L. On lengths of words in context-free languages. THEORETICAL COM-PUTER SCIENCE 242, 1-2 (JUL 6 2000), 327–359.

[275] Ilie, L., Paun, G., Rozenberg, G., and Salomaa, A. On strongly context-free languages. DISCRETE APPLIED MATHEMATICS 103, 1-3 (JUL 15 2000),153–165.

[276] Ionescu, M., and Sburlan, D. P systems with adjoining controlled communi-cation rules. In Fundamentals of Computation Theory, Proceedings (2007), Csuha-jVarju, E and Esik, Z, Ed., vol. 4639 of LECTURE NOTES IN COMPUTER SCI-ENCE, Hungarian Acad Sci, Comp & Automat Res Inst; Univ Szeged, Inst CompSci, pp. 353–364. 16th International Symposium on Fundamentals of ComputationTheory, Budapest, HUNGARY, AUG 27-30, 2007.

[277] ISTRATE, G., and PAUN, G. SOME COMBINATORIAL PROPERTIES OFSELF-READING SEQUENCES. DISCRETE APPLIED MATHEMATICS 55, 1(OCT 28 1994), 83–86.

[278] Joosten, J. J. Complexity, Universality and Intermediate Degrees. In NUMER-ICAL ANALYSIS AND APPLIED MATHEMATICS (ICNAAM 2012), VOLS AAND B (2012), Simos, TE and Psihoyios, G and Tsitouras, C and Anastassi,Z, Ed., vol. 1479 of AIP Conference Proceedings, European Soc Computat Meth-ods Sci, Engn & Technol (ESCMSET); R M Santilli Fdn, pp. 638–641. Interna-tional Conference of Numerical Analysis and Applied Mathematics (ICNAAM),Kos, GREECE, SEP 19-25, 2012.

[279] Juergensen, H. Complexity, information, energy. INTERNATIONAL JOUR-NAL OF FOUNDATIONS OF COMPUTER SCIENCE 19, 4 (AUG 2008), 781–793. 9th International Workshop on Descriptional Complexity of Formal Systems,Novy Smokovec, SLOVAKIA, JUL 20-22, 2007.

[280] Juergensen, H., and Matthews, D. E. Entropy and Higher Moments ofInformation. JOURNAL OF UNIVERSAL COMPUTER SCIENCE 16, 5 (2010),749–794.

125

[281] JURGENSEN, H., and STAIGER, L. LOCAL HAUSDORFF DIMENSION.ACTA INFORMATICA 32, 5 (AUG 1995), 491–507.

[282] Kari, L., Konstantinidis, S., and Sosik, P. On properties of bond-free DNAlanguages. THEORETICAL COMPUTER SCIENCE 334, 1-3 (APR 11 2005),131–159.

[283] Katz, E. Processing electrochemical signals at both sides of interface: electronicvs. chemical signal processing. JOURNAL OF SOLID STATE ELECTROCHEM-ISTRY 15, 7-8 (JUL 2011), 1471–1480.

[284] Katz, E. Biomolecular Information Processing: From Boolean Logic Gates toComplex Networked Systems INTRODUCTION. INTERNATIONAL JOURNALOF UNCONVENTIONAL COMPUTING 8, 5-6, SI (2012), 339–346.

[285] Katz, E. Biocomputing - tools, aims, perspectives. CURRENT OPINION INBIOTECHNOLOGY 34 (AUG 2015), 202–208.

[286] Katz, E., Bocharova, V., and Privman, M. Electronic interfaces switchableby logically processed multiple biochemical and physiological signals. JOURNALOF MATERIALS CHEMISTRY 22, 17 (2012), 8171–8178.

[287] Katz, E., and Gueven, A. Multi-Signal Processing Biosensors and Bioac-tuators Based on Biocomputing Concept. In NANOANTENNA: PLASMON-ENHANCED SPECTROSCOPIES FOR BIOTECHNOLOGICAL APPLICA-TIONS, DeLaChapelle, ML and Pucci, A, Ed., vol. 1 of Pan Stanford Series onthe High-Tech of Biotechnology. 2013, pp. 387–405.

[288] Katz, E., and Minko, S. Enzyme-based logic systems interfaced with signal-responsive materials and electrodes. CHEMICAL COMMUNICATIONS 51, 17(2015), 3493–3500.

[289] Katz, E., Minko, S., Halamek, J., MacVittie, K., and Yancey, K. Elec-trode interfaces switchable by physical and chemical signals for biosensing, biofuel,and biocomputing applications. ANALYTICAL AND BIOANALYTICAL CHEM-ISTRY 405, 11 (APR 2013), 3659–3672.

[290] Katz, E., and Privman, V. Enzyme-based logic systems for information pro-cessing. CHEMICAL SOCIETY REVIEWS 39, 5 (2010), 1835–1857.

[291] Katz, E., Wang, J., Privman, M., and Halamek, J. Multianalyte DigitalEnzyme Biosensors with Built-in Boolean Logic. ANALYTICAL CHEMISTRY 84,13 (JUL 3 2012), 5463–5469.

[292] Kelarev, A. An algorithm for BCH codes extended with finite state automata.FUNDAMENTA INFORMATICAE 84, 1 (2008), 51–60. 17th Australian Work-shop on Combinatorial Algorithms, Uluru, AUSTRALIA, JUL 13-19, 2006.

[293] Khan, M. S., Kulathuramaiyer, N., and Maurer, H. Applications of mash-ups for a digital journal. JOURNAL OF UNIVERSAL COMPUTER SCIENCE14, 10 (2008), 1695–1716.

[294] Khoussainov, B. Randomness, computability, and algebraic specifications. AN-NALS OF PURE AND APPLIED LOGIC 91, 1 (JAN 12 1998), 1–15.

126

[295] Khoussainov, B., Semukhin, P., and Stephan, F. Applications of Kol-mogorov complexity to computable model theory. JOURNAL OF SYMBOLICLOGIC 72, 3 (SEP 2007), 1041–1054.

[296] Kieu, T. An anatomy of a quantum adiabatic algorithm that transcends the Tur-ing computability. INTERNATIONAL JOURNAL OF QUANTUM INFORMA-TION 3, 1 (MAR 2005), 177–182. International Meeting on Quantum InformationScience, Univ Camerino, Camerino, ITALY, APR 16-19, 2004.

[297] Kihara, T., and Miyabe, K. Unified characterizations of lowness propertiesvia Kolmogorov complexity. ARCHIVE FOR MATHEMATICAL LOGIC 54, 3-4(MAY 2015), 329–358.

[298] Kjos-Hanssen, B., Merkle, W., and Stephan, F. KOLMOGOROV COM-PLEXITY AND THE RECURSION THEOREM. TRANSACTIONS OF THEAMERICAN MATHEMATICAL SOCIETY 363, 10 (OCT 2011), 5465–5480.

[299] Kleijn, J., and Koutny, M. Processes of membrane systems with promoters andinhibitors. THEORETICAL COMPUTER SCIENCE 404, 1-2 (SEP 6 2008), 112–126. 33rd International Colloquium on Automata, Languages and Programming,Venice, ITALY, JUL 10-14, 2006.

[300] Kleijn, J., and Koutny, M. Petri Nets with Localities and Testing. In APPLI-CATIONS AND THEORY OF PETRI NETS, PROCEEDINGS (2010), Lilius, Jand Penczek, W, Ed., vol. 6128 of Lecture Notes in Computer Science, Inst Poly-tecn Beja, pp. 19–38. 31st International Conference on Applications and Theoryof Petri Nets and Other Models of Concurrency, Univ Minho, Sch Engn, Braga,PORTUGAL, JUN 21-25, 2010.

[301] KNOEBEL, R. EXPONENTIALS REITERATED. AMERICAN MATHEMAT-ICAL MONTHLY 88, 4 (1981), 235–252.

[302] Koh, D. E., Hall, M. J. W., Setiawan, Pope, J. E., Marletto, C., Kay,A., Scarani, V., and Ekert, A. Effects of Reduced Measurement Independenceon Bell-Based Randomness Expansion. PHYSICAL REVIEW LETTERS 109, 16(OCT 18 2012).

[303] Kojman, M., Lee, G., Omri, E., and Weiermann, A. Sharp thresholds for thephase transition between primitive recursive and Ackermannian Ramsey numbers.JOURNAL OF COMBINATORIAL THEORY SERIES A 115, 6 (AUG 2008),1036–1055.

[304] Kojman, M., and Shelah, S. Regressive Ramsey numbers are Ackermannian.JOURNAL OF COMBINATORIAL THEORY SERIES A 86, 1 (APR 1999), 177–181.

[305] Konstantinidis, S., and Silva, P. V. Computing Maximal Error-detectingCapabilities and Distances of Regular Languages. FUNDAMENTA INFORMAT-ICAE 101, 4 (2010), 257–270.

[306] Kramosil, I. Searching algorithms implemented on probabilistic systolic arrays.INTERNATIONAL JOURNAL OF GENERAL SYSTEMS 25, 1 (1996), 7–45.

127

[307] KRAMOSIL, I., and SINDELAR, J. ON PSEUDO RANDOM SEQUENCESAND THEIR RELATION TO A CLASS OF STOCHASTICAL LAWS. KYBER-NETIKA 28, 5 (1992), 383–391.

[308] Krishna, S., and Rama, R. On the power of tissue P systems working in theminimal mode. In UNCONVENTIONAL MODELS IN COMPUTATION, PRO-CEEDINGS (2002), Calude, C and Dinneen, MJ and Peper, F, Ed., vol. 2509 ofLECTURE NOTES IN COMPUTER SCIENCE, Ctr Discrete Math & TheoretComp Sci; Adv Res Ctr Commun Res Lab, pp. 208–219. 3rd International Con-ference on Unconventional Models of Computation, KOBE, JAPAN, OCT 15-19,2002.

[309] Kucera, A., and Slaman, T. Randomness and recursive enumerability. SIAMJOURNAL ON COMPUTING 31, 1 (JUL 29 2001), 199–211.

[310] Kulkarni, A., Kim, B., Dugasani, S. R., Joshirao, P., Kim, J. A., Vyas,C., Manchanda, V., Kim, T., and Park, S. H. A novel nanometric DNA thinfilm as a sensor for alpha radiation. SCIENTIFIC REPORTS 3 (JUN 24 2013).

[311] Kummer, M. Kolmogorov complexity and instance complexity of recursively enu-merable sets. SIAM JOURNAL ON COMPUTING 25, 6 (DEC 1996), 1123–1143.

[312] Kuppusamy, L., Mahendran, A., and Krithivasan, K. ON THE AMBIGU-ITY OF INSERTION SYSTEMS. INTERNATIONAL JOURNAL OF FOUNDA-TIONS OF COMPUTER SCIENCE 22, 7, SI (NOV 2011), 1747–1758.

[313] Kuzaev, G., and Lebedeva, T. New logic components for processing complexmeasurement data. MEASUREMENT TECHNIQUES 43, 12 (DEC 2000), 1070–1073.

[314] Latif, A., Afzal, M. T., and Maurer, H. Weaving Scholarly Legacy Datainto Web of Data. JOURNAL OF UNIVERSAL COMPUTER SCIENCE 18, 16(2012), 2301–2318.

[315] Latkowski, R. Application of data decomposition to incomplete informationsystems. In INTELLIGENT INFORMATION SYSTEMS 2002, PROCEEDINGS(2002), Klopotek, MA and Wierzchon, ST and Michalewicz, M, Ed., ADVANCESIN SOFT COMPUTING, Polish Acad Sci, Inst Comp Sci, pp. 321–330. Symposiumon Intelligent Information Systems (IIS 2002), SOPOT, POLAND, JUN 03-06,2002.

[316] Lattimore, T., and Hutter, M. On Martin-Lof (non-)convergence ofSolomonoff’s universal mixture. THEORETICAL COMPUTER SCIENCE 588(JUL 11 2015), 2–15.

[317] Lecue, F., Delteil, A., and Leger, A. Towards the Composition of Statefuland Independent Semantic Web Services. In APPLIED COMPUTING 2008, VOLS1-3 (2008), ACM SIGAC; Univ Fortaleza; Federal Univ Ceara, pp. 2279–2285. 23rdAnnual ACM Symposium on Applied Computing, Fortaleza, BRAZIL, MAR 16-20,2008.

128

[318] Legg, S. Is there an elegant universal theory of prediction? In ALGORITHMICLEARNING THEORY, PROCEEDINGS (2006), Balcazar, JL and Long, PM andStephan, F, Ed., vol. 4264 of LECTURE NOTES IN ARTIFICIAL INTELLI-GENCE, Spanish Minist Sci; Google; Pascal Network Excellence; PASCAL Dia-logues 2006; Univ Politecn Calalunya; Idescat, Stat Inst Catalonia; Univ Lubeck,Inst Theoret Informatik; Hokkaido Univ, Div Comp Sci, pp. 274–287. 17th In-ternational Conference on Algorithmic Learning Theory (ALT 2006), Barcelona,SPAIN, OCT 07-10, 2006.

[319] Legg, S., and Hutter, M. Universal intelligence: A definition of machineintelligence. MINDS AND MACHINES 17, 4 (DEC 2007), 391–444.

[320] LENNON, J., and MAURER, H. APPLICATIONS OF HYPERMEDIA SYS-TEMS. PROGRAMMING AND COMPUTER SOFTWARE 21, 3 (MAY-JUN1995), 121–134.

[321] Lesniak, K. ON DISCRETE STOCHASTIC PROCESSES WITH DISJUNC-TIVE OUTCOMES. BULLETIN OF THE AUSTRALIAN MATHEMATICALSOCIETY 90, 1 (AUG 2014), 149–159.

[322] Lesniak, K. Random iteration for infinite nonexpansive iterated function systems.CHAOS 25, 8 (AUG 2015).

[323] Lewis, A. E. M., and Barmpalias, G. Random reals and Lipschitz continu-ity. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE 16, 5 (OCT2006), 737–749. 1st Conference on Computability in Europe - New ComputationalParadigms, Univ Amsterdam, Amsterdam, NETHERLANDS, JUN, 2005.

[324] Lewis, A. E. M., and Barmpalias, G. Randomness and the linear degrees ofcomputability. ANNALS OF PURE AND APPLIED LOGIC 145, 3 (MAR 2007),252–257.

[325] Li, C.-C. Speed-up theorems in type-2 computation. In Computation and Logicin the Real World, Proceedings (2007), Cooper, SB and Lowe, B and Sorbi, A,Ed., vol. 4497 of LECTURE NOTES IN COMPUTER SCIENCE, Dept Math &Comp Sci Roberto Magari; Fondazione Monte Paschi Siena; Ist Nazl Alta Matemat;Gruppo Nazl Strutture Algebriche; INDAM GNSAGA; Univ Siena; Assoc ItalianaLog & Applicazioni; Assoc Symbol Log; European Assoc Comp Sci Log; EuropeanAssoc Theoret Comp Sci; Assoc Log, Language & Informat; Comm Status WomenComp Res, pp. 478–487. 3rd Conference on Computability in Europe (CiE 2007),Siena, ITALY, JUN 18-23, 2007.

[326] Li, C.-C. Speed-Up Theorems in Type-2 Computations Using Oracle Turing Ma-chines. THEORY OF COMPUTING SYSTEMS 45, 4 (NOV 2009), 880–896. 3rdComputability in Europe Conference 2007, Univ Siena, Siena, ITALY, 2007.

[327] Li, L., and Qiu, D. On the State Minimization of Fuzzy Automata. IEEETRANSACTIONS ON FUZZY SYSTEMS 23, 2 (APR 2015), 434–443.

[328] Liu, C. Generalization of complexity oscillations in infinite sequences. In ICNC2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPU-TATION, VOL 1, PROCEEDINGS (2008), Guo, MZ and Zhao, L and Wang, LP,

129

Ed., Int Nat Computat & Knowledge Discovery Assoc; Shandong Univ, pp. 299–303. 4th International Conference on Natural Computation (ICNC 2008), Jian,PEOPLES R CHINA, OCT 18-20, 2008.

[329] Liu, C. The quasi-equivalence between the definitions of partial randomness.In ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURALCOMPUTATION, VOL 1, PROCEEDINGS (2008), Guo, MZ and Zhao, L andWang, LP, Ed., Int Nat Computat & Knowledge Discovery Assoc; Shandong Univ,pp. 371–375. 4th International Conference on Natural Computation (ICNC 2008),Jian, PEOPLES R CHINA, OCT 18-20, 2008.

[330] Liu, X., Matsikoudis, E., and Lee, E. A. Modeling timed concurrent systems.In CONCUR 2006 - CONCURRENCY THEORY, PROCEEDINGS (2006), Baier,C and Hermanns, H, Ed., vol. 4137 of Lecture Notes in Computer Science, pp. 1–15.17th International Conference on Concurrency Theory, Bonn, GERMANY, AUG27-30, 2006.

[331] Lloyd, S. A Turing test for free will. PHILOSOPHICAL TRANSACTIONS OFTHE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEER-ING SCIENCES 370, 1971, SI (JUL 28 2012), 3597–3610.

[332] Longo, G. Incomputability in Physics. In PROGRAMS, PROOFS, PROCESSES(2010), Ferreira, F and Lowe, B and Mayordomo, E and Gomes, LM, Ed., vol. 6158of Lecture Notes in Computer Science, pp. 276–285. 6th Conference on Computabil-ity in Europe (CiE 2010), Univ Azores, Ponta Delgada, PORTUGAL, JUN 30-JUL04, 2010.

[333] Longo, G. Incomputability in Physics and Biology. MATHEMATICAL STRUC-TURES IN COMPUTER SCIENCE 22, 5, SI (OCT 2012), 880–900.

[334] Longo, G., Miquel, P.-A., Sonnenschein, C., and Soto, A. M. Is infor-mation a proper observable for biological organization? PROGRESS IN BIO-PHYSICS & MOLECULAR BIOLOGY 109, 3 (AUG 2012), 108–114.

[335] Luo, L. The future of lattice-gas and lattice Boltzmann methods. In COMPU-TATIONAL AEROSCIENCES IN THE 21ST CENTURY (2000), Salas, MD andAnderson, WK, Ed., vol. 8 of ICASE/LARC INTERDISCIPLINARY SERIES INSCIENCE AND ENGINEERING, Inst Comp Applicat Sci & Engn; NASA Lang-ley Res Ctr; Natl Sci Fdn; USA, Off Res, pp. 165–187. ICAS/LaRC/NSF/AROWorkshop on Computational Aerosciences in the 21st Century, HAMPTON, VA,APR 22-24, 1998.

[336] Lupacchini, R. Proof as a path of light. In DEDUCTION, COMPUTATION,EXPERIMENT: EXPLORING THE EFFECTIVENESS OF PROOF (2008), Lu-pacchini, R and Corsi, G, Ed., Univ Bologna, pp. 195–221. Workshop on Deduc-tion, Computation, Experiment - Exploring the Effectiveness of Proof‘, Bologna,ITALY, APR 03-04, 2007.

[337] Lupacchini, R., and Tamburrini, G. Grounding effective processes in empiricallaws: introductory remarks. In GROUNDING EFFECTIVE PROCESSES IN EM-PIRICAL LAWS: REFLECTIONS ON THE NOTION OF ALGORITHM (1999),Lupacchini, R and Tamburrini, G, Ed., Comune Cesena; F Enriques Ctr; ELSAG,

130

pp. 9–21. Workshop on Symbols, Physical Processes, Biological Processes-RecentExplorations of the Notion of Algorithm, CESENA, ITALY, FEB 16, 1999.

[338] MacVittie, K., Halamek, J., and Katz, E. Enzyme-based D-flip-flop memorysystem. CHEMICAL COMMUNICATIONS 48, 96 (2012), 11742–11744.

[339] MacVittie, K., Halamek, J., and Katz, E. Enzyme-Based T-Flip-Flop Mem-ory System. INTERNATIONAL JOURNAL OF UNCONVENTIONAL COM-PUTING 8, 5-6, SI (2012), 383–389.

[340] MacVittie, K., and Katz, E. Electrochemical System with MemimpedanceProperties. JOURNAL OF PHYSICAL CHEMISTRY C 117, 47 (NOV 28 2013),24943–24947.

[341] MacVittie, K., and Katz, E. Biochemical flip-flop memory systems: essen-tial additions to autonomous biocomputing and biosensing systems. INTERNA-TIONAL JOURNAL OF GENERAL SYSTEMS 43, 7, SI (2014), 722–739.

[342] MacVittie, K., and Katz, E. Self-powered electrochemical memristor based ona biofuel cell - towards memristors integrated with biocomputing systems. CHEM-ICAL COMMUNICATIONS 50, 37 (2014), 4816–4819.

[343] Mailloux, S., Gerasimova, Y. V., Guz, N., Kolpashchikov, D. M., andKatz, E. Bridging the Two Worlds: A Universal Interface between Enzymaticand DNA Computing Systems. ANGEWANDTE CHEMIE-INTERNATIONALEDITION 54, 22 (MAY 26 2015), 6562–6566.

[344] Maldonado, C. E., and Gomez Cruz, N. A. Biological Hypercomputation: ANew Research Problem in Complexity Theory. COMPLEXITY 20, 4 (MAR-APR2015), 8–18.

[345] Malescio, G. Predicting with unpredictability. NATURE 434, 7037 (APR 282005), 1073.

[346] Manca, V., Martin-Vide, C., and Paun, G. New computing paradigms sug-gested by DNA computing: computing by carving. BIOSYSTEMS 52, 1-3 (OCT1999), 47–54. 4th International Meeting on DNA Based Computers, UNIV PENN-SYLVANIA, PHILADELPHIA, PENNSYLVANIA, JUN 15-19, 1998.

[347] MANDOIU, I. ON A THEOREM OF GACS. INTERNATIONAL JOURNALOF COMPUTER MATHEMATICS 48, 3-4 (1993), 157–169.

[348] Mandoiu, I. Optimum extensions of prefix codes. INFORMATION PROCESS-ING LETTERS 66, 1 (APR 15 1998), 35–40.

[349] Manin, Y. I. Infinities in Quantum Field Theory and in Classical Computing:Renormalization Program. In PROGRAMS, PROOFS, PROCESSES (2010), Fer-reira, F and Lowe, B and Mayordomo, E and Gomes, LM, Ed., vol. 6158 of LectureNotes in Computer Science, pp. 307–316. 6th Conference on Computability inEurope (CiE 2010), Univ Azores, Ponta Delgada, PORTUGAL, JUN 30-JUL 04,2010.

131

[350] Manin, Y. I. Renormalisation and computation II: time cut-off and the HaltingProblem. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE 22, 5,SI (OCT 2012), 729–751.

[351] Manin, Y. I. Complexity vs energy: theory of computation and theoreti-cal physics. In 3QUANTUM: ALGEBRA GEOMETRY INFORMATION (QQQCONFERENCE 2012) (2014), vol. 532 of Journal of Physics Conference Series,ITGP N W ESF; AGMP. Conference on 3Quantum - Algebra Geometry Informa-tion (QQQ), Tallinn Univ Technol, Tallinn, ESTONIA, JUL 10-13, 2012.

[352] Manin, Y. I. Zipf’s law and L. Levin probability distributions. FUNCTIONALANALYSIS AND ITS APPLICATIONS 48, 2 (APR 2014), 116–127.

[353] Marcus, S. Bridging two hierarchies of infinite words. JOURNAL OF UNIVER-SAL COMPUTER SCIENCE 8, 2 (2002), 292–296.

[354] Marcus, S. Proofs and mistakes: Their syntactics, semantics, and pragmatics.SEMIOTICA 188, 1-4, SI (2012), 139–155.

[355] Maroosi, A., and Muniyandi, R. C. Enhancement of membrane computingmodel implementation on GPU by introducing matrix representation for balancingoccupancy and reducing inter-block communications. JOURNAL OF COMPUTA-TIONAL SCIENCE 5, 6, SI (NOV 2014), 861–871.

[356] Martin-Delgado, M. A. On Quantum Effects in a Theory of Biological Evolu-tion. SCIENTIFIC REPORTS 2 (MAR 12 2012).

[357] Martin-Delgado, M.-A. ALAN TURING AND THE ORIGINS OF COM-PLEXITY. ARBOR-CIENCIA PENSAMIENTO Y CULTURA 189, 764 (2013).

[358] Marzlin, K.-P., and Landry, T. On the connection between the theorems ofGleason and of Kochen and Specker. CANADIAN JOURNAL OF PHYSICS 93,12 (DEC 2015), 1446–1452.

[359] Mateescu, A., Paun, G., Rozenberg, G., and Salomaa, A. Characteriza-tions of RE languages starting from internal contextual languages. INTERNA-TIONAL JOURNAL OF COMPUTER MATHEMATICS 66, 3-4 (1998), 179–197.

[360] Matsueda, H. Coherent modes in an ensemble of quantum dots generated bydynamic dipole-dipole interactions. SUPERLATTICES AND MICROSTRUC-TURES 24, 6 (1998), 423–433.

[361] Matsueda, H. Spatiotemporal dynamics of quantum computing dipole-dipoleblock systems. CHAOS SOLITONS & FRACTALS 10, 10 (OCT 1999), 1737–1748.

[362] Matsueda, H., and Cohen, D. Quantum logical diagram of quantum computingevolution. In QUANTUM COHERENCE AND DECOHERENCE (1999), Ono,YA and Fujikawa, K, Ed., NORTH-HOLLAND DELTA SERIES, Phys Soc Japan;Japan Soc Appl Phys; Adv Res Lab, Hitachi Ltd, pp. 37–40. 6th InternationalSymposium on Foundations of Quantum Mechanics in the Light of New Technology(ISQM-Tokyo 98), ADV RES LAB, HITACHI LTD, HATOYAMA, JAPAN, AUG24-27, 1998.

132

[363] Matvejchuk, M., and Utkina, E. Kochen-Specker Theorem in Krein Space.INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS 53, 10 (OCT2014), 3658–3665.

[364] Maurer, H. Hypermedia systems as Internet tools. In COMPUTER SCI-ENCE TODAY, vol. 1000 of LECTURE NOTES IN COMPUTER SCIENCE.1995, pp. 608–624.

[365] Merkle, W., and Mihailovic, N. On the construction of effective random sets.In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002 (2002),Diks, K and Rytter, W, Ed., vol. 2420 of LECTURE NOTES IN COMPUTERSCIENCE, Warsaw Univ, Inst Informat; Fdn Informat Technol Dev, pp. 568–580.27th International Symposium on Mathematical Foundations of Computer Science,WARSAW, POLAND, AUG 26-30, 2002.

[366] Merkle, W., Mihailovic, N., and Slaman, T. A. Some results on effectiverandomness. THEORY OF COMPUTING SYSTEMS 39, 5 (SEP 2006), 707–721.

[367] Messner, J., and Thierauf, T. A Kolmogorov complexity proof of the Lo-vasz Local Lemma for satisfiability. THEORETICAL COMPUTER SCIENCE461 (NOV 23 2012), 55–64. 17th International Computing and CombinatoricsConference (COCOON), Dallas, TX, AUG 14-16, 2011.

[368] Meyer, T., Schreckling, D., Tschudin, C., and Yamamoto, L. Robust-ness to Code and Data Deletion in Autocatalytic Quines. In TRANSACTIONSON COMPUTATIONAL SYSTEMS BIOLOGY X (2008), Priami, C and Akan,OB and Dressler, F and Ngom, A, Ed., vol. 5410 of Lecture Notes in ComputerScience, pp. 20–40. 2nd International Conference on Bio-Inspired Models of Net-work, Information and Computing Systems, Budapest, HUNGARY, DEC 10-13,2007.

[369] Meyer, T., and Tschudin, C. Robust Network Services with Distributed CodeRewriting. In BIOLOGICALLY INSPIRED NETWORKING AND SENSING:ALGORITHMS AND ARCHITECTURES. 2012, pp. 36–57.

[370] Meyer, T., Yamamoto, L., and Tschudin, C. An Artificial Chemistry for Net-working. In BIO-INSPIRED COMPUTING AND COMMUNICATION (2008),Lio, P and Yoneki, E and Verma, DC, Ed., vol. 5151 of Lecture Notes in ComputerScience, pp. 45–57. 1st Workshop on Bio-Inspired Design of Networks, Cambridge,ENGLAND, APR 02-05, 2007.

[371] Mieszkowicz-Rolka, A., and Rolka, L. Determining significance of attributesin the unified rough set approach. In Rough Sets, Fuzzy Sets, Data Mining andGranular Computing, Proceedings (2007), An, A and Stefanowski, J and Ramanna,S and Butz, CJ and Pedrycz, W and Wang, G, Ed., vol. 4482 of LECTURENOTES IN ARTIFICIAL INTELLIGENCE, Infobright Inc; MaRS Discovery Dist;York Univ; Int Rough Set Soc; Int Fuzzy Syst Assoc; Chinese Assoc ArtificialIntelligence, Rough Sets & Soft Computat Soc; Natl Res Council Canada, pp. 71–78. 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining andGranular Computing (RSFDGrC 2007), Toronto, CANADA, MAY 14-16, 2007.

133

[372] Miller, J. S., and Nies, A. Randomness and computability: Open questions.BULLETIN OF SYMBOLIC LOGIC 12, 3 (SEP 2006), 390–410.

[373] Miranda, E. R. Harnessing the Intelligence of Physarum Polycephalum for Un-conventional Computing-Aided Musical Composition. INTERNATIONAL JOUR-NAL OF UNCONVENTIONAL COMPUTING 10, 3, SI (2014), 251–268.

[374] Miranda, E. R., Adamatzky, A., and Jones, J. Sounds Synthesis with SlimeMould of Physarum Polycephalum. JOURNAL OF BIONIC ENGINEERING 8,2 (JUN 2011), 107–113.

[375] Miranda, E. R., Bull, L., Gueguen, F., and Uroukov, I. S. ComputerMusic Meets Unconventional Computing: Towards Sound Synthesis with In VitroNeuronal Networks. COMPUTER MUSIC JOURNAL 33, 1 (SPR 2009), 9–18.

[376] Miszczak, J. A. Generating and using truly random quantum states in Mathe-matica. COMPUTER PHYSICS COMMUNICATIONS 183, 1 (JAN 2012), 118–124.

[377] Mitchell, M. W., Abellan, C., and Amaya, W. Strong experimental guar-antees in ultrafast quantum random number generation. PHYSICAL REVIEW A91, 1 (JAN 12 2015).

[378] Miyabe, K. The difference between optimality and universality. LOGIC JOUR-NAL OF THE IGPL 20, 1 (FEB 2012), 222–234.

[379] Miyamoto, S. Bags, Toll Sets, and Fuzzy Sets. In INTEGRATED UN-CERTAINTY MANAGEMENT AND APPLICATIONS (2010), Huynh, VN andNakamori, Y and Lawry, J and Inuiguchi, M, Ed., vol. 68 of Advances in Intelligentand Soft Computing, pp. 307–317. International Symposium on Integrated Uncer-tainty Management and Applications, Japan Adv Inst Sci & Technol, Ishikawa,JAPAN, APR 09-11, 2010.

[380] Miyamoto, S. Different generalizations of bags. ANNALS OF OPERATIONSRESEARCH 195, 1 (MAY 2012), 221–236.

[381] Miyamoto, S., and Mizutani, K. Fuzzy multiset space and c-means clusteringusing kernels with application to information retrieval. In FUZZY SETS ANDSYSTEMS - IFSA 2003, PROCEEDINGS (2003), Bilgic, T and DeBaets, B andKaynak, O, Ed., vol. 2715 of LECTURE NOTES IN ARTIFICIAL INTELLI-GENCE, Bogazici Univ Fdn; Turkish Sci & Tech Res Council, pp. 387–395. 10thInternational-Fuzzy-Systems-Association World Congress, ISTANBUL, TURKEY,JUN 30-JUL 02, 2003.

[382] Moseley, F., Halamek, J., Kramer, F., Poghossian, A., Schoening,M. J., and Katz, E. An enzyme-based reversible CNOT logic gate realizedin a flow system. ANALYST 139, 8 (2014), 1839–1842.

[383] MOSS, G. NEW INFORMATION TECHNOLOGIES IN HIGHER-EDUCATION- CALUDE,C, CHITORAN,D, MALITZA,M. HIGHER EDUCATION 21, 2 (MAR1991), 271.

134

[384] Muller, S. Asymmetry: The Foundation of Information. In ASYMMETRY:THE FOUNDATION OF INFORMATION, Frontiers Collection. 2007, pp. 1–165.

[385] Murphy, N., Naughton, T. J., Woods, D., Henley, B., McDermott, K.,Duffy, E., van der Burgt, P. J. M., and Woods, N. Implementations ofa model of physical sorting. INTERNATIONAL JOURNAL OF UNCONVEN-TIONAL COMPUTING 4, 1 (2008), 3–12.

[386] NADIN, M. INTERFACE DESIGN - A SEMIOTIC PARADIGM. SEMIOTICA69, 3-4 (1988), 269–302.

[387] Nagy, B., and Valyi, S. A Characterization of NP Within Interval-Valued Com-puting. In MACHINES, COMPUTATIONS, AND UNIVERSALITY, MCU 2015(2015), DurandLose, J and Nagy, B, Ed., vol. 9288 of Lecture Notes in ComputerScience, Eastern Mediterranean Univ, pp. 164–179. 7th International Conferenceon Machines, Computations and Universality (MCU), Famagusta, CYPRUS, SEP09-11, 2015.

[388] Narimani, H., and Khosravifard, M. The Supertree of the Compact Codes. In2008 INTERNATIONAL SYMPOSIUM ON TELECOMMUNICATIONS, VOLS1 AND 2 (2008), pp. 649–655. International Symposium on Telecommunications,Tehran, IRAN, AUG 27-28, 2008.

[389] Nayebi, A. Practical Intractability: A Critique of the Hypercomputation Move-ment. MINDS AND MACHINES 24, 3 (AUG 2014), 275–305.

[390] Nehaniv, C. L., Rhodes, J., Egri-Nagy, A., Dini, P., Morris, E. R.,Horvath, G., Karimi, F., Schreckling, D., and Schilstra, M. J. Sym-metry structure in discrete models of biochemical systems: natural subsystemsand the weak control hierarchy in a new model of computation driven by in-teractions. PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETYA-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES 373, 2046(JUL 28 2015).

[391] Ng, T., Rappaport, D., and Salomaa, K. State Complexity of Neigh-bourhoods and Approximate Pattern Matching. In DEVELOPMENTS IN LAN-GUAGE THEORY (DLT 2015) (2015), Potapov, I, Ed., vol. 9168 of Lecture Notesin Computer Science, Univ Liverpool, pp. 389–400. 19th International Conferenceon Developments in Language Theory (DLT), Liverpool, ENGLAND, JUL 27-30,2015.

[392] Niculiu, T., Copilau, A., Lupu, C., and Manolescu, A. HIERARCHICALINTELLIGENT ANALOG SIMULATION. In EMSS 2008: 20TH EUROPEANMODELING AND SIMULATION SYMPOSIUM (2008), Bruzzone, A and Longo,F and Piera, MA and Aguilar, RM and Frydman, C, Ed., Univ Calabria, MechDept; MSC-LES Modelin and Simulat Ctr, Lab Enterprise Solut; Univ Genoa,DIPTEM; Liophant Simulat; IEEE; Soc Comp Simulat Int; McLeod Inst SimulaSci; Modeling & Simulat Network; Int Mediterranean and Latin Amer CouncilSimulat; Auton Univ Barcelona; Univ La Laguna; Management & Adv Solut &Technol; Tonno Callipo; Liquiriszie Amarelli; Giulio Barca Prodotti Pelle, pp. 323–332. 20th European Modeling and Simulation Symposium, Amantea, ITALY, SEP17-19, 2008.

135

[393] Niculiu, T.-R., and Niculiu, M. CONSCIENTIOUSLY LOOKING FOR CON-SCIENCE. EUROPEAN JOURNAL OF SCIENCE AND THEOLOGY 9, 3 (JUN2013), 15–28.

[394] Nolte, D., and Priese, L. Abstract fairness and semantics. THEORETICALCOMPUTER SCIENCE 177, 1 (APR 30 1997), 139–153. 10th Conference on theMathematical Foundations of Programming Semantics, KANSAS STATE UNIV,LAWRENCE, KS, MAR, 1994.

[395] Nowicki, R. Rough Neuro-Fuzzy Structures for Classification With Missing Data.IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS 39, 6 (DEC 2009), 1334–1347.

[396] Nugent, M. A., Porter, R., and Kenyon, G. T. Reliable computing withunreliable components: Using separable environments to stabilize long-term infor-mation storage. PHYSICA D-NONLINEAR PHENOMENA 237, 9 (JUL 1 2008),1196–1206.

[397] Nunes de Castro, L. Fundamentals of natural computing: an overview.PHYSICS OF LIFE REVIEWS 4, 1 (MAR 2007), 1–36.

[398] Okubo, F. REACTION AUTOMATA WORKING IN SEQUENTIAL MAN-NER. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS 48, 1(JAN 2014), 23–38.

[399] Okubo, F., Kobayashi, S., and Yokomori, T. On the properties of languageclasses defined by bounded reaction automata. THEORETICAL COMPUTERSCIENCE 454 (OCT 5 2012), 206–221.

[400] Okubo, F., Kobayashi, S., and Yokomori, T. Reaction automata. THEO-RETICAL COMPUTER SCIENCE 429 (APR 20 2012), 247–257.

[401] Okubo, F., and Yokomori, T. Finite Automata with Multiset Memory: A NewCharacterization of Chomsky Hierarchy. FUNDAMENTA INFORMATICAE 138,1-2, SI (2015), 31–44.

[402] Omri, E., and Weiermann, A. Classifying the phase transition threshold forAckermannian functions. ANNALS OF PURE AND APPLIED LOGIC 158, 3(APR 2009), 156–162. 3rd International Conference on Methods of Logic in Math-ematics, Euler Inst, St Petersburg, RUSSIA, JUN 01-07, 2006.

[403] Palmer, T. N., and O’Shea, M. Solving difficult problems creatively: a rolefor energy optimised deterministic/stochastic hybrid computing. FRONTIERS INCOMPUTATIONAL NEUROSCIENCE 9 (OCT 12 2015).

[404] Panu, G. Spiking Neural P Systems. A Quick Survey and Some Research Topics.In 16TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND NUMERICALGORITHMS FOR SCIENTIFIC COMPUTING (SYNASC 2014) (2014), Win-kler, F and Negru, V and Ida, T and Jebelean, T and Petcu, D and Watt, S andZaharie, D, Ed., IEEE; IEEE Comp Soc, pp. 20–25. 16th International Sympo-sium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC),Timisoara, ROMANIA, SEP 22-25, 2014.

136

[405] Paterek, T., Kofler, J., Prevedel, R., Klimek, P., Aspelmeyer, M.,Zeilinger, A., and Brukner, C. Logical independence and quantum random-ness. NEW JOURNAL OF PHYSICS 12 (JAN 20 2010).

[406] Paun, G. Distributed architectures in DNA computing based on splicing: Lim-iting the size of components. In UNCONVENTIONAL MODELS OF COMPU-TATION (1998), Calude, CS and Casti, J and Dinneen, MJ, Ed., SPRINGERSERIES IN DISCRETE MATHEMATICS AND THEORETICAL COMPUTERSCIENCE, Univ Auckland; Ctr Discrete Math & Theoret Comp Sci; Santa Fe Inst,pp. 323–335. 1st International Conference on Unconventional Models of Computa-tion (UMC 98), UNIV AUCKLAND, AUCKLAND, NEW ZEALAND, JAN 05-09,1998.

[407] Paun, G. DNA computing based on splicing: universality results. THEORETI-CAL COMPUTER SCIENCE 231, 2 (JAN 28 2000), 275–296. 2nd InternationalColloquium on Universal Machines and Computations (MCU 98), INST UNIVTECHNOL METZ, METZ, FRANCE, MAR 23-27, 1998.

[408] Paun, G. From cells to computers: computing with membranes (P systems).BIOSYSTEMS 59, 3 (MAR 2001), 139–158. Workshop on Grammar Systems,BAD ISCHL, AUSTRIA, JUL, 2000.

[409] Paun, G. Membrane computing. In FUNDAMENTALS OF COMPUTATIONTHEORY, PROCEEDINGS (2003), Lingas, A and Nilsson, BJ, Ed., vol. 2751 ofLECTURE NOTES IN COMPUTER SCIENCE, Lung Univ; Malmo Univ Coll;Swedish Res Council, pp. 284–295. 14th International Symposium on Fundamentalsof Computation Theory, MALMO, SWEDEN, AUG 12-15, 2003.

[410] Paun, G. Tracing some open problems in membrane computing. ROMANIANJOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY 10, 4 (2007),303–314.

[411] Paun, G. Unconventional Computing: Do We Dream Too Much? In EVOLVINGCOMPUTABILITY (2015), Beckmann, A and Mitrana, V and Soskova, M, Ed.,vol. 9136 of Lecture Notes in Computer Science, pp. 63–70. 11th Conference onComputability in Europe (CiE), Univ Bucharest, Fac Math & Comp Sci, Bucharest,ROMANIA, JUN 29-JUL 03, 2015.

[412] Paun, G., Suzuki, Y., and Tanaka, H. P systems with energy accounting.INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 78, 3 (2001),343–364.

[413] Pavel, A. B., and Buiu, C. Using enzymatic numerical P systems for modelingmobile robot controllers. NATURAL COMPUTING 11, 3, SI (SEP 2012), 387–393.

[414] Pavlov, B., Roach, G., and Yafyasov, A. Resonance scattering and design ofquantum gates. In UNCONVENTIONAL MODELS OF COMPUTATION (1998),Calude, CS and Casti, J and Dinneen, MJ, Ed., SPRINGER SERIES IN DIS-CRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, UnivAuckland; Ctr Discrete Math & Theoret Comp Sci; Santa Fe Inst, pp. 336–351.1st International Conference on Unconventional Models of Computation (UMC98), UNIV AUCKLAND, AUCKLAND, NEW ZEALAND, JAN 05-09, 1998.

137

[415] Piccinini, G. The Physical Church-Turing Thesis: Modest or Bold? BRITISHJOURNAL FOR THE PHILOSOPHY OF SCIENCE 62, 4 (DEC 2011), 733–769.

[416] Pina-Garcia, C. A., and Garcia-Vega, V. A. A hybrid methodology forrobotic architectures with a cellular approach. In 2006 1st IEEE InternationalConference on E-Learning in Industrial Electronics (2006), IEEE, pp. 156–160.1st IEEE International Conference on E-Learning in Industrial Electronics, Ham-mamet, TUNISIA, DEC 18-20, 2006.

[417] Planat, M., and Saniga, M. Five-qubit contextuality, noise-like distributionof distances between maximal bases and finite geometry. PHYSICS LETTERS A376, 46 (OCT 15 2012), 3485–3490.

[418] Plonka, P. M., Passeron, T., Brenner, M., Tobin, D. J., Shibahara, S.,Thomas, A., Slominski, A., Kadekaro, A. L., Hershkovitz, D., Peters,E., Nordlund, J. J., Abdel-Malek, Z., Takeda, K., Paus, R., Ortonne,J. P., Hearing, V. J., and Schallreuter, K. U. What are melanocytesreally doing all day long...? EXPERIMENTAL DERMATOLOGY 18, 9 (SEP2009), 799–819.

[419] Porrot, S., Dauchet, M., Durand, B., and Vereshchagin, N. Determin-istic rational transducers and random sequences. In FOUNDATIONS OF SOFT-WARE SCIENCE AND COMPUTATION STRUCTURES (1998), Nivat, M, Ed.,vol. 1378 of LECTURE NOTES IN COMPUTER SCIENCE, Portugal Telecom;TAP Air Portugal; Luso Amer Dev Fdn; British Council; Commiss European Com-munities, Programme Training & Mobil Researchers; Univ Lisbon; European AssocTheoret Comp Sci; European Assoc Programming Languages & Syst; GulbenkianFdn, pp. 258–272. 1st International Conference on Foundations of Software Scienceand Computation Structures (FoSSaCS 98) at the Joint European Conf on Theoryand Practice of Software, LISBON, PORTUGAL, MAR 28-APR 04, 1998.

[420] Potgieter, P. H. Zeno machines and hypercomputation. THEORETICALCOMPUTER SCIENCE 358, 1 (JUL 31 2006), 23–33.

[421] Povarov, G. A. Regularity of a Dynamic Neighborhood of a Regular Language.PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS 267, 1(DEC 2009), S201–S209.

[422] Privman, V., Domanskyi, S., Mailloux, S., Holade, Y., and Katz, E.Kinetic Model for a Threshold Filter in an Enzymatic System for Bioanalytical andBiocomputing Applications. JOURNAL OF PHYSICAL CHEMISTRY B 118, 43(OCT 30 2014), 12435–12443.

[423] Privman, V., Fratto, B. E., Zavalov, O., Halamek, J., and Katz, E.Enzymatic AND Logic Gate with Sigmoid Response Induced by PhotochemicallyControlled Oxidation of the Output. JOURNAL OF PHYSICAL CHEMISTRY B117, 25 (JUN 27 2013), 7559–7568.

[424] Privman, V., and Katz, E. Can bio-inspired information processing steps berealized as synthetic biochemical processes? PHYSICA STATUS SOLIDI A-APPLICATIONS AND MATERIALS SCIENCE 212, 2 (FEB 2015), 219–228.

138

[425] Privman, V., Zavalov, O., Halamkova, L., Moseley, F., Halamek, J.,and Katz, E. Networked Enzymatic Logic Gates with Filtering: New Theoret-ical Modeling Expressions and Their Experimental Application. JOURNAL OFPHYSICAL CHEMISTRY B 117, 48 (DEC 5 2013), 14928–14939.

[426] Putz, V., and Svozil, K. Can a Computer be “Pushed” to Perform Faster-Than-Light? INTERNATIONAL JOURNAL OF UNCONVENTIONAL COMPUTING8, 1, SI (2012), 99–105.

[427] Qiu, D., and Yu, S. Hierarchy and equivalence of multi-letter quantum finiteautomata. THEORETICAL COMPUTER SCIENCE 410, 30-32 (AUG 20 2009),3006–3017.

[428] Ratsaby, J. An empirical study of the complexity and randomness of predic-tion error sequences. COMMUNICATIONS IN NONLINEAR SCIENCE ANDNUMERICAL SIMULATION 16, 7 (JUL 2011), 2832–2844.

[429] Rettinger, R., and Zheng, X. Hierarchy of monotonically computable realnumbers. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE2001 (2001), Sgall, J and Pultr, A and Kolman, P, Ed., vol. 2136 of Lecture Notesin Computer Science, Acad Sci Czech Republ, Math Inst; Inst Theoret CompSci; Inst Comp Sci; Act M Agcy, pp. 633–644. 26th International Symposium onMathematical Foundations of Computer Science, MARIANSKE LAZNE, CZECHREPUBLIC, AUG 27-31, 2001.

[430] Rettinger, R., and Zheng, X. Solovay reducibility on d-c.e real numbers.In COMPUTING AND COMBINATORICS, PROCEEDINGS (2005), Wang, LH,Ed., vol. 3595 of Lecture Notes in Computer Science, Chinese Acad Sci, Acad Math& Syst Sci, pp. 359–368. 11th Annual International Conference on Computing andCombinatorics (COCOON 2005), Kunming, PEOPLES R CHINA, AUG 16-29,2005.

[431] Rettinger, R., Zheng, X., Gengler, R., and von Braunmuhl, B. Monoton-ically computable real numbers. In COMBINATORICS, COMPUTABILITY ANDLOGIC (2001), Calude, CS and Dinneen, MJ and Sburlan, S, Ed., DISCRETEMATHEMATICS AND THEORETICAL COMPUTER SCIENCE (SERIES), FacMath & Comp Sci; Ovidius Univ; Univ Auckland, Ctr Discrete Math & Theo-ret Sci, pp. 187–201. 3rd International Conference on Discrete Mathematics andTheoretical Computer Science (DMTCS 01), CONSTANTA, ROMANIA, 2001.

[432] Rettinger, R., Zheng, X., Gengler, R., and von Braunmuhl, B. Weaklycomputable real numbers and total computable real functions. In COMPUTINGAND COMBINATORICS (2001), Wang, J, Ed., vol. 2108 of Lecture Notes in Com-puter Science, Chinese Acad Sci; China Comp Federat, pp. 586–595. 7th AnnualInternational Computing and Combinatorics Conference, GUILIN, PEOPLES RCHINA, AUG 20-23, 2001.

[433] Rettinger, R., Zheng, X., Gengler, R., and von Braunmuhl, B. Mono-tonically computable real numbers. MATHEMATICAL LOGIC QUARTERLY 48,3 (2002), 459–479.

139

[434] Ricotta, C., and Anand, M. Spatial complexity of ecological communities:Bridging the gap between probabilistic and non-probabilistic uncertainty measures.ECOLOGICAL MODELLING 197, 1-2 (AUG 10 2006), 59–66.

[435] Rivals, E., and Delahaye, J. Optimal representation in average using Kol-mogorov complexity. THEORETICAL COMPUTER SCIENCE 200, 1-2 (JUN 281998), 261–287.

[436] Rodriguez Velasquez, J. O. A method for forecasting the seasonal dynamicof malaria in the municipalities of Colombia. REVISTA PANAMERICANA DESALUD PUBLICA-PAN AMERICAN JOURNAL OF PUBLIC HEALTH 27, 3(MAR 2010), 211–218.

[437] Rovan, B., and Zeman, M. Modeling time criticality of information. INFOR-MATION PROCESSING LETTERS 114, 3 (MAR 2014), 147–151.

[438] Ryabko, B. Applications of Kolmogorov complexity and universal codes to Non-parametric estimation of characteristics of time series. FUNDAMENTA INFOR-MATICAE 83, 1-2 (2008), 177–196.

[439] Salomaa, K., and Schofield, P. State complexity of additive weighted finiteautomata. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTERSCIENCE 18, 6 (DEC 2007), 1407–1416.

[440] SANTEAN, L. A HIERARCHY OF UNARY PRIMITIVE RECURSIVESTRING-FUNCTIONS. LECTURE NOTES IN COMPUTER SCIENCE 464(1990), 225–233.

[441] SCHAFER, G. A NOTE ON CONJECTURES OF CALUDE ABOUT THETOPOLOGICAL SIZE OF SETS OF PARTIAL RECURSIVE FUNCTIONS.ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DERMATHEMATIK 31, 3 (1985), 279–280.

[442] Schaller, M., and Svozil, K. Scale-invariant cellular automata and self-similarPetri nets. EUROPEAN PHYSICAL JOURNAL B 69, 2 (MAY 2009), 297–311.

[443] Schmidhuber, J. The Fastest Way of Computing All Universes. In COM-PUTABLE UNIVERSE: UNDERSTANDING AND EXPLORING NATURE ASCOMPUTATION, Zenil, H, Ed. 2013, pp. 381–398.

[444] SCHMIDT, M. ON THE POWER OF SEVERAL QUEUES. LECTURE NOTESIN COMPUTER SCIENCE 480 (1991), 64–75.

[445] Schwarz, S., and Staiger, L. Topologies Refining the Cantor Topology onX-omega. In THEORETICAL COMPUTER SCIENCE (2010), Calude, CS andSassone, V, Ed., vol. 323 of IFIP Advances in Information and CommunicationTechnology, IFIP Tech Comm 1; IFIP WG 2.2; SIGACT; EATCS, pp. 271–285.6th IFIP International Conference on Theoretical Computer Science, Brisbane,AUSTRALIA, SEP 20-23, 2010.

[446] Sempere, J. M., and Lopez, D. Characterizing membrane structures throughmultiset tree automata. In MEMBRANE COMPUTING (2007), Eleftherakis, Gand Kefalas, P and Paun, G and Rozenberg, G and Salomaa, A, Ed., vol. 4860 of

140

LECTURE NOTES IN COMPUTER SCIENCE, pp. 428–437. 8th InternationalWorkshop on Membrane Computing, Thessaloniki, GREECE, JUN 25-28, 2007.

[447] Shagrir, O. Supertasks do not increase computational power. NATURAL COM-PUTING 11, 1, SI (MAR 2012), 51–58.

[448] Shmulevich, I., and Povel, D. Measures of temporal pattern complexity.JOURNAL OF NEW MUSIC RESEARCH 29, 1 (2000), 61–69.

[449] Sicard, A., Ospina, J., and Velez, M. Quantum hypercomputation based onthe dynamical algebra su(1,1). JOURNAL OF PHYSICS A-MATHEMATICALAND GENERAL 39, 40 (OCT 6 2006), 12539–12558.

[450] Simpson, S. G., and Stephan, F. Cone avoidance and randomness preservation.ANNALS OF PURE AND APPLIED LOGIC 166, 6 (JUN 2015), 713–728.

[451] Sindelar, J., and Bocek, P. Kolmogorov complexity and probability measures.KYBERNETIKA 38, 6 (2002), 729–745.

[452] Sindelar, J., and Bocek, P. Kolmogorov complexity, pseudorandom generatorsand statistical models testing. KYBERNETIKA 38, 6 (2002), 747–759.

[453] Small, J. Why do quantum systems implement self-referential logic? A simplequestion with a catastrophic answer. In COMPUTING ANTICIPATORY SYS-TEMS (2006), Dubois, DM, Ed., vol. 839 of AIP Conference Proceedings, FNRS;Minist Communaute Francaise Belgique; Adm Gen Enseignement & Rech Sci; HECManagement Sch; Univ Liege; Euro View Serv SA; Hotel Ville Liege, pp. 167–183.7th International Conference on Computing Anticipatory Systems (CASYS 05),Liege, BELGIUM, AUG 08-13, 2005.

[454] Soler-Toscano, F., Zenil, H., Delahaye, J.-P., and Gauvrit, N. Calcu-lating Kolmogorov Complexity from the Output Frequency Distributions of SmallTuring Machines. PLOS ONE 9, 5 (MAY 8 2014).

[455] Solis, A., Angulo Martinez, A. M., Ramirez Alarcon, R.,Cruz Ramirez, H., U’Ren, A. B., and Hirsch, J. G. How random are randomnumbers generated using photons? PHYSICA SCRIPTA 90, 7, SI (JUL 2015).

[456] Solis, A., and Hirsch, J. G. Quantumness, Randomness and Computabil-ity. In INTERNATIONAL CONFERENCE ON QUANTUM CONTROL, EXACTOR PERTURBATIVE, LINEAR OR NONLINEAR TO CELEBRATE 50 YEARSOF THE SCIENTIFIC CAREER OF PROFESSOR BOGDAN MIELNIK (MIEL-NIK50) (2015), Breton, N and Fernandez, D and Kielanowski, P, Ed., vol. 624 ofJournal of Physics Conference Series, Cinvestav; Consejo Nacl Ciencia & Tecnolo-gia. International Conference on Quantum Control, Exact or Perturbative, Linearor Nonlinear, Mexico City, MEXICO, OCT 22-24, 2014.

[457] Sosik, P., and Matysek, J. Membrane computing: When communication isenough. In UNCONVENTIONAL MODELS IN COMPUTATION, PROCEED-INGS (2002), Calude, C and Dinneen, MJ and Peper, F, Ed., vol. 2509 of LEC-TURE NOTES IN COMPUTER SCIENCE, Ctr Discrete Math & Theoret CompSci; Adv Res Ctr Commun Res Lab, pp. 264–275. 3rd International Conference onUnconventional Models of Computation, KOBE, JAPAN, OCT 15-19, 2002.

141

[458] Speidel, U. An Extended Similarity Distance for Use with Computable Informa-tion Estimators. In 2014 INTERNATIONAL SYMPOSIUM ON INFORMATIONTHEORY AND ITS APPLICATIONS (ISITA) (2014), Res Soc Informat Theory& Applicat; Engn Sci Soc; IEEE Informat Theory Soc; Monash Univ; MelbourneConvent Bur; KDDI Fdn; Support Ctr Adv Telecommunicat Technol Res, pp. 304–308. International Symposium on Information Theory and its Applications (ISITA),Melbourne, AUSTRALIA, OCT 26-29, 2014.

[459] Sprenger, K. Some hierarchies of primitive recursive functions on term algebras.MATHEMATICAL LOGIC QUARTERLY 43, 2 (1997), 251–286.

[460] Stadler, B. M. R., and Stadler, P. F. Connectivity Spaces. MATHEMATICSIN COMPUTER SCIENCE 9, 4 (DEC 2015), 409–436.

[461] STAIGER, L. REPRESENTABLE MARTINLOF,P TESTS. KYBERNETIKA21, 3 (1985), 235–243.

[462] Staiger, L. A tight upper bound on Kolmogorov complexity and uniformly opti-mal prediction. THEORY OF COMPUTING SYSTEMS 31, 3 (MAY-JUN 1998),215–229.

[463] Staiger, L. The Kolmogorov complexity of real numbers. In FUNDAMENTALSOF COMPUTATION THEORY (1999), Ciobanu, G and Paun, G, Ed., vol. 1684of LECTURE NOTES IN COMPUTER SCIENCE, Assoc Comp Machinery; NatlAgcy Sci Technol & Innovat; Motorola, pp. 536–546. 12th International Symposiumon Fundamental of Computation Theory, IASI, ROMANIA, AUG 30-SEP 03, 1999.

[464] Staiger, L. How large is the set of disjunctive sequences? In COMBINA-TORICS, COMPUTABILITY AND LOGIC (2001), Calude, CS and Dinneen,MJ and Sburlan, S, Ed., DISCRETE MATHEMATICS AND THEORETICALCOMPUTER SCIENCE (SERIES), Fac Math & Comp Sci; Ovidius Univ; UnivAuckland, Ctr Discrete Math & Theoret Sci, pp. 215–225. 3rd International Con-ference on Discrete Mathematics and Theoretical Computer Science (DMTCS 01),CONSTANTA, ROMANIA, 2001.

[465] Staiger, L. How large is the set of disjunctive sequences. JOURNAL OF UNI-VERSAL COMPUTER SCIENCE 8, 2 (2002), 348–362.

[466] Staiger, L. The Kolmogorov complexity of infinite words. THEORETICALCOMPUTER SCIENCE 383, 2-3 (SEP 18 2007), 187–199. Meeting of theAmerican-Mathematical-Society, Santa Barbara, CA, APR, 2005.

[467] Stambuk, N. Universal metric properties of the genetic code. CROATICA CHEM-ICA ACTA 73, 4 (DEC 2000), 1123–1139. 14th Dubrovnik International Courseand Conference on the Interfaces between Mathematics, Chemistry and ComputerSciences, DUBROVNIK, CROATIA, JUN 21-26, 1999.

[468] Stamenkovic, A., and Ciric, M. Construction of fuzzy automata from fuzzyregular expressions. FUZZY SETS AND SYSTEMS 199 (JUL 16 2012), 1–27.

[469] Stamenkovic, A., Ciric, M., and Ignjatovic, J. Reduction of fuzzy automataby means of fuzzy quasi-orders. INFORMATION SCIENCES 275 (AUG 10 2014),168–198.

142

[470] Stanislav, J. M. A 43 YEARS HISTORY, PASSING FROM THE GUTEN-BERG PROJECT INITIATIVE TO THE OPEN EDUCATIONAL RESOURCESMOVEMENT. In LET’S BUILD THE FUTURE THROUGH LEARNING INNO-VATION!, VOL IV (2014), Roceanu, I, Ed., eLearning and Software for Education,pp. 433–440. 10th International Scientific Conference on eLearning and Softwarefor Education, Bucharest, ROMANIA, APR 24-25, 2014.

[471] Stannett, M. Specification, testing and verification of unconventional compu-tations using generalized X-machines. INTERNATIONAL JOURNAL OF GEN-ERAL SYSTEMS 43, 7, SI (2014), 713–721.

[472] Stephan, F., and Teutsch, J. AN INCOMPLETE SET OF SHORTEST DE-SCRIPTIONS. JOURNAL OF SYMBOLIC LOGIC 77, 1 (MAR 2012), 291–307.

[473] Stephan, F., and Teutsch, J. Things that can be made into themselves. IN-FORMATION AND COMPUTATION 237 (OCT 2014), 174–186.

[474] STREINU, I. GRAMMAR DIRECTED GODEL NUMBERINGS. INTERNA-TIONAL JOURNAL OF COMPUTER MATHEMATICS 14, 3-4 (1983), 223–237.

[475] Sutner, K. The Ehrenfeucht-Mycielski sequence. In IMPLEMENTATIONAND APPLICATION OF AUTOMATA, PROCEEDINGS (2003), Ibarra, OH andDang, Z, Ed., vol. 2759 of LECTURE NOTES IN COMPUTER SCIENCE, UnivCalif Santa Barbara, Comp Sci Dept; Univ Calif Santa Barbara, Coll Engn; UnivCalif Santa Barbara, Grad Div; AT&T Labs Res; Expertcity Inc, pp. 282–293.8th International Conference on Implementation and Application of Automata,UNIV CALIF SANTA BARBARA, SANTA BARBARA, CALIFORNIA, JUL 16-18, 2003.

[476] Suzuki, T., and Kumabe, M. Weak randomness, genericity and Boolean decisiontrees. In PROCEEDINGS OF THE 10TH ASIAN LOGIC CONFERENCE (2010),Arai, T and Brendle, J and Kikyo, H and Chong, CT and Downey, R and Feng,Q and Ono, H, Ed., Assoc Symbol Log; Japan Soc Promot Sci; Inoue Fdn Sci,pp. 322–344. 10th Asian Logic Conference, Kobe Univ, Kobe, JAPAN, SEP 01-06,2008.

[477] Suzuki, Y., Fujiwara, Y., Takabayashi, J., and Tanaka, H. Artificial lifeapplications of a class of P systems: Abstract rewriting systems on multisets. InMULTISET PROCESSING: MATHEMATICAL, COMPUTER SCIENCE, ANDMOLECULAR COMPUTING POINTS OF VIEW (2001), Calude, CS and Paun,G and Rozenberg, G and Salomaa, A, Ed., vol. 2235 of Lecture Notes in ComputerScience, Romanian Acad, Simion Stoilow Inst Math; Polytech Univ Madrid, Arti-ficial Intelligence Dept; Auckland Univ, Ctr Discrete Math & Theoret Comp Sci,pp. 299–346. Workshop on Multiset Processing, CURTEA DE ARGES, ROMA-NIA, AUG, 2000.

[478] SVOZIL, K. ARE CHAOTIC SYSTEMS DYNAMICALLY RANDOM.PHYSICS LETTERS A 140, 1-2 (SEP 4 1989), 5–9.

[479] SVOZIL, K. CONSTRUCTIVE CHAOS BY CELLULAR AUTOMATA ANDPOSSIBLE SOURCES OF AN ARROW OF TIME. PHYSICA D 45, 1-3 (SEP1990), 420–427. WORKSHOP ON CELLULAR AUTOMATA : THEORY AND

143

EXPERIMENT, LOS ALAMOS NATL LAB, LOS ALAMOS, NM, SEP 09-12,1989.

[480] SVOZIL, K. ON THE COMPUTATIONAL POWER OF PHYSICAL SYS-TEMS, UNDECIDABILITY, THE CONSISTENCY OF PHENOMENA, ANDTHE PRACTICAL USES OF PARADOXES. In FUNDAMENTAL PROBLEMSIN QUANTUM THEORY: A CONFERENCE HELD IN HONOR OF PROFES-SOR JOHN A. WHEELER (1995), Greenberger, DM and Zeilinger, A, Ed.,vol. 755 of Annals of the New York Academy of Sciences, New York Acad Sci,pp. 834–841. Conference on Fundamental Problems in Quantum Theory, A Con-ference held in Honor of Professor John A. Wheeler, BALTIMORE, MD, JUN18-22, 1994.

[481] Svozil, K. Set theory and physics. FOUNDATIONS OF PHYSICS 25, 11 (NOV1995), 1541–1560.

[482] Svozil, K. The church-turing thesis as a guiding principle for physics. In UNCON-VENTIONAL MODELS OF COMPUTATION (1998), Calude, CS and Casti, Jand Dinneen, MJ, Ed., SPRINGER SERIES IN DISCRETE MATHEMATICSAND THEORETICAL COMPUTER SCIENCE, Univ Auckland; Ctr DiscreteMath & Theoret Comp Sci; Santa Fe Inst, pp. 371–385. 1st International Confer-ence on Unconventional Models of Computation (UMC 98), UNIV AUCKLAND,AUCKLAND, NEW ZEALAND, JAN 05-09, 1998.

[483] Svozil, K. Logic of reversible automata. INTERNATIONAL JOURNAL OFTHEORETICAL PHYSICS 39, 3 (MAR 2000), 893–899. Quantum Structures 98Conference, LIPTOVSKY JAN, SLOVAKIA, AUG 30-SEP 05, 1998.

[484] Svozil, K. Quantum information: The new frontier. In UNCONVENTIONALMODELS OF COMPUTATION UMC’ 2K, PROCEEDINGS (2001), Antoniou,I and Calude, CS and Dinneen, MJ, Ed., DISCRETE MATHEMATICS ANDTHEORETICAL COMPUTER SCIENCE (SERIES), Univ Auckland, Ctr DiscreteMath & Theoret Comp Sci; Vrije Univ Brussels, Theoret Phys Div; Int SolvayInst Phys & Chem; Belgium Prime Minister’s Off; Fed Off Sci Techn & CulturalAffairs; Pukekohe Travel; Interuniv Poles Attract Program Contract P4/08 BelgianState, pp. 248–272. 2nd International Conference on Unconventional Models ofComputation (UMC’2K), SOLVAY INST, BRUSSELS, BELGIUM, DEC 13-16,2000.

[485] Svozil, K. Three criteria for quantum random-number generators based on beamsplitters. PHYSICAL REVIEW A 79, 5 (MAY 2009).

[486] Svozil, K. Quantum value indefiniteness. NATURAL COMPUTING 10, 4, SI(DEC 2011), 1371–1382.

[487] Svozil, K. How much contextuality? NATURAL COMPUTING 11, 2, SI (JUN2012), 261–265.

[488] Svozil, K. Non-contextual chocolate balls versus value indefinite quantum cryp-tography. THEORETICAL COMPUTER SCIENCE 560, 1 (DEC 4 2014), 82–90.

144

[489] Svozil, K. Physical Aspects of Oracles for Randomness and Hadamard’s Con-jecture. In COMPUTING WITH NEW RESOURCES: ESSAYS DEDICATEDTO JOZEF GRUSKA ON THE OCCASION OF HIS 80TH BIRTHDAY, Calude,CS and Freivalds, R and Kazuo, I, Ed., vol. 8808 of Lecture Notes in ComputerScience. 2014, pp. 223–230.

[490] Svozil, K. Unscrambling the Quantum Omelette. INTERNATIONAL JOURNALOF THEORETICAL PHYSICS 53, 10 (OCT 2014), 3648–3657.

[491] Svozil, K. Space and Time in a Quantized World. INTERNATIONAL JOURNALOF THEORETICAL PHYSICS 54, 12 (DEC 2015), 4376–4385.

[492] Svozil, K., Calude, C., and Stay, M. From Heisenberg to Godel via Chaitin.INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS 44, 7 (JUL 2005),1053–1065. International Conference on Quantum Structures 2002, Vienna, AUS-TRIA, JUL 01-07, 2002.

[493] Svozil, K., and Neufeld, N. ‘Linear’ chaos via paradoxical set decompositions.CHAOS SOLITONS & FRACTALS 7, 5 (MAY 1996), 785–793.

[494] Syropoulos, A. Theory of Fuzzy Computation. In THEORY OF FUZZY COM-PUTATION, vol. 31 of IFSR International Series on System Science and Engi-neering. 2014, pp. 1–162.

[495] Tadaki, K. A statistical mechanical interpretation of instantaneous codes. In2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORYPROCEEDINGS, VOLS 1-7 (2007), IEEE, pp. 1906–1910. IEEE InternationalSymposium on Information Theory, Nice, FRANCE, JUN 24-29, 2007.

[496] Tadaki, K. The Tsallis entropy and the Shannon entropy of a universal prob-ability. In 2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATIONTHEORY PROCEEDINGS, VOLS 1-6 (2008), IEEE; RIM; Ontario Cent Excel-lence; IBM Res; Microsoft Res, pp. 2111–2115. IEEE International Symposium onInformation Theory, Toronto, CANADA, JUL 06-11, 2008.

[497] Tadaki, K. A New Representation of Chaitin Omega Number Based on Com-pressible Strings. In UNCONVENTIONAL COMPUTATION, PROCEEDINGS(2010), Calude, CS and Hagiya, M and Morita, K and Rozenberg, G and Timmis,J, Ed., vol. 6079 of Lecture Notes in Computer Science, EATCS; Acad Europaea;Ctr Discrete Math & Theoret Comp Sci, pp. 127–139. 9th International Conferenceon Unconventional Computation, Univ Tokyo, Hongo Campus, Tokyo, JAPAN,JUN 21-25, 2010.

[498] Tadaki, K. The Hausdorff dimension of the halting self-similar sets of T-universalprefix-free machines. In 2010 IEEE INTERNATIONAL SYMPOSIUM ON IN-FORMATION THEORY (2010), IEEE International Symposium on InformationTheory, IEEE, pp. 1287–1291. 2010 IEEE International Symposium on InformationTheory, Austin, TX, JUL 13-13, 2010.

[499] Tadaki, K. A Chaitin Omega number based on compressible strings. NATURALCOMPUTING 11, 1, SI (MAR 2012), 117–128.

145

[500] Tadaki, K. A statistical mechanical interpretation of algorithmic informationtheory III: composite systems and fixed points. MATHEMATICAL STRUCTURESIN COMPUTER SCIENCE 22, 5, SI (OCT 2012), 752–770.

[501] Tadaki, K. Fixed point theorems on partial randomness. ANNALS OF PUREAND APPLIED LOGIC 163, 7, SI (JUL 2012), 763–774.

[502] Takenaka, Y., and Hashimoto, A. Shortening the computational time ofthe fluorescent DNA computing. In DNA COMPUTING (2003), Hagiya, M andOhuchi, A, Ed., vol. 2568 of LECTURE NOTES IN COMPUTER SCIENCE,Japan Sci & Technol Corp, pp. 85–94. 8th International Workshop on DNA-BasedComputers, HOKKAIDO UNIV, SAPPORO, JAPAN, JUN 10-13, 2002.

[503] TANGUIANE, A. MUSIC RECOGNITION BASED ON ARTIFICIAL PER-CEPTION APPROACH. INTERFACE-JOURNAL OF NEW MUSIC RE-SEARCH 22, 2 (MAY 1993), 133–149. 1ST GENERAL ASSEMBLY OF THEEUROPEAN SOC FOR THE COGNITIVE SCIENCES OF MUSIC, TRIESTE,ITALY, OCT 27-29, 1991.

[504] TANGUIANE, A. A PRINCIPLE OF CORRELATIVITY OF PERCEPTIONAND ITS APPLICATION TO MUSIC RECOGNITION. MUSIC PERCEPTION11, 4 (SUM 1994), 465–502.

[505] TANGUIANE, A. TOWARDS AXIOMATIZATION OF MUSIC PERCEPTION.JOURNAL OF NEW MUSIC RESEARCH 24, 3 (SEP 1995), 247–281.

[506] Tarau, P. Hereditarily Finite Representations of Natural Numbers and Self-Delimiting Codes. In MSFP 2010: PROCEEDINGS OF THE 2010 ACM SIG-PLAN WORKSHOP ON MATHEMATICALLY STRUCTURED FUNCTIONALPROGRAMMING (2010), ACM SIGPLAN, pp. 11–17. 3rd Workshop on Mathe-matically Structured Functional Programming, Baltimore, MD, SEP 25, 2010.

[507] Tarau, P. On Arithmetic Computations with Hereditarily Finite Sets, Functionsand Types. In THEORETICAL ASPECTS OF COMPUTING (2010), Cavalcanti,A and Deharbe, D and Gaudel, MC and Woodcock, J, Ed., vol. 6255 of LectureNotes in Computer Science, Univ Fed Rio Grande Norte; Univ York, pp. 367–381.7th International Colloquium Theoretical Aspects of Computing, Natal, BRAZIL,SEP 01-03, 2010.

[508] Toffoli, T., Capobianco, S., and Mentrasti, P. When - and how - can acellular automaton be rewritten as a lattice gas? THEORETICAL COMPUTERSCIENCE 403, 1 (AUG 20 2008), 71–88.

[509] Tomescu, I. On words containing all short subwords. THEORETICAL COM-PUTER SCIENCE 197, 1-2 (MAY 15 1998), 235–240.

[510] Tomescu, I. On the number of words containing the factor (aba)(k). DISCRETEAPPLIED MATHEMATICS 155, 11 (JUN 1 2007), 1506–1511.

[511] Trautteur, G. Analog computation and the continuum-discrete conundrum.In GROUNDING EFFECTIVE PROCESSES IN EMPIRICAL LAWS: REFLEC-TIONS ON THE NOTION OF ALGORITHM (1999), Lupacchini, R and Tam-burrini, G, Ed., Comune Cesena; F Enriques Ctr; ELSAG, pp. 23–42. Workshop

146

on Symbols, Physical Processes, Biological Processes-Recent Explorations of theNotion of Algorithm, CESENA, ITALY, FEB 16, 1999.

[512] Turiel, T. P. Quantum random bit generators. AMERICAN STATISTICIAN61, 3 (AUG 2007), 255–259.

[513] Um, M., Zhang, X., Zhang, J., Wang, Y., Yangchao, S., Deng, D. L.,Duan, L.-M., and Kim, K. Experimental Certification of Random Numbers viaQuantum Contextuality. SCIENTIFIC REPORTS 3 (APR 9 2013).

[514] Uspensky, V., and Shen, A. Relations between varieties of Kolmogorov com-plexities. MATHEMATICAL SYSTEMS THEORY 29, 3 (MAY-JUN 1996), 271–292.

[515] Vasilieva, A., and Mischenko-Slatenkova, T. Quantum Query Algorithmsfor Conjunctions. In UNCONVENTIONAL COMPUTATION, PROCEEDINGS(2010), Calude, CS and Hagiya, M and Morita, K and Rozenberg, G and Timmis, J,Ed., vol. 6079 of Lecture Notes in Computer Science, EATCS; Acad Europaea; CtrDiscrete Math & Theoret Comp Sci, pp. 140–151. 9th International Conference onUnconventional Computation, Univ Tokyo, Hongo Campus, Tokyo, JAPAN, JUN21-25, 2010.

[516] Vassiliadis, V., and Dounias, G. NATURE-INSPIRED INTELLIGENCE:A REVIEW OF SELECTED METHODS AND APPLICATIONS. INTERNA-TIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS 18, 4 (AUG2009), 487–516.

[517] Vazirani, U., and Vidick, T. Certifiable quantum dice. PHILOSOPHICALTRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSI-CAL AND ENGINEERING SCIENCES 370, 1971, SI (JUL 28 2012), 3432–3448.

[518] Wang, J., Yin, M., and Gu, W. Fuzzy multiset finite automata and theirlanguages. SOFT COMPUTING 17, 3 (MAR 2013), 381–390.

[519] Weerakoon, W. A. C., Karunananda, A. S., and Dias, N. G. J. A Tac-tics Memory for a New Theory of Computing. In PROCEEDINGS OF THE 20138TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE & EDU-CATION (ICCSE 2013) (2013), Inst Elect & Elect Engineers; Natl Res CouncilComp Educ Coll & Univ; Inst Elect & Elect Engineers Sri Lanka Sect, pp. 153–158. 8th International Conference on Computer Science and Education (ICCSE),Sri Lanka Inst Informat Technol, Colombo, SRI LANKA, APR 26-28, 2013.

[520] WIEDERHOLD, G. DIGITAL LIBRARIES, VALUE, AND PRODUCTIVITY.COMMUNICATIONS OF THE ACM 38, 4 (APR 1995), 85–96.

[521] Wiedermann, J., and van Leeuwen, J. Relativistic computers and non-uniform complexity theory. In UNCONVENTIONAL MODELS IN COMPUTA-TION, PROCEEDINGS (2002), Calude, C and Dinneen, MJ and Peper, F, Ed.,vol. 2509 of Lecture Notes in Computer Science, Ctr Discrete Math & TheoretComp Sci; Adv Res Ctr Commun Res Lab, pp. 287–299. 3rd International Con-ference on Unconventional Models of Computation, KOBE, JAPAN, OCT 15-19,2002.

147

[522] Wiedermann, J., and van Leeuwen, J. What is Computation: An EpistemicApproach. In SOFSEM 2015: THEORY AND PRACTICE OF COMPUTER SCI-ENCE (2015), Italiano, GF and MargariaSteffen, T and Pokorny, J and Quisquater,JJ and Wattenhofer, R, Ed., vol. 8939 of Lecture Notes in Computer Science, CzechSoc Cybernet & Informat, pp. 1–13. 41st International Conference on CurrentTrends in Theory and Practice of Computer Science ((SOFSEM), Pecpod Snezkou,CZECH REPUBLIC, JAN 24-29, 2015.

[523] Wolf, M. J. Computation as Information Processing. In PHYSICAL COMPU-TATION AND COGNITIVE SCIENCE, vol. 12 of Studies in Applied PhilosophyEpistemology and Rational Ethics. 2014, pp. 133–166.

[524] Wu, C.-R., Chang, C.-W., and Chen, C.-C. Applying Expert Diagnosis Modelto Collaborative Design Systems. ADVANCED SCIENCE LETTERS 4, 4-5 (APR-MAY 2011), 1860–1861.

[525] Wu, G. Prefix-free languages and initial segments of computably enumerable de-grees. In COMPUTING AND COMBINATORICS (2001), Wang, J, Ed., vol. 2108of LECTURE NOTES IN COMPUTER SCIENCE, Chinese Acad Sci; China CompFederat, pp. 576–585. 7th Annual International Conference on Computing andCombinatorics, GUILIN, PEOPLES R CHINA, AUG 20-23, 2001.

[526] Xylogiannopoulos, K. F., Karampelas, P., and Alhajj, R. Experimen-tal Analysis on the Normality of pi, e, phi, root 2 Using Advanced Data-MiningTechniques. EXPERIMENTAL MATHEMATICS 23, 2 (2014), 105–128.

[527] Yamamoto, L. Code regulation in open ended evolution. In Genetic Program-ming, Proceedings (2007), ONeill, M and Ekart, A and Vanneschi, L and Es-parciaAlcazar, AI, Ed., vol. 4445 of LECTURE NOTES IN COMPUTER SCI-ENCE, pp. 271–280. 10th European Conference on Genetic Programming, Valen-cia, SPAIN, APR 11-13, 2007.

[528] YANG, E., and SHEN, S. CHAITIN COMPLEXITY, SHANNON-INFORMATION CONTENT OF A SINGLE EVENT AND INFINITE RANDOMSEQUENCES .1. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICSASTRONOMY & TECHNOLOGICAL SCIENCES 34, 10 (OCT 1991), 1183–1193.

[529] YANG, E., and SHEN, S. CHAITIN COMPLEXITY, SHANNON-INFORMATION CONTENT OF A SINGLE EVENT, AND INFINITE RANDOMSEQUENCES .2. SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICSASTRONOMY 34, 11 (NOV 1991), 1307–1319.

[530] Yanofsky, N. Outer Limits of Reason: What Science, Mathematics, and LogicCannot Tell Us. In OUTER LIMITS OF REASON: WHAT SCIENCE, MATHE-MATICS, AND LOGIC CANNOT TELL US. 2013, pp. 1–403.

[531] Yun, A., Jeong, D., and Kim, J. AN EFFICIENT AND ACCURATE NU-MERICAL SCHEME FOR TURING INSTABILITY ON A PREDATOR-PREYMODEL. INTERNATIONAL JOURNAL OF BIFURCATION AND CHAOS 22,6 (JUN 2012).

[532] Zajicek, L. On sigma-porous sets in abstract spaces. ABSTRACT AND AP-PLIED ANALYSIS, 5 (2005), 509–534.

148

[533] Zavalov, O., Bocharova, V., Halamek, J., Halamkova, L., Korkmaz, S.,Arugula, M. A., Chinnapareddy, S., Katz, E., and Privman, V. Two-Input Enzymatic Logic Gates Made Sigmoid by Modifications of the BiocatalyticReaction Cascades. INTERNATIONAL JOURNAL OF UNCONVENTIONALCOMPUTING 8, 5-6, SI (2012), 347–365.

[534] Zavalov, O., Bocharova, V., Privman, V., and Katz, E. Enzyme-BasedLogic: OR Gate with Double-Sigmoid Filter Response. JOURNAL OF PHYSICALCHEMISTRY B 116, 32 (AUG 16 2012), 9683–9689.

[535] Zenil, H. Introducing the Computable Universe. In COMPUTABLE UNIVERSE:UNDERSTANDING AND EXPLORING NATURE AS COMPUTATION, Zenil,H, Ed. 2013, pp. 1–20.

[536] Zenil, H. Turing patterns with Turing machines: emergence and low-level struc-ture formation. NATURAL COMPUTING 12, 2, SI (JUN 2013), 291–303.

[537] Zenil, H., Delahaye, J.-P., and Gaucherel, C. Image characterization andclassification by physical complexity. COMPLEXITY 17, 3 (JAN-FEB 2012), 26–42.

[538] Zenil, H., Gershenson, C., Marshall, J. A. R., and Rosenblueth, D. A.Life as Thermodynamic Evidence of Algorithmic Structure in Natural Environ-ments. ENTROPY 14, 11 (NOV 2012), 2173–2191.

[539] Zenil, H., Kiani, N. A., and Tegner, J. Algorithmic complexity of motifs clus-ters superfamilies of networks. In 2013 IEEE INTERNATIONAL CONFERENCEON BIOINFORMATICS AND BIOMEDICINE (BIBM) (2013), Li, GZ and Kim,S and Hughes, M and McLachlan, G and Sun, H and Hu, X and Ressom, H andLiu, B and Liebman, M, Ed., IEEE International Conference on Bioinformaticsand Biomedicine-BIBM, IEEE; IEEE Comp Soc; Tongji Univ; IEEE Comp SocTech Comm Life Sci; China Acad Chinese Med Sci; Shanghai Assoc Syst Simulat.IEEE International Conference on Bioinformatics and Biomedicine (IEEE BIBM),Shanghai, PEOPLES R CHINA, DEC 18-21, 2013.

[540] Zenil, H., Soler-Toscano, F., Dingle, K., and Louis, A. A. Correlation ofautomorphism group size and topological properties with program-size complexityevaluations of graphs and complex networks. PHYSICA A-STATISTICAL ME-CHANICS AND ITS APPLICATIONS 404 (JUN 15 2014), 341–358.

[541] Zenil, H., Soler-Toscano, F., and Joosten, J. J. Empirical Encounters withComputational Irreducibility and Unpredictability. MINDS AND MACHINES 22,3 (AUG 2012), 149–165.

[542] Zenil, H., and Villarreal-Zapata, E. ASYMPTOTIC BEHAVIOR ANDRATIOS OF COMPLEXITY IN CELLULAR AUTOMATA. INTERNATIONALJOURNAL OF BIFURCATION AND CHAOS 23, 9 (SEP 2013).

[543] Zhang, B.-T. Hypernetworks: A molecular evolutionary architecture for cognitivelearning and memory. IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE3, 3 (AUG 2008), 49–63.

149

[544] Zhang, F., Liu, B., Liu, W., and Zhang, Q. DNA computing model based onlab-on-a-chip and its application on solving the timetabling problem. PROGRESSIN NATURAL SCIENCE-MATERIALS INTERNATIONAL 18, 5 (MAY 10 2008),633–637.

[545] Zheng, X. Closure properties of real number classes under limits and computableoperators. In COMPUTING AND COMBINATORICS, PROCEEDINGS (2000),Du, DZ and Eades, P and EstivillCastro, V and Lin, X and Sharma, A, Ed.,vol. 1858 of Lecture Notes in Computer Science, Univ New S Wales; Univ New-castle; Univ Sydney; Comp Sci Assoc Australasia, pp. 170–179. 6th Annual Inter-national Computing and Combinatorics Conference (COCOON 2000), SYDNEY,AUSTRALIA, JUL 26-28, 2000.

[546] Zheng, X. Recursive approximability of real numbers. MATHEMATICAL LOGICQUARTERLY 48, 1 (2002), 131–156. Dagstuhl Seminar on Computability andComplexity in Analysis, SCHLOSS DAGSTUHL, GERMANY, NOV 11-16, 2001.

[547] Zheng, X. On the hierarchies of Delta(0)(2)-real numbers. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS 41, 1 (JAN-MAR2007), 3–25. 6th Conference on Real Numbers and Computers, Dagstuhl, GER-MANY, NOV, 2004.

[548] Zheng, X., Lu, D., and Bao, K. Divergence bounded computable real numbers.THEORETICAL COMPUTER SCIENCE 351, 1 (FEB 14 2006), 27–38.

[549] Zhu, J., Zhang, L., Dong, S., and Wang, E. Four-Way Junction-Driven DNAStrand Displacement and Its Application in Building Majority Logic Circuit. ACSNANO 7, 11 (NOV 2013), 10211–10217.

[550] Ziegler, M. Physically-relativized Church-Turing Hypotheses: Physical foun-dations of computing and complexity theory of computational physics. APPLIEDMATHEMATICS AND COMPUTATION 215, 4 (OCT 15 2009), 1431–1447. Inter-national Workshop on Physics and Computation, Vienna, AUSTRIA, AUG 25-28,2008.

[551] ZIMAND, M. ON THE TOPOLOGICAL SIZE OF SETS OF RANDOMSTRINGS. ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUND-LAGEN DER MATHEMATIK 32, 1 (1986), 81–88.

[552] ZIMAND, M. ON RELATIVIZATIONS WITH RESTRICTED NUMBER OFACCESSES TO THE ORACLE SET. MATHEMATICAL SYSTEMS THEORY20, 1 (1987), 1–11.

[553] ZIMAND, M. IF NOT EMPTY, NP-P IS TOPOLOGICALLY LARGE. THEO-RETICAL COMPUTER SCIENCE 119, 2 (OCT 25 1993), 293–310.

[554] ZIMAND, M. ON THE TOPOLOGICAL SIZE OF P-M-COMPLETE DE-GREES. THEORETICAL COMPUTER SCIENCE 147, 1-2 (AUG 7 1995), 137–147.

[555] Zimand, M. A high-low Kolmogorov complexity law equivalent to the 0-1 Law.INFORMATION PROCESSING LETTERS 57, 2 (JAN 29 1996), 59–64.

150

[556] Zimand, M. Two sources are better than one for increasing the Kolmogorovcomplexity of infinite sequences. In COMPUTER SCIENCE - THEORY ANDAPPLICATIONS (2008), Hirsch, EA and Razborov, AA and Semenov, A andSlissenko, A, Ed., vol. 5010 of LECTURE NOTES IN COMPUTER SCIENCE,Russian Acad Sci, Inst Syst Programming; Moscow State Univ; Moscow Inst OPenEduc; Inst New Technol, pp. 326–338. 3rd International Computer Science Sym-posium, Russian Acad Sci, Dorodinicyn Comp Ctr, Moscow, RUSSIA, JUN 07-12,2008.

[557] Zimand, M. Counting Dependent and Independent Strings. In MATHEMATI-CAL FOUNDATIONS OF COMPUTER SCIENCE 2010 (2010), Hlineny, P andKucera, A, Ed., vol. 6281 of Lecture Notes in Computer Science, European ResConsortium Informat & Math, pp. 689–700. 35th International Symposium onMathematical Foundations of Computer Science, Brno, CZECH REPUBLIC, AUG23-27, 2010.

[558] Zimand, M. Impossibility of Independence Amplification in Kolmogorov Com-plexity Theory. In MATHEMATICAL FOUNDATIONS OF COMPUTER SCI-ENCE 2010 (2010), Hlineny, P and Kucera, A, Ed., vol. 6281 of Lecture Notesin Computer Science, European Res Consortium Informat & Math, pp. 701–712.35th International Symposium on Mathematical Foundations of Computer Science,Brno, CZECH REPUBLIC, AUG 23-27, 2010.

[559] Zimand, M. Generating Kolmogorov random strings from sources with limitedindependence. JOURNAL OF LOGIC AND COMPUTATION 23, 4, SI (AUG2013), 909–924.

[560] Zimand, M. Counting Dependent and Independent Strings. FUNDAMENTAINFORMATICAE 131, 3-4 (2014), 485–497.

151