Related papers: Divisibility Theory and Complexity of Algorithms i…
The abstract will be added in due course.
This is an appendix to the Handbook of Tilting Theory, edited by Angeleri-Huegel, Happel and Krause, to be published soon. Part 1 of the appendix provides an outline of the core of tilting theory. Part 2 is devoted to topics where tilting…
We correct mistakes in the paper Kuhlmann, F.-V.: Value groups, residue fields and bad places of rational function fields, Trans. Amer. Math. Soc. 356 (2004) [arXiv:1003.5685] and report on recent new developments which settle cases left…
This paper is an enhanced version of a more than decade-older paper with a similar title. Many formulae involving both finite and infinite sums of digamma and polygamma functions up to quadratic order, few of which appear in standard…
We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a new characterization for regular languages, and a new method to separate…
This paper is now part of the new paper "Series with Hermite polynomials and applications" arXiv:1710.00687.
We design new deterministic and randomized algorithms for computational problems in free solvable groups. In particular, we prove that the word problem and the power problem can be solved in quasi-linear time and the conjugacy problem can…
This is a review article for Encyclopedia of Complexity and System Science, to be published by Springer http://refworks.springer.com/complexity/. The paper reviews statistical models for money, wealth, and income distributions developed in…
Withdrawn; replaced by longer, more detailed paper quant-ph/0010065.
A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…
This book contains a large number of exercises related to different stochastic disciplines. Difficulty of the problems varies from the basic level in the first chapter up to the analysis of articles in Probability, Statistics and Computer…
This note corrects Example 3.2 in Two-Variable Wiman-Valiron Theory and PDEs by the authors which appeared in Ann. Acad. Sci. Fenn Math. (35) (2010), 571-580.
This is my working paper on a proposed logical framework for the practice of mathematics, which is paralleled by philosophical considerations and a computer implementation (a variant of Automath). Updated 10/27/2016 with a version from…
Translation of 'Die Logik Nicht Gleichzeitig Entscheidbarer Aussagen' by Ernst Specker, Dialectica, vol. 14, 239 - 246 (1960).
This article is a semitutorial-style survey of computability logic. An extended online version of it is maintained at http://www.csc.villanova.edu/~japaridz/CL/ .
In this note I make some comments on the review MR2723767 (2011m:03064) appeared in Mathematical Reviews
We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity…
The aim of this text is to provide a linguistically accessible, but comprehensive introduction into a variety of topics in dynamical systems and its applications. Whilst preliminary knowledge of dynamical systems is useful, it is not…
This paper has been withdrawn by the author; a revised version is part of the author's phd-thesis "Quasi-logarithmic structures" (Zurich, 2007).
We consider continuous structures which are obtained from finite dimensional Hilbert spaces over $\mathbb{C}$ by adding some unitary operators. Quantum automata and circuits are naturally interpretable in such structures. We consider…