{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T04:20:08Z","timestamp":1772252408838,"version":"3.50.1"},"reference-count":33,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T00:00:00Z","timestamp":1615334400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BDCC"],"abstract":"<jats:p>Knowledge processing is an important feature of intelligence in general and artificial intelligence in particular. To develop computing systems working with knowledge, it is necessary to elaborate the means of working with knowledge representations (as opposed to data), because knowledge is an abstract structure. There are different forms of knowledge representations derived from data. One of the basic forms is called a schema, which can belong to one of three classes: operational, descriptive, and representation schemas. The goal of this paper is the development of theoretical and practical tools for processing operational schemas. To achieve this goal, we use schema representations elaborated in the mathematical theory of schemas and use structural machines as a powerful theoretical tool for modeling parallel and concurrent computational processes. We describe the schema of autopoietic machines as physical realizations of structural machines. An autopoietic machine is a technical system capable of regenerating, reproducing, and maintaining itself by production, transformation, and destruction of its components and the networks of processes downstream contained in them. We present the theory and practice of designing and implementing autopoietic machines as information processing structures integrating both symbolic computing and neural networks. Autopoietic machines use knowledge structures containing the behavioral evolution of the system and its interactions with the environment to maintain stability by counteracting fluctuations.<\/jats:p>","DOI":"10.3390\/bdcc5010013","type":"journal-article","created":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T13:27:20Z","timestamp":1615382840000},"page":"13","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["From data Processing to Knowledge Processing: Working with Operational Schemas by Autopoietic Machines"],"prefix":"10.3390","volume":"5","author":[{"given":"Mark","family":"Burgin","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of California, 520 Portola Plaza, Los Angeles, CA 90095, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8762-7070","authenticated-orcid":false,"given":"Rao","family":"Mikkilineni","sequence":"additional","affiliation":[{"name":"Ageno School of Business, Golden Gate University, San Francisco, CA 94105, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,3,10]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Burgin, M. (2010). Theory of Information: Fundamentality, Diversity and Unification, World Scientific.","DOI":"10.1142\/7048"},{"key":"ref_2","unstructured":"Minsky, M. (1986). The Society of Mind, Simon and Schuster."},{"key":"ref_3","unstructured":"Burgin, M. (2016). Theory of Knowledge: Structures and Processes, World Scientific."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Kreowski, H.J., Montanari, U., Orejas, F., Rozenberg, G., and Taentzer, G. (2005). Modules, Brains and Schemas. Formal Methods in Software and Systems Modeling. Lecture Notes in Computer Science, Springer.","DOI":"10.1007\/b106390"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Smith, N.K. (1929). Critique of Pure Reason, Macmillan.","DOI":"10.1007\/978-1-349-00384-6_5"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1093\/brain\/34.2-3.102","article-title":"Sensory Disturbances from Cerebral Lesions","volume":"34","author":"Head","year":"1911","journal-title":"Brain"},{"key":"ref_7","unstructured":"Bartlett, F.C. (1932). Remembering, Cambridge University Press."},{"key":"ref_8","unstructured":"Piaget, J. (1926). The Language and Thought of the Child, Kegan Paul, Trench &Trubner."},{"key":"ref_9","unstructured":"Elmasri, R., and Navathne, S.B. (2000). Fundamentals of Database Systems, Addison-Wesley."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Daum, B. (2003). Modeling Business Objects with XML Schema, Morgan Kauffman.","DOI":"10.1016\/B978-155860816-0\/50007-0"},{"key":"ref_11","unstructured":"Duckett, J., Ozu, N., Williams, K., Mohr, S., Cagle, K., Griffin, O., Francis Norton, F., Stokes-Rees, I., and Tennison, J. (2001). Professional XML Schemas, Wrox Press Ltd."},{"key":"ref_12","unstructured":"Gowri, K. (2001, January 13\u201315). EnrXML\u2013A Schema for Representing Energy Simulation Data. Proceedings of the 7th International IBPSA Conference, Rio de Janeiro, Brazil."},{"key":"ref_13","first-page":"19","article-title":"Mixed Computation in the Class of Recursive Program Schemata","volume":"4","author":"Ershov","year":"1980","journal-title":"Acta Cybern."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/368924.368930","article-title":"On the Equivalence and Transformation of Program Schemes","volume":"1","author":"Ianov","year":"1958","journal-title":"Commun. ACM"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","article-title":"Parallel Program Schemata","volume":"3","author":"Karp","year":"1969","journal-title":"J. Comput. Syst. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321765.321782","article-title":"Parallel Program Schemata and Maximal Parallelism","volume":"20","author":"Keller","year":"1973","journal-title":"JACM"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Dennis, J.B., Fossen, J.B., and Linderman, J.P. (1974). Data Flow Schemes, Springer. LNCS, 19.","DOI":"10.1007\/3-540-06720-5_15"},{"key":"ref_18","unstructured":"Shapiro, S. (1992). Schema Theory. The Encyclopedia of Artificial Intelligence, Wiley-Interscience. [2nd ed.]."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1006\/ceps.1997.0948","article-title":"An Inquiry into the Spontaneous Transfer of Problem-Solving Skill","volume":"22","author":"Price","year":"1997","journal-title":"Contemp. Educ. Psychol."},{"key":"ref_20","unstructured":"Solso, R.L. (1995). Cognitive Psychology, Allyn and Bacon."},{"key":"ref_21","unstructured":"Cole, M.I. (1989). Algorithmic Skeletons, MIT Press."},{"key":"ref_22","unstructured":"Schank, R.C., and Abelson, R.P. (1977). Scripts, Plans. Goals and Understanding, Lawrence Erlbaum Associates."},{"key":"ref_23","unstructured":"Burgin, M. (2005). Mathematical Models in Schema Theory. arXiv."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Burgin, M. (April, January 31). From Craft to Engineering: Software Development and Schema Theory. Proceedings of the 2009 WRI World Congress on Computer Science and Information Engineering (CSIE 2009), WRI, Los Angeles, CA, USA.","DOI":"10.1109\/CSIE.2009.397"},{"key":"ref_25","unstructured":"Burgin, M. (2010, January 24\u201326). Mathematical Schema Theory for Network Design. Proceedings of the ISCA 25th International Conference on Computers and their Applications (CATA-2010), ISCA, Honolulu, HI, USA."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Burgin, M. (2020). Information Processing by Structural Machines, in Theoretical Information Studies: Information in the World, World Scientific.","DOI":"10.1142\/9789813277496_0015"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Mikkilineni, R., and Burgin, M. (2020). Structural Machines as Unconventional Knowledge Processors. Proceedings, 47.","DOI":"10.3390\/proceedings47010026"},{"key":"ref_28","unstructured":"Burgin, M. (2003, January 9\u201311). From Neural Networks to Grid Automata. Proceedings of the IASTED International Conference Modeling and Simulation, Palm Springs, CA, USA."},{"key":"ref_29","unstructured":"Burgin, M. (2002, January 4\u20136). Cluster Computers and Grid Automata. Proceedings of the ISCA 17th International Conference on Computers and Their Applications (CATA-2002), San Francisco, CA, USA."},{"key":"ref_30","unstructured":"Burgin, M. (2005). Super-Recursive Algorithms, Springer."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Burgin, M. (2015, January 7\u201311). Super-Recursive Algorithms and Modes of Computation. Proceedings of the 2015 European Conference on Software Architecture Workshops, Dubrovnik\/Cavtat, Croatia.","DOI":"10.1145\/2797433.2797443"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"16","DOI":"10.26855\/acc.2020.12.003","article-title":"Autopoietic Computing Systems and Triadic Automata: The Theory and Practice","volume":"1","author":"Burgin","year":"2020","journal-title":"Adv. Comput. Commun."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Maturana, H.R., and Varela, F.J. (1980). Autopoiesis and Cognition. The Realization of the Living, Reidel.","DOI":"10.1007\/978-94-009-8947-4"}],"container-title":["Big Data and Cognitive Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2504-2289\/5\/1\/13\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:33:27Z","timestamp":1760160807000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2504-2289\/5\/1\/13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,10]]},"references-count":33,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,3]]}},"alternative-id":["bdcc5010013"],"URL":"https:\/\/doi.org\/10.3390\/bdcc5010013","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints202101.0144.v1","asserted-by":"object"}]},"ISSN":["2504-2289"],"issn-type":[{"value":"2504-2289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,10]]}}}