English
Related papers

Related papers: Small weakly universal Turing machines

200 papers

We define two extensions of the typed linear lambda-calculus that yield minimal Turing-complete systems. The extensions are based on unbounded recursion in one case, and bounded recursion with minimisation in the other. We show that both…

Logic in Computer Science · Computer Science 2016-11-28 Sandra Alves , Maribel Fernández , Mário Florido , Ian Mackie

The busy beaver value BB(n) is the maximum number of steps made by any n-state, 2-symbol deterministic halting Turing machine starting on blank tape. The busy beaver function $n \mapsto \text{BB}(n)$ is uncomputable and, from below, only 4…

Logic in Computer Science · Computer Science 2024-06-12 Tristan Stérin , Damien Woods

A weak measurement consists in coupling a system to a probe in such a way that constructive interference generates a large output. So far, only the average output of the probe and its variance were studied. Here, the characteristic function…

Quantum Physics · Physics 2012-03-07 Antonio Di Lorenzo

The notion of weak measurement provides a formalism for extracting information from a quantum system in the limit of vanishing disturbance to its state. Here we extend this formalism to the measurement of sequences of observables. When…

Quantum Physics · Physics 2009-11-13 Graeme Mitchison , Richard Jozsa , Sandu Popescu

Four-dimensional strings with the standard model gauge group $SU(3)\times SU(2)\times U(1)$ give model-dependent predictions for the tree level weak mixing-angle. In the presence of an extra pseudo-anomalous gauged- ${U(1)}_X$, the value of…

High Energy Physics - Phenomenology · Physics 2007-05-23 Luis E. Ibanez

Infinite time Turing machine models with tape length $\alpha$, denoted $T_\alpha$, strengthen the machines of Hamkins and Kidder [HL00] with tape length $\omega$. A new phenomenon is that for some countable ordinals $\alpha$, some cells…

Logic · Mathematics 2023-06-22 Merlin Carl , Benjamin Rin , Philipp Schlicht

In this paper, we significantly improve a previous result by the same author showing the existence of a weakly universal cellular automaton with five states living in the hyperbolic 3D-space. Here, we get such a cellular automaton with…

Formal Languages and Automata Theory · Computer Science 2010-03-02 Margenstern Maurice

We investigate the asymptotic Tower Weak Gravity Conjecture in weak coupling limits of open string theories with minimal supersymmetry in four dimensions, focusing for definiteness on gauge theories realized on 7-branes in F-theory.…

High Energy Physics - Theory · Physics 2022-11-11 Cesar Fierro Cota , Alessandro Mininno , Timo Weigand , Max Wiesner

Larger than Life cellular automaton (LtL) is a class of cellular automata and is a generalization of the game of Life by extending its neighborhood radius. We have studied the three-dimensional extension of LtL. In this paper, we show a…

Cellular Automata and Lattice Gases · Physics 2018-03-20 Katsunobu Imai , Kyosuke Oroji , Tomohiro Kubota

The weak values and weak measurement formalism were initially limited to pure states, which were later extended to mixed states, leading to intriguing applications in quantum information processing tasks. Weak values are considered to be…

Quantum Physics · Physics 2025-11-04 Rajendra Singh Bhati

We discuss the power and limitation of various "advice," when it is given particularly to weak computational models of one-tape linear-time Turing machines and one-way finite (state) automata. Of various advice types, we consider…

Formal Languages and Automata Theory · Computer Science 2011-07-21 Tomoyuki Yamakami

Weakly chaotic or weakly interacting systems have a wide regime where the common random matrix theory modeling does not apply. As an example we consider cold atoms in a nearly integrable optical billiard with displaceable wall ("piston").…

Quantum Physics · Physics 2011-07-08 Alexander Stotland , Louis M. Pecora , Doron Cohen

We study an abstract group of reversible Turing machines. In our model, each machine is interpreted as a homeomorphism over a space which represents a tape filled with symbols and a head carrying a state. These homeomorphisms can only…

Group Theory · Mathematics 2023-03-31 Sebastián Barbieri , Jarkko Kari , Ville Salo

Two Turing Machines may be able to answer questions about each other that they cannot answer about themselves.

Logic in Computer Science · Computer Science 2016-10-31 Eric Hehner

We define the class of weakly approximately divisible unital C*-algebras and show that this class is closed under direct sums, direct limits, any tensor product with any C*-algebra, and quotients. A nuclear C*-algebra is weakly…

Operator Algebras · Mathematics 2019-02-20 Don Hadwin , Weihua Li

Infinite time Turing machines are extended in several ways to allow for iterated oracle calls. The expressive power of these machines is discussed and in some cases determined.

Logic · Mathematics 2015-10-05 Robert Lubarsky

To improve the efficiency of the state tomography strategy via weak value, we have searched the optimal coupling strength between the system and measuring device. For an arbitrary d-dimensional quantum system, the optimal strengths being…

Quantum Physics · Physics 2024-02-23 Xuanmin Zhu , Dezheng Zhang , Runping Gao , Qun wei , Lixia Liu , Zijiang Luo

The outcome of a weak quantum measurement conditioned to a subsequent postselection (a weak value protocol) can assume peculiar values. These results cannot be explained in terms of conditional probabilistic outcomes of projective…

Quantum Physics · Physics 2016-05-31 Alessandro Romito , Andrew N. Jordan , Yakir Aharonov , Yuval Gefen

We develop a formal theory of the weak values with emphasis on the consistency conditions and a probabilistic interpretation in the counter-factual processes. We present the condition for the choice of the post-selected state to give a…

Quantum Physics · Physics 2010-08-19 Akio Hosoya , Yutaka Shikano

We give simple proofs, under minimal hypotheses, of the Weak Law of Large Numbers and the Central Limit Theorem for independent identically distributed random variables. These proofs use only the elementary calculus, together with the most…

Probability · Mathematics 2012-07-26 Nicholas Pippenger
‹ Prev 1 4 5 6 7 8 10 Next ›