Related papers: How Pinball Wizards Simulate a Turing Machine
Nonlinear dynamics of a bouncing ball moving vertically in a gravitational field and colliding with a moving limiter is considered and the Poincare map, describing evolution from an impact to the next impact, is described. Displacement of…
Consider a coin tossing experiment which consists of tossing one of two coins at a time, according to a renewal process. The first coin is fair and the second has probability $1/2 + \theta$, $\theta \in [-1/2,1/2]$, $\theta$ unknown but…
This is a preprint of Chapter 2 in the following work: Marta Lewicka, A Course on Tug-of-War Games with Random Noise, 2020, Springer, reproduced with permission of Springer Nature Switzerland AG. We present the basic relation between the…
We first study a $d$-dimensional branching Brownian motion (BBM) among mild Poissonian obstacles, where a random trap field in $\mathbb{R}^d$ is created via a Poisson point process. The trap field consists of balls of fixed radius centered…
We study from a statistical physics perspective the dynamics of a bouncing ball maintained in a chaotic regime thanks to collisions with a plate experiencing an aperiodic vibration. We analyze in details the energy exchanges between the…
The pseudoinverse of a matrix, a generalized notion of the inverse, is of fundamental importance in linear algebra and, thereby, in many different fields. Despite its proven existence, an algorithmic approach is typically necessary to…
Here we present a combinatorial decision problem, inspired by the celebrated quiz show called the countdown, that involves the computation of a given target number T from a set of k randomly chosen integers along with a set of arithmetic…
A random search of a partially absorbing target by a run-and-tumble particle in a confined one-dimensional space is investigated. We analytically obtain the mean searching time, which shows a non-monotonic behavior as a function of the…
We prove PSPACE-completeness of two classic types of Chess problems when generalized to n-by-n boards. A "retrograde" problem asks whether it is possible for a position to be reached from a natural starting position, i.e., whether the…
We investigate the dynamics of a single deformable self-propelled particle which undergoes a spinning motion in a two-dimensional space. Equations of motion are derived from the symmetry argument for three kinds of variables. One is a…
In formal languages and automata theory, the magic number problem can be formulated as follows: for a given integer n, is it possible to find a number d in the range [n,2^n] such that there is no minimal deterministic finite automaton with…
In combinatorial game theory, the winning player for a position in normal play is analyzed and characterized via algebraic operations. Such analyses define a value for each position, called a game value. A game (ruleset) is called universal…
We consider the model describing the vertical motion of a ball falling with constant acceleration on a wall and elastically reflected. The wall is supposed to move in the vertical direction according to a given periodic function $f$. We…
We analyze in detail the so-called "pushing gate" for trapped ions, introducing a time dependent harmonic approximation for the external motion. We show how to extract the average fidelity for the gate from the resulting semi-classical…
We describe an experiment dedicated to the study of the trajectories of a ball bouncing randomly on a vibrating plate. The system was originally used, considering a sinusoidal vibration, to illustrate period doubling and the route to chaos.…
This work stages Foosball as a versatile platform for advancing scientific research, particularly in the realm of robot learning. We present an automated Foosball table along with its corresponding simulated counterpart, showcasing a…
Motivated by the success of bounded model checking framework for finite state machines, Ouaknine and Worrell proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for…
Fast entangling gates have been proposed for trapped ions that are orders of magnitude faster than current implementations. We present here a detailed analysis of the challenges involved in performing a successful fast gate. We show that…
The halting problem for Turing machines is decidable on a set of asymptotic probability one. Specifically, there is a set B of Turing machine programs such that (i) B has asymptotic probability one, so that as the number of states n…
The paper explores known results related to the problem of identifying if a given program terminates on all inputs -- this is a simple generalization of the halting problem. We will see how this problem is related and the notion of proof…