English
Related papers

Related papers: Natural Halting Probabilities, Partial Randomness,…

200 papers

The special uniformity of zeta functions claims that pure non-abelian zeta functions coincide with group zeta functions associated to the special linear groups. Naturally associated are three aspects, namely, the analytic, arithmetic, and…

Algebraic Geometry · Mathematics 2012-03-13 Lin Weng

Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by…

Formal Languages and Automata Theory · Computer Science 2010-06-09 Miklós Bartha

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

Logic · Mathematics 2026-02-11 Peter Hertling , Rupert Hölzl , Philip Janicki

We generalize the classical probability frame by adopting a wider family of random variables that includes nondeterministic ones. The frame that emerges is known to host a ''classical'' extension of quantum mechanics. We discuss the notion…

Quantum Physics · Physics 2007-05-23 E. G. Beltrametti , S. Bugajski

Let $\Theta$ be a finite alphabet. We consider a bundle of measure preserving transformations $(T_{\theta})_{\theta \in \Theta}$ acting on a probability space $(X,\mu)$, which are chosen randomly according to an ergodic stochastic process…

Dynamical Systems · Mathematics 2022-09-01 Elias Zimmermann

In this paper, we have compared r.e. sets based on their enumeration orders with Turing machines. Accordingly, we have defined novel concept uniformity for Turing machines and r.e. sets and have studied some relationships between uniformity…

Formal Languages and Automata Theory · Computer Science 2010-02-03 Ali Akbar Safilian , Farzad Didehvar

We study the computational complexity theory of smooth, finite-dimensional dynamical systems. Building off of previous work, we give definitions for what it means for a smooth dynamical system to simulate a Turing machine. We then show that…

Computational Complexity · Computer Science 2024-09-19 Jordan Cotler , Semon Rezchikov

Dynamical Systems theory generally deals with fixed point iterations of continuous functions. Computation by Turing machine although is a fixed point iteration but is not continuous. This specific category of fixed point iterations can only…

Other Computer Science · Computer Science 2014-10-31 Nabarun Mondal , Partha P. Ghosh

We describe a construction of random meromorphic functions with prescribed simple poles with unit residues at a given stationary point process. We characterize those stationary processes with finite second moment for which, after…

Probability · Mathematics 2023-10-24 Mikhail Sodin , Aron Wennman , Oren Yakir

We prove a functional limit theorem in a space of analytic functions for the random Dirichlet series $D(\alpha;z)=\sum_{n\geq 2}(\log n)^{\alpha}(\eta_n+{\rm i} \theta_n)/n^z$, properly scaled and normalized, where…

Probability · Mathematics 2022-11-02 Dariusz Buraczewski , Congzao Dong , Alexander Iksanov , Alexander Marynych

Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Krishnendu Chatterjee , Thomas A. Henzinger , Jan Otop

Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the…

Cellular Automata and Lattice Gases · Physics 2007-05-23 Andres Moreira

In this paper, we present two new representations of the alternating Zeta function. We show that for any s $\in$ C this function can be computed as a limit of a series of determinant. We then express these determinants as the expectation of…

Classical Analysis and ODEs · Mathematics 2022-03-21 Serge Iovleff

We prove that a random automaton with $n$ states and any fixed non-singleton alphabet is synchronizing with high probability (modulo an unpublished result about unique highest trees of random graphs). Moreover, we also prove that the…

Formal Languages and Automata Theory · Computer Science 2024-07-10 Mikhail V. Berlinkov

Universality in cellular automata theory is a central problem studied and developed from their origins by John von Neumann. In this paper, we present an algorithm where any Turing machine can be converted to one-dimensional cellular…

Cellular Automata and Lattice Gases · Physics 2019-07-10 Sergio J. Martinez , Ivan M. Mendoza , Genaro J. Martinez , Shigeru Ninagawa

We consider the alternating zeta function and the alternating $L$-function of a graph $G$, and express them by using the Ihara zeta function of $G$. Next, we define a generalized alternating zeta function of a graph, and express the…

Combinatorics · Mathematics 2023-02-21 Takashi Komatsu , Norio Konno , Iwao Sato

Wolfram has provided a qualitative classification of cellular automata(CA) rules according to which, there exits a class of CA rules (called Class 4) which exhibit complex pattern formation and long-lived dynamical activity (long…

Condensed Matter · Physics 2015-06-25 Avinash Dhar , Porus Lakdawala , Gautam Mandal , Spenta R. Wadia

We give a new type of mixed discrete joint universality properties, which is satisfied by a wide class of zeta-functions. We study the universality for a certain modification of a Matsumoto zeta-function and a periodic Hurwitz zeta-function…

Number Theory · Mathematics 2018-08-14 Roma Kacinskaite , Kohji Matsumoto

A denotational semantics of quantum Turing machines having a quantum control is defined in the dagger compact closed category of finite dimensional Hilbert spaces. Using the Moore-Penrose generalized inverse, a new additive trace is…

Quantum Physics · Physics 2014-04-02 Miklós Bartha

Riemann zeta function is an important object of number theory. It was also used for description of disordered systems in statistical mechanics. We show that Riemann zeta function is also useful for the description of integrable model. We…

High Energy Physics - Theory · Physics 2008-11-26 H. E. Boos , V. E. Korepin