Search Results - "Theory of computation Models of computation Computability"

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

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

“…The Gamma question was formulated by Andrews et al. In "Asymptotic density, computable trace ability and 1-randomness" (2013, available at…”
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

Turing's Password: What Internet Cannot Leak by Levin, L. A.

“…Summary form only given. I use a revised, more robust, notion of computability to answer bothersome questions that are not even easy to ask with any clarity…”
Get full text

Quantitative Algebraic Reasoning by 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…”
Get full text

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

“…Logo is more than a programming language. It is a learning environment where children explore mathematical ideas and create projects of their own design. Logo,…”
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

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

Discovering High-Value Information from Crowdsourcing by Zhao, Ying, MacKinnon, Douglas J., Zhou, Charles C.

“…We will demonstrate a distributed recursive method, i.e., Lexical Link Analysis (LLA) and an infrastructure, i.e., Collaborative Learning Agents (CLA) to…”
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…”
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 (that is, polynomially related to the one of Turing machines) is…”
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

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…”
Get full text

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

“…The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments…”
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

Interacting Frobenius Algebras are Hopf by Duncan, Ross, Dunne, Kevin

“…Theories featuring the interaction between a Frobenius algebra and a Hopf algebra have recently appeared in several areas in computer science: concurrent…”
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. Essentially, they give…”
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. In our model, the separating…”
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. However, traditional realizability…”
Get full text