Suchergebnisse - Models of Computation-computability theory

Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory von 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 …”
Volltext

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata von 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 …”
Volltext

Quantitative Algebraic Reasoning von 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 …”
Volltext

A Unifying Approach to the Gamma Question von 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 …”
Volltext

Normalization for Cubical Type Theory von 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 …”
Volltext

History of Logo von 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 …”
Volltext

Comonadic semantics for guarded fragments von 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é …”
Volltext

Feedback Turing Computability, and Turing Computability as Feedback von 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, …”
Volltext

The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems von 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 …”
Volltext

Some constructive variants of S4 with the finite model property von 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 …”
Volltext

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

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

Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments von 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 …”
Volltext

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

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

A distributed operational view of Reversible Prime Event Structures von 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 …”
Volltext

Separating Rank Logic from Polynomial Time von 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 …”
Volltext

Internal ∞-Categorical Models of Dependent Type Theory : Towards 2LTT Eating HoTT von 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 …”
Volltext

A Quantum Interpretation of Bunched Logic & Quantum Separation Logic von 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 …”
Volltext

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

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

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

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

In search of lost time: Axiomatising parallel composition in process algebras von 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 …”
Volltext