Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Stay, Michael"'
Autor:
Zamfir, Vlad, Calancea, Mihai, Diaconescu, Denisa, Kołowski, Wojciech, Moore, Brandon, Palmskog, Karl, Şerbănuţă, Traian Florin, Stay, Michael, Trufaş, Dafina, Tušil, Jan
Modeling and formally reasoning about distributed systems with faults is a challenging task. To address this problem, we propose the theory of Validating Labeled State transition and Message production systems (VLSMs). The theory of VLSMs provides a
Externí odkaz:
http://arxiv.org/abs/2202.12662
Autor:
Williams, Christian, Stay, Michael
Publikováno v:
EPTCS 372, 2022, pp. 116-132
Native type systems are those in which type constructors are derived from term constructors, as well as the constructors of predicate logic and intuitionistic type theory. We present a method to construct native type systems for a broad class of lang
Externí odkaz:
http://arxiv.org/abs/2102.04672
We introduce Casanova, a leaderless optimistic consensus protocol designed for a permissioned blockchain. Casanova produces blocks in a DAG rather than a chain, and combines voting rounds with block production by singling out individual conflicting t
Externí odkaz:
http://arxiv.org/abs/1812.02232
Autor:
Stay, Michael, Meredith, L. G.
Many term calculi, like lambda calculus or pi calculus, involve binders for names, and the mathematics of bound variable names is subtle. Schoenfinkel introduced the SKI combinator calculus in 1924 to clarify the role of quantified variables in intui
Externí odkaz:
http://arxiv.org/abs/1704.03080
Yoshida demonstrated how to eliminate the bound names coming from the input prefix in the asynchronous pi calculus, but her combinators still depend on the "new" operator to bind names. We modify Yoshida's combinators by replacing "new" and replicati
Externí odkaz:
http://arxiv.org/abs/1703.07054
Autor:
Stay, Michael
Publikováno v:
Theory and Applications of Categories, 31 (2016), 755--798
A compact closed bicategory is a symmetric monoidal bicategory where every object is equipped with a weak dual. The unit and counit satisfy the usual "zig-zag" identities of a compact closed category only up to natural isomorphism, and the isomorphis
Externí odkaz:
http://arxiv.org/abs/1301.1053
Autor:
Calude, Cristian S., Stay, Michael A.
Since many real-world problems arising in the fields of compiler optimisation, automated software engineering, formal proof systems, and so forth are equivalent to the Halting Problem--the most notorious undecidable problem--there is a growing intere
Externí odkaz:
http://arxiv.org/abs/cs/0610153
Autor:
Calude, Cristian S., Stay, Michael A.
We introduce the zeta number, natural halting probability and natural complexity of a Turing machine and we relate them to Chaitin's Omega number, halting probability, and program-size complexity. A classification of Turing machines according to thei
Externí odkaz:
http://arxiv.org/abs/cs/0606033
Autor:
Stay, Michael
Publikováno v:
Journal of Integer Sequences, Vol. 8 (2005), Article 05.1.4
We generalize the concept of a number derivative, and examine one particular instance of a deformed number derivative for finite field elements. We find that the derivative is linear when the deformation is a Frobenius map and go on to examine some o
Externí odkaz:
http://arxiv.org/abs/math/0508364
Autor:
Stay, Michael
Publikováno v:
Fundamenta Informaticae 68 (3) 2005. pp. 231--247
In 1975, Chaitin introduced his celebrated Omega number, the halting probability of a universal Chaitin machine, a universal Turing machine with a prefix-free domain. The Omega number's bits are {\em algorithmically random}--there is no reason the bi
Externí odkaz:
http://arxiv.org/abs/cs/0508056