Výsledky vyhľadávania - "Models of computation"

A distributed operational view of Reversible Prime Event Structures Autor Melgratti, Hernan, Mezzina, Claudio Antares, Michele Pinna, G.

“…Reversible prime event structures extend the well-known model of prime event structures to represent reversible computational processes. Essentially, they give…”
Získať plný text

Quantitative Algebraic Reasoning Autor Mardare, Radu, Panangaden, Prakash, Plotkin, Gordon

“…We develop a quantitative analogue of equational reasoning which we call quantitative algebra. We define an equality relation indexed by rationals: a = ε b…”
Získať plný text

In search of lost time: Axiomatising parallel composition in process algebras Autor Aceto, Luca, Anastasiadi, Elli, Castiglioni, Valentina, Ingolfsdottir, Anna, Luttik, Bas

“…This survey reviews some of the most recent achievements in the saga of the axiomatisation of parallel composition, along with some classic results. We focus…”
Získať plný text

Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory Autor Carette, Titouan, de Visme, Marc, Perdrix, Simon

“…Graphical languages, like quantum circuits or ZX-calculus, have been successfully designed to represent (memoryless) quantum computations acting on a finite…”
Získať plný text

Hydrodynamic and symbolic models of computation with advice Autor Cardona, Robert

“…Dynamical systems and physical models defined on idealized continuous phase spaces are known to exhibit non-computable phenomena; examples include the wave…”
Získať plný text

Skywalker: Efficient Alias-Method-Based Graph Sampling and Random Walk on GPUs Autor Wang, Pengyu, Li, Chao, Wang, Jing, Wang, Taolei, Zhang, Lu, Leng, Jingwen, Chen, Quan, Guo, Minyi

“…Graph sampling and random walk operations, capturing the structural properties of graphs, are playing an important role today as we cannot directly adopt…”
Získať plný text

Revisiting the simulation of quantum Turing machines by quantum circuits Autor Molina, Abel, Watrous, John

“…Yao's 1995 publication 'Quantum circuit complexity' in , pp. 352-361, proved that quantum Turing machines and quantum circuits are polynomially equivalent…”
Zistit podrobnosti o prístupe

Normalization for Cubical Type Theory Autor Sterling, Jonathan, Angiuli, Carlo

“…We prove normalization for (univalent, Cartesian) cubical type theory, closing the last major open problem in the syntactic metatheory of cubical type theory…”
Získať plný text

Less is more: multiparty session types revisited Autor Scalas, Alceste, Yoshida, Nobuko

“…Multiparty Session Types (MPST) are a typing discipline ensuring that a message-passing process implements a multiparty session protocol, without errors. In…”
Získať plný text

Turing Tumble is Turing-Complete Autor Pitt, Lenny

“…It is shown that the toy Turing Tumble, suitably extended with an infinitely long game board and unlimited supply of pieces, is Turing-Complete. This is…”
Získať plný text

Compositional Semantics for Probabilistic Programs with Exact Conditioning Autor Stein, Dario, Staton, Sam

“…We define a probabilistic programming language for Gaussian random variables with a first-class exact conditioning construct. We give operational, denotational…”
Získať plný text

Assuming Just Enough Fairness to make Session Types Complete for Lock-freedom Autor Glabbeek, Rob van, Hofner, Peter, Horne, Ross

“…We investigate how different fairness assumptions affect results concerning lock-freedom, a typical liveness property targeted by session type systems. We fix…”
Získať plný text

Guaranteed inference for probabilistic programs: a parallelisable, small-step operational approach Autor Boreale, Michele, Collodi, Luisa

“…In the context of probabilistic programming languages, we put forward an approach to formal semantics and sampling-based inference with guarantees, centered on…”
Získať plný text

Commutative Monads for Probabilistic Programming Languages Autor Jia, Xiaodong, Lindenhovius, Bert, Mislove, Michael, Zamdzhiev, Vladimir

“…A long-standing open problem in the semantics of programming languages supporting probabilistic choice is to find a commutative monad for probability on the…”
Získať plný text

Comonadic semantics for guarded fragments Autor Abramsky, Samson, Marsden, Dan

“…In previous work ([1], [2], [3]), it has been shown how a range of model comparison games which play a central role in finite model theory, including…”
Získať plný text

Asynchronous Template Games and the Gray Tensor Product of 2-Categories Autor Mellies, Paul-Andre

“…In his recent and exploratory work on template games and linear logic, Melliès defines sequential and concurrent games as categories with positions as objects…”
Získať plný text

Quantum relational Hoare logic Autor Unruh, Dominique

“…We present a logic for reasoning about pairs of interactive quantum programs – quantum relational Hoare logic (qRHL). This logic follows the spirit of…”
Získať plný text

Strong Call-by-Value is Reasonable, Implosively Autor Accattoli, Beniamino, Condoluci, Andrea, Coen, Claudio Sacerdoti

“…Whether the number of β -steps in the λ-calculus can be taken as a reasonable time cost model (that is, polynomially related to the one of Turing machines) is…”
Získať plný text

EnQode: Fast Amplitude Embedding for Quantum Machine Learning Using Classical Data Autor Han, Jason, DiBrita, Nicholas S., Cho, Younghyun, Luo, Hengrui, Patel, Tirthak

“…Amplitude embedding (AE) is essential in quantum machine learning (QML) for encoding classical data onto quantum circuits. However, conventional AE methods…”
Získať plný text

Towards Training Robustness Against Dynamic Errors in Quantum Machine Learning Autor Duan, Shijin, Liu, Gaowen, Fleming, Charles, Kompella, Ramana, Xu, Xiaolin, Ren, Shaolei

“…Quantum machine learning, crucial in the noisy intermediate-scale quantum (NISQ) era, confronts challenges in error mitigation. Current noise-aware training…”
Získať plný text