Related papers: On properties of $B$-terms
The main scientific heritage of Corrado B\"ohm consists of ideas about computing, concerning concrete algorithms, as well as models of computability. The following will be presented. 1. A compiler that can compile itself. 2. Structured…
In the spectral theory of non-self-adjoint operators there is a well-known operation of product of operator colligations. Many similar operations appear in the theory of infinite-dimensional groups as multiplications of double cosets. We…
For an arbitrary Euclidean building we define a certain combing, which satisfies the `fellow traveller property' and admits a recursive definition. Using this combing we prove that any group acting freely, cocompactly and by order…
The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed…
We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form'…
Generation and prediction of time series is analyzed for the case of a Bit-Generator: a perceptron where in each time step the input units are shifted one bit to the right with the state of the leftmost input unit set equal to the output…
Given two C*-algebras A and B, abstract A-B bimodules that can be isometrically represented as operator bimodules are characterised in terms of their norm. Various properties of such bimodules are given. Their theory is very similar to…
We study the hypercyclic, supercyclic and cyclic properties of composition operator $C_{\phi}$ on the Segal-Bargmann space $\mathscr{H}(\mathscr{E})$, where $\phi (z)=Az+b$, $A\in \mathcal{B}(\mathscr{E})$, $b\in \mathscr{E}$ with…
Let A be a class of objects, equipped with an integer size such that for all n the number a(n) of objects of size n is finite. We are interested in the case where the generating fucntion sum_n a(n) t^n is rational, or more generally…
Static verification relying on an automated theorem prover can be very slow and brittle: since static verification is undecidable, correct code may not pass a particular static verifier. In this work we use metaprogramming to generate code…
Combinatorial enumeration leads to counting generating functions presenting a wide variety of analytic types. Properties of generating functions at singularities encode valuable information regarding asymptotic counting and limit…
Theoretical foundations of compositional reasoning about heaps in imperative programming languages are investigated. We introduce a novel concept of compositional symbolic memory and its relevant properties. We utilize these formal…
We give a new proof of the Brawley-Carlitz theorem on irreducibility of the composed products of irreducible polynomials. Our proof shows that associativity of the binary operation for the composed product is not necessary. We then…
Let $H(\mathbb{C})$ be the set of all entire functions endowed with the topology of uniform convergence on compact sets. Let $\lambda,b\in\mathbb{C}$, let $C_{\lambda,b}:H(\mathbb{C})\to H(\mathbb{C})$ be the composition operator…
We introduce a set of eight universal Rules of Inference by which computer programs with known properties (axioms) are transformed into new programs with known properties (theorems). Axioms are presented to formalize a segment of Number…
The central open question in Descriptive Complexity is whether there is a logic that characterizes deterministic polynomial time (PTIME) on relational structures. Towards this goal, we define a logic that is obtained from first-order logic…
A B-group is a group such that all its minimal generating sets (with respect to inclusion) have the same size. We prove that the class of finite B-groups is closed under taking quotients and that every finite B-group is solvable. Via a…
Circuit representations are becoming the lingua franca to express and reason about tractable generative and discriminative models. In this paper, we show how complex inference scenarios for these models that commonly arise in machine…
We present a new type system with support for proofs of programs in a call-by-value language with control operators. The proof mechanism relies on observational equivalence of (untyped) programs. It appears in two type constructors, which…
We investigate completeness and parametricity for a general class of realizability semantics for System F defined in terms of closure operators over sets of $\lambda$-terms. This class includes most semantics used for normalization…