Every algorithm which can be executed on a computer can at least in principle be realized in hardware, i.e. by a discrete physical system. The problem is that up to now there is no programming language by which physic...Every algorithm which can be executed on a computer can at least in principle be realized in hardware, i.e. by a discrete physical system. The problem is that up to now there is no programming language by which physical systems can constructively be described. Such tool, however, is essential for the compact description and automatic production of complex systems. This paper introduces a programming language, called Akton-Algebra, which provides the foundation for the complete description of discrete physical systems. The approach originates from the finding that every discrete physical system reduces to a spatiotemporal topological network of nodes, if the functional and metric properties are deleted. A next finding is that there exists a homeomorphism between the topological network and a sequence of symbols representing a program by which the original nodal network can be reconstructed. Providing Akton-Algebra with functionality turns it into a flow-controlled general data processing language, which by introducing clock control and addressing can be further transformed into a classical programming language. Providing Akton-Algebra with metrics, i.e. the shape and size of the components, turns it into a novel hardware system construction language.展开更多
Action is one of the most important concepts in computer science, and situation calculus is the standard formalism for representing and reasoning about actions and their effects. Situation calculus essentially could b...Action is one of the most important concepts in computer science, and situation calculus is the standard formalism for representing and reasoning about actions and their effects. Situation calculus essentially could be presented in a logic framework. Based on the framework LR, such a logic framework is given. Minimal action theory is proposed and studied from the point of view of model theory. By theorems of mathematical logic, some results about the definability about the progression in minimal action theory are obtained.展开更多
文摘Every algorithm which can be executed on a computer can at least in principle be realized in hardware, i.e. by a discrete physical system. The problem is that up to now there is no programming language by which physical systems can constructively be described. Such tool, however, is essential for the compact description and automatic production of complex systems. This paper introduces a programming language, called Akton-Algebra, which provides the foundation for the complete description of discrete physical systems. The approach originates from the finding that every discrete physical system reduces to a spatiotemporal topological network of nodes, if the functional and metric properties are deleted. A next finding is that there exists a homeomorphism between the topological network and a sequence of symbols representing a program by which the original nodal network can be reconstructed. Providing Akton-Algebra with functionality turns it into a flow-controlled general data processing language, which by introducing clock control and addressing can be further transformed into a classical programming language. Providing Akton-Algebra with metrics, i.e. the shape and size of the components, turns it into a novel hardware system construction language.
基金Project supported by the Chinese Postdoctoral Foundation.
文摘Action is one of the most important concepts in computer science, and situation calculus is the standard formalism for representing and reasoning about actions and their effects. Situation calculus essentially could be presented in a logic framework. Based on the framework LR, such a logic framework is given. Minimal action theory is proposed and studied from the point of view of model theory. By theorems of mathematical logic, some results about the definability about the progression in minimal action theory are obtained.
