{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:35:44Z","timestamp":1760243744325,"version":"build-2065373602"},"reference-count":53,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2012,10,25]],"date-time":"2012-10-25T00:00:00Z","timestamp":1351123200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In this paper, we analyze axiomatic and constructive issues of unconventional computations from a methodological and philosophical point of view. We explain how the new models of algorithms and unconventional computations change the algorithmic universe, making it open and allowing increased flexibility and expressive power that augment creativity. At the same time, the greater power of new types of algorithms also results in the greater complexity of the algorithmic universe, transforming it into the algorithmic multiverse and demanding new tools for its study. That is why we analyze new powerful tools brought forth by local mathematics, local logics, logical varieties and the axiomatic theory of algorithms, automata and computation. We demonstrate how these new tools allow efficient navigation in the algorithmic multiverse. Further work includes study of natural computation by unconventional algorithms and constructive approaches.<\/jats:p>","DOI":"10.3390\/e14112066","type":"journal-article","created":{"date-parts":[[2012,10,25]],"date-time":"2012-10-25T11:13:36Z","timestamp":1351163616000},"page":"2066-2080","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Unconventional Algorithms: Complementarity of Axiomatics and Construction"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9881-400X","authenticated-orcid":false,"given":"Gordana","family":"Dodig Crnkovic","sequence":"first","affiliation":[{"name":"Department of Computer Science and Networks, School of Innovation, Design and Engineering M\u00e4lardalen University, V\u00e4ster\u00e5s, 72123, Sweden"}]},{"given":"Mark","family":"Burgin","sequence":"additional","affiliation":[{"name":"Department of Mathematics, UCLA, Los Angeles, CA 90095, USA"}]}],"member":"1968","published-online":{"date-parts":[[2012,10,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF00413980","article-title":"From absolute to local mathematics","volume":"69","author":"Bell","year":"1986","journal-title":"Synthese"},{"key":"ref_2","unstructured":"Burgin, M. (2005). Super-Recursive Algorithms, Science+Business Media Inc."},{"key":"ref_3","unstructured":"Minsky, M. (1967). Computation: Finite and Infinite Machines, Prentice-Hall."},{"key":"ref_4","unstructured":"Markov, A.A. (1954). Transactions of the Mathematical Institute of the Academy of Sciences of the USSR, Academy of Sciences of the USSR."},{"key":"ref_5","first-page":"175","article-title":"On the Concept of Algorithm","volume":"8","author":"Kolmogorov","year":"1953","journal-title":"Russ. Math. Surv."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1137\/0209036","article-title":"Storage Modification Machines","volume":"9","year":"1980","journal-title":"SIAM. J. Comput."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1145\/321160.321170","article-title":"Computability of Recursive Functions","volume":"10","author":"Shepherdson","year":"1963","journal-title":"J. Assoc. Comput. Mach."},{"key":"ref_8","unstructured":"Petri, C. (1962). Kommunikation mit Automaten. [Ph.D. Thesis, University of Bonn]."},{"key":"ref_9","unstructured":"Peterson, J.L. (1981). Petri Net Theory and the Modeling of Systems, Prentice Hall."},{"key":"ref_10","unstructured":"Burgin, M. (2010). Measuring Power of Algorithms, Computer Programs, and Information Automata, Nova Science Publishers."},{"key":"ref_11","unstructured":"Ehresmann, C. Trends toward unity in mathematics. Available online: http:\/\/archive.numdam.org\/ARCHIVE\/CTGDC\/CTGDC_1966__8_\/CTGDC_1966__8__A1_0\/CTGDC_1966__8__A1_0.pdf."},{"key":"ref_12","unstructured":"Barwise, J., and Seligman, J. (1997). Cambridge Tracts in Theoretical Computer Science 44, Cambridge University Press."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Burgin, M. (2010). Theory of Information: Fundamentality, Diversity and Unification, World Scientific.","DOI":"10.1142\/7048"},{"key":"ref_14","unstructured":"Burgin, M. (, 1989). Knowledge in Intelligent Systems. Proceedings of the Conference on Intelligent Management Systems, Varna, Bulgaria."},{"key":"ref_15","unstructured":"Minsky, M. (1974). A Framework for Representing Knowledge, MIT."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0004-3702(91)90036-J","article-title":"Society of Mind: A Response to Four Reviews","volume":"48","author":"Minsky","year":"1991","journal-title":"Artif. Intell."},{"key":"ref_17","unstructured":"Minsky, M. (, 1991). Conscious Machines. Machinery of Consciousness, Proceedings of the National Research Council of Canada, 75th Anniversary Symposium on Science in Society, Ottawa, Canada."},{"key":"ref_18","unstructured":"Delgrande, J.P., and Mylopoulos, J. (1986). Fundamentals of Artificial Intelligence, Springer."},{"key":"ref_19","first-page":"524","article-title":"The Representation of Inconsistent Knowledge","volume":"Volume 6882","author":"Burgin","year":"2011","journal-title":"Advanced Knowledge Based Systems, Lecture Notes in Computer Science, Knowlege-Based and Intelligent Information and Engineering Systems"},{"key":"ref_20","unstructured":"Burgin, M. (1997). Theoretical Problems of Mathematics and Information Sciences, Ukrainian Academy of Information Sciences. (In Russian)."},{"key":"ref_21","unstructured":"Burgin, M. Logical Tools for Program Integration and Interoperability. Proceedings of the IASTED International Conference on Software Engineering and Applications."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Newton-Smith, W.H. (2001). Companion to the Philosophy of Science, Blackwell.","DOI":"10.1111\/b.9780631230205.2001.00004.x"},{"key":"ref_23","unstructured":"Biology, Philosophy of Encyclop\u00e6dia Britannica. Available online: http:\/\/www.britannica.com\/EBchecked\/topic\/681551\/philosophy-of-biology."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Kunii, T.L. (, 2004). The Potentials of Cyberworlds\u2014An Axiomatic Approach. 3rd International Conference on Cyberworlds (CW\u201904), Tokyo, Japan.","DOI":"10.1109\/CW.2004.63"},{"key":"ref_25","unstructured":"Manna, Z. (1974). Mathematical Theory of Computation, McGraw Hill."},{"key":"ref_26","unstructured":"Milner, M. (1989). Communication and Concurrency, Prentice Hall."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., and Halpern, J.Y. (, 1980). Axiomatic definitions of programming languages: A theoretical assessment (preliminary report). Proceedings of the 7th ACM SIGPLAN-SIGACT Symposium on Principles of programming languages, Las Vegas, NV, USA.","DOI":"10.1145\/567446.567466"},{"key":"ref_28","unstructured":"Friedman, H. (1971). Logic Colloquium \u201969, Studies in Logic, North-Holland."},{"key":"ref_29","unstructured":"Gritliot, T.J. (1974). Generalized Recursion Theory, North-Holland."},{"key":"ref_30","unstructured":"Fenstad, J.E. (1975). Lecture Notes in Mathematics, Springer."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Ershov, A.P. (1981). Algorithms in Modern Mathematics and Computer Science, Springer.","DOI":"10.1007\/3-540-11157-3"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"442","DOI":"10.2307\/2274232","article-title":"Axiomatic Recursion Theory and the Continuous Functionals","volume":"50","author":"Thompson","year":"1985","journal-title":"J. Symbolic Logic"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Skordev, D. (1992). Computability in Combinatory Spaces: An Algebraic Generalization of Abstract First Order Computability, Kluwer Academic Publishers.","DOI":"10.1007\/978-94-011-2636-6"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0168-0072(90)90014-S","article-title":"Weak comparability of well orderings and reverse mathematics","volume":"47","author":"Friedman","year":"1990","journal-title":"Ann. Pure Appl. Logic"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.2307\/2586708","article-title":"Located Sets and Reverse Mathematics","volume":"65","author":"Giusto","year":"2000","journal-title":"J. Symbolic Logic"},{"key":"ref_36","first-page":"557","article-title":"Systems of second order arithmetic with restricted induction, I, II (Abstracts)","volume":"41","author":"Friedman","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"ref_37","unstructured":"Simpson, S.G. (1999). Perspectives in Mathematical Logic, Springer-Verlag."},{"key":"ref_38","unstructured":"Fraenkel, A.A., and Bar-Hillel, Y. (1958). Foundations of Set Theory, North-Holland."},{"key":"ref_39","unstructured":"Kurosh, A.G. (1963). Lectures on General Algebra, Chelsea Publishing Company."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"75","DOI":"10.4064\/fm-37-1-75-76","article-title":"The Tychonoff product theorem implies the axiom of choice","volume":"37","author":"Kelley","year":"1950","journal-title":"Fund. Math."},{"key":"ref_41","unstructured":"Howard, P., and Rubin, J. (1998). Mathematical Surveys and Monographs, American Mathematical Society."},{"key":"ref_42","unstructured":"Kolmogorov, A.N., and Fomin, S.V. (1999). Elements of the Theory of Functions and Functional Analysis, Dover Publications."},{"key":"ref_43","unstructured":"Bernays, P., and Hilbert, D. (1967). The Encyclopedia of Philosophy, Version 3, Macmillan and The Free Press."},{"key":"ref_44","unstructured":"Boker, U., and Dershowitz, N.A. Formalization of the Church-Turing Thesis for State-Transition Models. Available online: http:\/\/www.cs.tau.ac.il\/."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"299","DOI":"10.2178\/bsl\/1231081370","article-title":"Natural Axiomatization of Computability and Proof of Church\u2019s Thesis","volume":"14","author":"Dershowitz","year":"2008","journal-title":"Bull. Symbolic Logic"},{"key":"ref_46","unstructured":"Burgin, M. (, 2009). Mathematical Theory of Information Technology. Proceedings of the 8th WSEAS International Conference on Data Networks, Communications, Computers (DNCOCO\u201909), Baltimore, MD, USA."},{"key":"ref_47","unstructured":"Burgin, M. (, 2003). Levels of System Functioning Description: From Algorithm to Program to Technology. Proceedings of the Business and Industry Simulation Symposium, FL, USA."},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Dodig-Crnkovic, G., and Burgin, M. (2011). Information and Computation, World Scientific.","DOI":"10.1142\/7637"},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1080\/17445760500033291","article-title":"Journeys in non-classical computation I: A grand challenge for computing research","volume":"20","author":"Stepney","year":"2005","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"key":"ref_50","doi-asserted-by":"crossref","unstructured":"Zenil, H. (2012). A Computable Universe. In Understanding Computation & Exploring Nature As Computation, World Scientific.","DOI":"10.1142\/8306"},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s11023-011-9235-1","article-title":"Significance of Models of Computation from Turing Model to Natural Computation","volume":"21","year":"2011","journal-title":"Mind. Mach."},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Dodig-Crnkovic, G., and Giovagnoli, R. (2012). Computing Nature, Springer.","DOI":"10.1007\/978-3-642-37225-4"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1016\/j.amc.2009.04.062","article-title":"Physically-relativized Church-Turing Hypotheses","volume":"215","author":"Ziegler","year":"2009","journal-title":"Appl. Math. Comput."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/14\/11\/2066\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T21:53:06Z","timestamp":1760219586000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/14\/11\/2066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,25]]},"references-count":53,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2012,11]]}},"alternative-id":["e14112066"],"URL":"https:\/\/doi.org\/10.3390\/e14112066","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2012,10,25]]}}}