scholarly journals Axiomatizing Rectangular Grids with no Extra Non-unary Relations

2020 ◽  
Vol 176 (2) ◽  
pp. 129-138
Author(s):  
Eryk Kopczyński
Keyword(s):  
Cellular Automaton ◽  
Turing Machine ◽  
Binary Relations ◽  
One Dimensional ◽  
First Order ◽  
Finite Models ◽  
Rectangular Grids ◽  
Deterministic Turing Machine

We construct a first-order formula φ such that all finite models of φ are non-narrow rectangular grids without using any binary relations other than the grid neighborship relations. As a corollary, we prove that a set A ⊆ ℕ is a spectrum of a formula which has only planar models if numbers n ∈ A can be recognized by a non-deterministic Turing machine (or a one-dimensional cellular automaton) in time t(n) and space s(n), where t(n)s(n) ≤ n and t(n); s(n) = Ω(log(n)).

scholarly journals THE EFFECT OF OFF-RAMP ON THE ONE-DIMENSIONAL CELLULAR AUTOMATON TRAFFIC FLOW WITH OPEN BOUNDARIES

2004 ◽  
Vol 18 (16) ◽  
pp. 2347-2360 ◽  
Author(s):  
HAMID EZ-ZAHRAOUY ◽  
ZOUBIR BENRIHANE ◽  
ABDELILAH BENYOUSSEF
Keyword(s):  
Cellular Automaton ◽  
Traffic Flow ◽  
Average Density ◽  
Constant Current ◽  
Current Phase ◽  
One Dimensional ◽  
First Order ◽  
Open Boundaries ◽  
Flow Phase ◽  
The One

The effect of the position of the off-ramp (way out), on the traffic flow phase transition is investigated using numerical simulations in the one-dimensional cellular automaton traffic flow model with open boundaries using parallel dynamics. When the off-ramp is located between two critical positions ic1 and ic2 the current increases with the extracting rate β0, for β0<β0c1, and exhibits a plateau (constant current) for β0c1<β0<β0c2 and decreases with β0 for β0>β0c2. However, the density undergoes two successive first order transitions: from high density to plateau current phase at β0=β0c1; and from average density to the low one at β0=β0c2. In the case of two off-ramps located respectively at i1 and i2, these transitions occur only when i2-i1 is smaller than a critical value. Phase diagrams in the (α,β0), (β,β0) and (i1,β0) planes are established. It is found that the transitions between free traffic (FT), congested traffic (CT) and plateau current (PC) phases are of first order. The first order line transition in (i1,β0)-phase diagram terminates by an end point above which the transition disappears.

HOW TO SIMULATE TURING MACHINES BY INVERTIBLE ONE-DIMENSIONAL CELLULAR AUTOMATA

1995 ◽  
Vol 06 (04) ◽  
pp. 395-402 ◽  
Author(s):  
JEAN-CHRISTOPHE DUBACQ
Keyword(s):  
Dynamical Systems ◽  
Cellular Automata ◽  
Cellular Automaton ◽  
Turing Machine ◽  
Turing Machines ◽  
One Dimensional

The issue of testing invertibility of cellular automata has been often discussed. Constructing invertible automata is very useful for simulating invertible dynamical systems, based on local rules. The computation universality of cellular automata has long been positively resolved, and by showing that any cellular automaton could be simulated by an invertible one having a superior dimension, Toffoli proved that invertible cellular automaton of dimension d≥2 were computation-universal. Morita proved that any invertible Turing Machine could be simulated by a one-dimensional invertible cellular automaton, which proved computation-universality of invertible cellular automata. This article shows how to simulate any Turing Machine by an invertible cellular automaton with no loss of time and gives, as a corollary, an easier proof of this result.

Lifelike Self-Replicators

2010 ◽  
pp. 210-247
Author(s):  
Eleonora Bilotta ◽  
Pietro Pantano
Keyword(s):  
Cellular Automaton ◽  
Turing Machine ◽  
Digital Computer ◽  
Initial Conditions ◽  
Von Neumann ◽  
One Dimensional ◽  
Game Of Life ◽  
Universal Computation

The concept of a cellular automaton derives from John von Neumann’s studies of the logic of life. In these studies, von Neumann focused on self-replicating structures with universal computational capabilities. Given the appropriate initial conditions, a universal computer can perform any finite computation, reproducing even the most complex biological behaviors. It is well known that the ECAs described in (Wolfram, 2002) and the Game of Life (Gardner, 1970; Evans, 2003; Adachi et al., 2008) have universal computational capabilities. It has been shown, furthermore, that certain one-dimensional CAs can generate structures that are equivalent to the components of an idealized digital computer, and that, by connecting these components in different ways, it is possible to implement any kind of algorithm. In brief, these CAs are equivalent to the better known - and simpler - Turing machine and share its ability to perform universal computation (Smith 1971).

A NOTE ON THREE-WAY TWO-DIMENSIONAL PROBABILISTIC TURING MACHINES

2000 ◽  
Vol 14 (04) ◽  
pp. 477-500
Author(s):  
TOKIO OKAZAKI ◽  
KATSUSHI INOUE ◽  
AKIRA ITO ◽  
YUE WANG
Keyword(s):  
Turing Machine ◽  
Error Probability ◽  
Finite Automata ◽  
Nondecreasing Function ◽  
Two Dimensional ◽  
Turing Machines ◽  
One Dimensional ◽  
Nondeterministic Finite Automata ◽  
Deterministic Turing Machine ◽  
Function Of Two Variables

This paper introduces a three-way two-dimensional probabilistic Turing machine (tr2-ptm), and investigates several properties of the machine. The tr2-ptm is a two-dimensional probabilistic Turing machine (2-ptm) whose input head can only move left, right, or down, but not up. Let 2-ptms (resp. tr2-ptms) denote a 2-ptm (resp. tr2-ptm) whose input tape is restricted to square ones, and let 2-PTMs(S(n)) (resp. TR2-PTMs(S(n))) denote the class of sets recognized by S(n) space-bounded 2-ptms's (resp. tr2-ptms's) with error probability less than ½, where S(n): N→N is a function of one variable n (= the side-length of input tapes). Let TR2-PTM(L(m,n)) denote the class of sets recognized by L(m,n) space-bounded tr2-ptm's with error probability less than ½, where L(m,n): N2→N is a function of two variables m (= the number of rows of input tapes) and n (= the number of columns of input tapes). The main results of this paper are: (1) 2-NFAs - TR2-PTMs(S(n))≠ϕ for any S(n)=o(log n), where 2-NFAs denotes the class of sets of square tapes accepted by two-dimensional nondeterministic finite automata, (2) TR2-PTMsS(n)[Formula: see text]2-PTMs(S(n)) for any S(n)=o(log n), and (3) for any function g(n)=o(log n) (resp. g(n)=o(log n/log log n)) and any monotonic nondecreasing function f(m) which can be constructed by some one-dimensional deterministic Turing machine, TR2-PTM(f(m)+g(n)) (resp. TR2-PTM(f(m)×g(n))) is not closed under column catenation, column closure, and projection. Additionally, we show that two-dimensional nondeterministic finite automata are equivalent to two-dimensional probabilistic finite automata with one-sided error in accepting power.

scholarly journals Finite representability of semigroups with demonic refinement

2021 ◽  
Vol 82 (2) ◽  
Author(s):  
Robin Hirsch ◽  
Jaš Šemrl
Keyword(s):  
Partial Order ◽  
Turing Machines ◽  
Binary Relations ◽  
Finite Representation ◽  
First Order ◽  
Finite Structures ◽  
Finite Base ◽  
Finite Set ◽  
Finite Representability ◽  
Representation Class

AbstractThe motivation for using demonic calculus for binary relations stems from the behaviour of demonic turing machines, when modelled relationally. Relational composition (; ) models sequential runs of two programs and demonic refinement ($$\sqsubseteq $$ ⊑ ) arises from the partial order given by modeling demonic choice ($$\sqcup $$ ⊔ ) of programs (see below for the formal relational definitions). We prove that the class $$R(\sqsubseteq , ;)$$ R ( ⊑ , ; ) of abstract $$(\le , \circ )$$ ( ≤ , ∘ ) structures isomorphic to a set of binary relations ordered by demonic refinement with composition cannot be axiomatised by any finite set of first-order $$(\le , \circ )$$ ( ≤ , ∘ ) formulas. We provide a fairly simple, infinite, recursive axiomatisation that defines $$R(\sqsubseteq , ;)$$ R ( ⊑ , ; ) . We prove that a finite representable $$(\le , \circ )$$ ( ≤ , ∘ ) structure has a representation over a finite base. This appears to be the first example of a signature for binary relations with composition where the representation class is non-finitely axiomatisable, but where the finite representation property holds for finite structures.

scholarly journals Higher Dimensional Holonomy Map for Rules Submanifolds in Graded Manifolds

2020 ◽  
Vol 8 (1) ◽  
pp. 68-91
Author(s):  
Gianmarco Giovannardi
Keyword(s):  
Characteristic Direction ◽  
Fixed Degree ◽  
One Dimensional ◽  
First Order ◽  
Natural Choice ◽  
Higher Dimensional ◽  
Graded Manifold ◽  
The One ◽  
Graded Manifolds ◽  
Holonomy Map

AbstractThe deformability condition for submanifolds of fixed degree immersed in a graded manifold can be expressed as a system of first order PDEs. In the particular but important case of ruled submanifolds, we introduce a natural choice of coordinates, which allows to deeply simplify the formal expression of the system, and to reduce it to a system of ODEs along a characteristic direction. We introduce a notion of higher dimensional holonomy map in analogy with the one-dimensional case [29], and we provide a characterization for singularities as well as a deformability criterion.

scholarly journals Undecidability in quantum thermalization

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Naoto Shiraishi ◽  
Keiji Matsumoto
Keyword(s):  
Turing Machine ◽  
Thermal Equilibrium ◽  
General Theorem ◽  
Nearest Neighbour ◽  
Many Body ◽  
Initial State ◽  
One Dimensional ◽  
Universal Turing Machine ◽  
Many Body Systems ◽  
Neighbour Interaction

AbstractThe investigation of thermalization in isolated quantum many-body systems has a long history, dating back to the time of developing statistical mechanics. Most quantum many-body systems in nature are considered to thermalize, while some never achieve thermal equilibrium. The central problem is to clarify whether a given system thermalizes, which has been addressed previously, but not resolved. Here, we show that this problem is undecidable. The resulting undecidability even applies when the system is restricted to one-dimensional shift-invariant systems with nearest-neighbour interaction, and the initial state is a fixed product state. We construct a family of Hamiltonians encoding dynamics of a reversible universal Turing machine, where the fate of a relaxation process changes considerably depending on whether the Turing machine halts. Our result indicates that there is no general theorem, algorithm, or systematic procedure determining the presence or absence of thermalization in any given Hamiltonian.

scholarly journals Perturbation Solution for One-Dimensional Flow to a Constant-Pressure Boundary in a Stress-Sensitive Reservoir

2021 ◽  
Author(s):  
Amarjot Singh Bhullar ◽  
Gospel Ezekiel Stewart ◽  
Robert W. Zimmerman
Keyword(s):  
Approximate Solution ◽  
Pore Pressure ◽  
Constant Pressure ◽  
Initial Permeability ◽  
Order Perturbation ◽  
Zeroth Order ◽  
One Dimensional ◽  
First Order ◽  
Outflow Boundary ◽  
Perturbation Solutions

Abstract Most analyses of fluid flow in porous media are conducted under the assumption that the permeability is constant. In some “stress-sensitive” rock formations, however, the variation of permeability with pore fluid pressure is sufficiently large that it needs to be accounted for in the analysis. Accounting for the variation of permeability with pore pressure renders the pressure diffusion equation nonlinear and not amenable to exact analytical solutions. In this paper, the regular perturbation approach is used to develop an approximate solution to the problem of flow to a linear constant-pressure boundary, in a formation whose permeability varies exponentially with pore pressure. The perturbation parameter αD is defined to be the natural logarithm of the ratio of the initial permeability to the permeability at the outflow boundary. The zeroth-order and first-order perturbation solutions are computed, from which the flux at the outflow boundary is found. An effective permeability is then determined such that, when inserted into the analytical solution for the mathematically linear problem, it yields a flux that is exact to at least first order in αD. When compared to numerical solutions of the problem, the result has 5% accuracy out to values of αD of about 2—a much larger range of accuracy than is usually achieved in similar problems. Finally, an explanation is given of why the change of variables proposed by Kikani and Pedrosa, which leads to highly accurate zeroth-order perturbation solutions in radial flow problems, does not yield an accurate result for one-dimensional flow. Article Highlights Approximate solution for flow to a constant-pressure boundary in a porous medium whose permeability varies exponentially with pressure. The predicted flowrate is accurate to within 5% for a wide range of permeability variations. If permeability at boundary is 30% less than initial permeability, flowrate will be 10% less than predicted by constant-permeability model.

scholarly journals NEW L1-GRADIENT TYPE ESTIMATES OF SOLUTIONS TO ONE-DIMENSIONAL QUASILINEAR PARABOLIC SYSTEMS

2010 ◽  
Vol 12 (01) ◽  
pp. 85-106 ◽  
Author(s):  
S. N. ANTONTSEV ◽  
J. I. DÍAZ
Keyword(s):  
Type Equation ◽  
Parabolic Type ◽  
Parabolic Systems ◽  
Diffusion Term ◽  
One Dimensional ◽  
First Order ◽  
Estimates Of Solutions ◽  
Gradient Type ◽  
Degenerate Type ◽  
Parabolic Type Equation

We consider a general class of one-dimensional parabolic systems, mainly coupled in the diffusion term, which, in fact, can be of the degenerate type. We derive some new L1-gradient type estimates for its solutions which are uniform in the sense that they do not depend on the coefficients nor on the size of the spatial domain. We also give some applications of such estimates to gas dynamics, filtration problems, a p-Laplacian parabolic type equation and some first order systems of Hamilton–Jacobi or conservation laws type.

Sign in / Sign up

Export Citation Format

Share Document