Related papers: Theory of processes
In this note, we survey some elementary theorems and proofs concerning dynamical matrices theory. Some mathematical concepts and results involved in quantum information theory are reviewed. A little new result on the matrix representation…
Process theories provide a powerful framework for describing compositional structures across diverse fields, from quantum mechanics to computational linguistics. Traditionally, they have been formalized using symmetric monoidal categories…
The Curry-Howard correspondence is about a relationship between types and programs on the one hand and propositions and proofs on the other. The implications for programming language design and program verification is an active field of…
The precise control of complex quantum systems promises numerous technological applications including digital quantum computing. The complexity of such devices renders the certification of their correct functioning a challenge. To address…
This article aims to explain essential elements of perturbation theory and their conceptual underpinnings. It is not meant as a summary of popular perturbation methods, though some illustrative examples are given to underline the main…
Process Philosophy endeavours to replace the classical ontology of substances by a process ontology centered on notions of changes and transitions. We argue, that the substantial and processual approach are mutually complementary. Here,…
Using process algebra, this paper describes the formalisation of the process/semantics behind the purely event-driven programming language.
This is a reflection on the author's experience in teaching logic at the graduate level in a computer science department. The main lesson is that model building and the process of modelling must be placed at the centre stage of logic…
Biological organisms are composed of numerous interconnected biochemical processes. Diseases occur when normal functionality of these processes is disrupted. Thus, understanding these biochemical processes and their interrelationships is a…
The purpose of testing a system with respect to a requirement is to refute the hypothesis that the system satisfies the requirement. We build a theory of tests and refutation based on the elementary notions of satisfaction and refinement.…
Measurements are shown to be processes designed to return figures: they are effective. This effectivity allows for a formalization as Turing machines, which can be described employing computation theory. Inspired in the halting problem we…
Most work on scholarly document processing assumes that the information processed is trustworthy and factually correct. However, this is not always the case. There are two core challenges, which should be addressed: 1) ensuring that…
We formalize the general principle of significance with respect to binary relations which is a universal tool for description and analysis of various situations in and apart from mathematics. We derive the basic properties and focus on a…
Introduction to the theory of decoherence. Contents: 1. The phenomenon of decoherence: superpositions, superselection rules, decoherence by "measurements". 2. Observables as a derivable concept. 3. The measurement problem. 4. Density…
In logic there is a clear concept of what constitutes a proof and what not. A proof is essentially defined as a finite sequence of formulae which are either axioms or derived by proof rules from formulae earlier in the sequence.…
General acceptance of a mathematical proposition $P$ as a theorem requires convincing evidence that a proof of $P$ exists. But what constitutes "convincing evidence?" I will argue that, given the types of evidence that are currently…
While proof is a central component of postsecondary mathematical study, proof construction has historically posed significant difficulties for students who intend to earn mathematics degrees at the undergraduate level. This work is…
Despite significant developments in Proof Theory, surprisingly little attention has been devoted to the concept of proof verifier. In particular, the mathematical community may be interested in studying different types of proof verifiers…
Theoretical computer science discusses foundational issues about computations. It asks and answers questions such as "What is a computation?", "What is computable?", "What is efficiently computable?","What is information?", "What is…
Software Engineering often adapts theory-building frameworks from the social sciences to address socio-technical complexity. The key phases of the theory-building process are conceptual development, operationalization, testing, and…