Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA new version of Tooms proof
61
0
0.0
(
0
)
Added by
Peter Gacs
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Authors
Peter Gacs
Ask ChatGPT about the research
No Arabic abstract
There are several proofs now for the stability of Tooms example of a two-dimensional stable cellular automaton and its application to fault-tolerant computation. Simon and Berman simplified and strengthened Tooms original proof: the present report is a simplified exposition of their proof.
rate research
Read More
We present a very simple new bijective proof of Cayleys formula. The bijection is useful for the analysis of random trees, and we explain some of the ways in which it can be used to derive probabilistic identities, bounds, and growth procedures for such trees. We also introduce a partial order on the degree sequences of rooted trees, and conjecture that it induces a stochastic partial order on heights of random rooted trees with given degrees.
We give a short proof of a theorem of J.-E. Pin (theorem 1.1 below), which can be found in his thesis.
The new multipurpose event-generation framework SHERPA, acronym for Simulation for High-Energy Reactions of PArticles, is presented. It is entirely written in the object-oriented programming language C++. In its current form, it is able to completely simulate electron--positron and unresolved photon--photon collisions at high energies. Also, fully hadronic collisions, such as, e.g., proton--anti-proton, proton--proton, or resolved photon--photon reactions, can be described on the signal level.
We provide a direct proof of Agafonovs theorem which states that finite state selection preserves normality. We also extends this result to the more general setting of shifts of finite type by defining selections which are compatible the shift. A slightly more general statement is obtained as we show that any Markov measure is preserved by finite state compatible selection.
Recently Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li and Frank Stephan proposed a quasi-polynomial time algorithm for parity games. This paper proposes a short proof of correctness of their algorithm.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
