Abstract
Knowledge systems often have very sophisticated structures depicting cognitive andstructural entities. For instance, representation of knowledge in the form of a text involves thestructure of this text. This structure is represented by a hypertext, which is networks consisting oflinguistic objects, such as words, phrases and sentences, with diverse links connecting them.Current computational machines and automata such as Turing machines process information inthe form of symbol sequences. Here we discuss based the methods of structural machinesachieving higher flexibility and efficiency of information processing in comparison with regularmodels of computation. Being structurally universal abstract automata, structural machines allowworking directly with knowledge structures formed by knowledge objects and connectionsbetween them.
Highlights
Many philosophers, mathematicians and scientists have attempted to define knowledge and its relationship to information and its processing
Structural machines work with knowledge structures of arbitrary order transforming, elements of these structures or the content of these elements as conventional models of computation do, and relations of different orders in the processed structures
It is important to observe that when the controller is an operator, the processor is a stored program implementation of a Turing machine, the processing space is the memory, and the knowledge structures are symbolic data structures, we obtain the current state-of-the-art information-processing structure
Summary
Mathematicians and scientists have attempted to define knowledge and its relationship to information and its processing. It imitates biological systems collaborating with an apparatus that processes algorithms analogous to a gene where knowledge is encoded in DNA structures. They perform computations with more advanced data structures such as arrays and collections of arrays This was not enough, and to improve efficiency and allow processing of symbols and links between them, more advanced automata, such as Kolmogorov algorithms storage modification machines and relational machines were developed. Structural machines work with knowledge structures of arbitrary order transforming, elements of these structures or the content of these elements as conventional models of computation do, and relations of different orders in the processed structures This allows achieving higher flexibility and efficiency in comparison with regular models of computation, including both conventional and unconventional computing systems.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
