Related papers: Predicatively unprovable termination of the Ackerm…
We consider the product of infinitely many copies of a spin-$1\over 2$ system. We construct projection operators on the corresponding nonseparable Hilbert space which measure whether the outcome of an infinite sequence of $\sigma^x$…
Given a two-sided noetherian ring $A$ with a dualizing complex, we show that the big finitistic dimension of $A$ is finite if and only if every bounded below Gorenstein-projective-acyclic cochain complex of Gorenstein-projective $A$-modules…
We study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…
The Hofstadter Q-sequence, with its simple definition, has defied all attempts at analyzing its behavior. Defined by a simple nested recurrence and an initial condition, the sequence looks approximately linear, though with a lot of noise.…
We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…
Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs. Unfortunately, such discrete counters often lead to…
The predicate complementary to the well-known Godel's provability predicate is defined. From its recursiveness new consequences concerning the incompleteness argumentation are drawn and extended to new results of consistency, completeness…
This is a survey of results about permanental processes, real valued positive processes which are a generalization of squares of Gaussian processes. In a certain sense the symmetric positive definite function that determines a Gaussian…
In this paper, we argue that formal systems of first order Arithmetic that admit Goedelian undecidable propositions validly are abnormally non-constructive. We argue that, in such systems, the strong representation of primitive recursive…
We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…
Remarks on the Cantor's nondenumerability proof of 1891 that the real numbers are noncountable will be given. By the Cantor's diagonal procedure, it is not possible to build numbers that are different from all numbers in a general assumed…
In this work we present a model for computation of random processes in digital computers which solves the problem of periodic sequences and hidden errors produced by correlations. We show that systems with non-invertible non-linearities can…
The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…
Deciding termination is a fundamental problem in the analysis of probabilistic imperative programs. We consider the qualitative and quantitative probabilistic termination problems for an imperative programming model with discrete…
Stricker's theorem states that a Gaussian process is a semimartingale in its natural filtration if and only if it is the sum of an independent increment Gaussian process and a Gaussian process of finite variation, see [1983, Z. Wahrsch.…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
Gaussian processes retain the linear model either as a special case, or in the limit. We show how this relationship can be exploited when the data are at least partially linear. However from the perspective of the Bayesian posterior, the…
The ordered structures of natural, integer, rational and real numbers are studied in this thesis. The theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language of order…
We introduce a system of monadic affine sized types, which substantially generalise usual sized types, and allows this way to capture probabilistic higher-order programs which terminate almost surely. Going beyond plain, strong…
Over each nontrivial finite group $G$, there exists a finite system of equations having no solutions in larger finite groups but having a solution in a periodic group containing $G$. We prove several similar facts about amenable, orderable,…