The Experts below are selected from a list of 24 Experts worldwide ranked by ideXlab platform
Yuri Gurevich - One of the best experts on this subject based on the ideXlab platform.
-
sequential abstract State machines capture sequential algorithms
ACM Transactions on Computational Logic, 2000Co-Authors: Yuri GurevichAbstract:We examine sequential algorithms and formulate a sequential-time Postulate, an abstract-State Postulate, and a bounded-exploration Postulate . Analysis of the Postulates leads us to the notion of sequential abstract-State machine and to the theorem in the title. First we treat sequential algorithms that are deterministic and noninteractive. Then we consider sequential algorithms that may be nondeterministic and that may interact with their environments.
Gurevichyuri - One of the best experts on this subject based on the ideXlab platform.
-
Sequential abstract-State machines capture sequential algorithms
2000Co-Authors: GurevichyuriAbstract:We examine sequential algorithms and formulate a sequential-time Postulate, an abstract-State Postulate, and a bounded-exploration Postulate . Analysis of the Postulates leads us to the notion of s...
Qing Wang - One of the best experts on this subject based on the ideXlab platform.
-
Logical Foundations of Database Transformations for Complex-Value Databases
2010Co-Authors: Qing WangAbstract:Database transformations consist of queries and updates which are two fundamental types of computations in any databases - the first provides the capability to retrieve data and the second is used to maintain databases in light of ever-changing application domains. With the rising popularity of web-based applications and service-oriented architectures, the development of database transformations must address new challenges, which frequently call for establishing a theoretical framework that unifies both queries and updates over complex-value databases. This dissertation aims to lay down the foundations for establishing a theoretical framework of database transformations in the context of complex-value databases. We shall use an approach that has successfully been used for the characterisation of sequential algorithms. The sequential Abstract State Machine (ASM) thesis captures semantics and behaviour of sequential algorithms. The thesis uses the similarity of general computations and database transformations for characterisation of the later by five Postulates: sequential time Postulate, abstract State Postulate, bounded exploration Postulate, background Postulate, and the bounded non-determinism Postulate. The last two Postulates reflect the specific form of transformations for databases. The five Postulates exactly capture database transformations. Furthermore, we provide a logical proof system for database transformations that is sound and complete.
Christine Angela Aidala - One of the best experts on this subject based on the ideXlab platform.
-
The four Postulates of quantum mechanics are three
arXiv: Quantum Physics, 2020Co-Authors: Gabriele Carcassi, Lorenzo Maccone, Christine Angela AidalaAbstract:The tensor product Postulate of quantum mechanics States that the Hilbert space of a composite system is the tensor product of the components' Hilbert spaces. All current formalizations of quantum mechanics that do not contain this Postulate contain some equivalent Postulate or assumption (sometimes hidden). Here we give a natural definition of composite system as a set containing the component systems and show how one can logically derive the tensor product rule from the State Postulate and from the measurement Postulate. In other words, our paper reduces by one the number of Postulates necessary to quantum mechanics.
Gabriele Carcassi - One of the best experts on this subject based on the ideXlab platform.
-
The four Postulates of quantum mechanics are three
arXiv: Quantum Physics, 2020Co-Authors: Gabriele Carcassi, Lorenzo Maccone, Christine Angela AidalaAbstract:The tensor product Postulate of quantum mechanics States that the Hilbert space of a composite system is the tensor product of the components' Hilbert spaces. All current formalizations of quantum mechanics that do not contain this Postulate contain some equivalent Postulate or assumption (sometimes hidden). Here we give a natural definition of composite system as a set containing the component systems and show how one can logically derive the tensor product rule from the State Postulate and from the measurement Postulate. In other words, our paper reduces by one the number of Postulates necessary to quantum mechanics.