Search Results - Models of Computation-computability theory

Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory by 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…”
Get full text

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata by Burjons, Elisabet, Frei, Fabian, Raszyk, Martin

“…The question whether P equals NP revolves around the discrepancy between active production and mere verification by Turing machines. In this paper, we examine…”
Get full text

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

“… ". We have 4 interesting examples where we have a quantitative equational theory whose free algebras correspond to well known structures…”
Get full text

A Unifying Approach to the Gamma Question by Monin, Benoit, Nies, Andre

“…" (2013, available at http://www.math.wisc.edu/~lempp/papers/traceable.pdf). It is related to the recent notion of coarse computability which stems from complexity theory…”
Get full text

Normalization for Cubical Type Theory by 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…”
Get full text

History of Logo by Solomon, Cynthia, Harvey, Brian, Kahn, Ken, Lieberman, Henry, Miller, Mark L., Minsky, Margaret, Papert, Artemis, Silverman, Brian

“… Early Lisp served as a model with its symbolic computation, recursive functions, operations on linked lists, and dynamic scoping of variables…”
Get full text

Comonadic semantics for guarded fragments by 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 Ehrenfeucht-Fraïssé…”
Get full text

Feedback Turing Computability, and Turing Computability as Feedback by Ackerman, Nathanael L., Freer, Cameron E., Lubarsky, Robert S.

“…The notion of a feedback query is a natural generalization of choosing for an oracle the set of indices of halting computations. Notice that, in that setting,…”
Get full text

The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems by Barto, Libor, Pinsker, Michael

“…We prove that an ω-categorical core structure primitively positively interprets all finite structures with parameters if and only if some stabilizer of its…”
Get full text

Some constructive variants of S4 with the finite model property by Balbiani, Philippe, Dieguez, Martin, Fernandez-Duque, David

“…The logics CS4 and IS4 are intuitionistic variants of the modal logic S4. Whether the finite model property holds for each of these logics has been a long-standing open problem…”
Get full text

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

“…Whether the number of β -steps in the λ-calculus can be taken as a reasonable time cost model…”
Get full text

Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments by Jung, Jean Christoph, Wolter, Frank

“…In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication. In…”
Get full text

Finite Model Theory of the Triguarded Fragment and Related Logics by Kieronski, Emanuel, Rudolph, Sebastian

“… We show that the TGF has the finite model property (providing a tight doubly exponential bound on the model size…”
Get full text

A distributed operational view of Reversible Prime Event Structures by 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…”
Get full text

Separating Rank Logic from Polynomial Time by Lichter, Moritz

“…In the search for a logic capturing polynomial time the most promising candidates are Choiceless Polynomial Time (CPT) and rank logic. Rank logic extends…”
Get full text

Internal ∞-Categorical Models of Dependent Type Theory : Towards 2LTT Eating HoTT by Kraus, Nicolai

“…Using dependent type theory to formalise the syntax of dependent type theory is a very active topic of study and goes under the name of "type theory eating itself" or "type theory in type theory…”
Get full text

A Quantum Interpretation of Bunched Logic & Quantum Separation Logic by Zhou, Li, Barthe, Gilles, Hsu, Justin, Ying, Mingsheng, Yu, Nengkun

“…We propose a model of the substructural logic of Bunched Implications (BI) that is suitable for reasoning about quantum states…”
Get full text

Evidenced Frames: A Unifying Framework Broadening Realizability Models by Cohen, Liron, Miquey, Etienne, Tate, Ross

“…Constructive foundations have for decades been built upon realizability models for higher-order logic and type theory…”
Get full text

Categorical models of Linear Logic with fixed points of formulas by Ehrhard, Thomas, Jafarrahmani, Farzad

“…) and relations preserving it, least and greatest fixed points have distinct interpretations. This latter model shows…”
Get full text

In search of lost time: Axiomatising parallel composition in process algebras by 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…”
Get full text