Related papers: Computing links and accessing arcs
We present an empirical study aimed at analysing the use of viewpoints in an industrial Concurrent Engineering context. Our focus is on the viewpoints expressed in the argumentative process taking place in evaluation meetings. Our results…
Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since…
This is the first of a series of papers in which we study deep computations (ultracomputations) and deep iterates, formalizing the ideas of "asymptotic limit" of computations and compositional iterates, respectively. In this first paper of…
Let $A$ be a, not necessarily closed, linear relation in a Hilbert space $\sH$ with a multivalued part $\mul A$. An operator $B$ in $\sH$ with $\ran B\perp\mul A^{**}$ is said to be an operator part of $A$ when $A=B \hplus (\{0\}\times \mul…
This paper presents graph theoretic conditions for the controllability and accessibility of bilinear systems over the special orthogonal group, the special linear group and the general linear group, respectively, in the presence of drift…
In mathematics curves are typically defined as the images of continuous real functions (parametrizations) defined on a closed interval. They can also be defined as connected one-dimensional compact subsets of points. For simple curves of…
Reachability analysis, in general, is a fundamental method that supports formally-correct synthesis, robust model predictive control, set-based observers, fault detection, invariant computation, and conformance checking, to name but a few.…
To reproduce eScience, several challenges need to be solved: scientific workflows need to be automated; the involved software versions need to be provided in an unambiguous way; input data needs to be easily accessible; High-Performance…
The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic…
For a complete noncompact connected Riemannian manifold with bounded geometry, we prove the existence of isoperimetric regions in a larger space obtained by adding finitely many limit manifolds at infinity. As one of many possible…
This paper deals with the problem of point-to-point reachability in multi-linear systems. These systems consist of a partition of the Euclidean space into a finite number of regions and a constant derivative assigned to each region in the…
The complexity of large-scale distributed systems, particularly when deployed in physical space, calls for new mechanisms to address composability and reusability of collective adaptive behaviour. Computational fields have been proposed as…
A commutative associative algebra A with an identity over the field of real numbers which has a basis, where all elements are invertible, is considered in the work. Moreover, among matrixes consisting of the structure constants of A, there…
This paper studies reachability and null-controllability for difference inclusions involving convex processes. Such difference inclusions arise, for instance, in the study of linear discrete-time systems whose inputs and/or states are…
Any non-affine one-to-one binary gate can be wired together with suitable inputs to give AND, OR, NOT and fan-out gates, and so suffices to construct a general-purpose computer.
We prove a number of elementary facts about computability in partial combinatory algebras (pca's). We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca's. We then discuss separability and…
In extension problems of partial graph drawings one is given an incomplete drawing of an input graph $G$ and is asked to complete the drawing while maintaining certain properties. A prominent area where such problems arise is that of…
This paper bounds the computational cost of computing the Kauffman bracket of a link in terms of the crossing number of that link. Specifically, it is shown that the image of a tangle with $g$ boundary points and $n$ crossings in the…
Some aspects of analysis on disconnected open subsets of the plane with connected fractal boundary are discussed.
We offer an alternative to the conventional network formulation of quantum computing. We advance the analog approach to quantum logic gate/circuit construction. As an illustration, we consider the spatially extended NOT gate as the first…