Výsledky vyhledávání - Theory of computation Models of computation Computability
-
1
Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…) quantum computations acting on a finite number of qubits. Meanwhile, delayed traces have been used as a graphical way to represent finite-memory computations on streams, in a classical setting…”
Získat plný text
Konferenční příspěvek -
2
From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…The question whether P equals NP revolves around the discrepancy between active production and mere verification by Turing machines. In this paper, we examine…”
Získat plný text
Konferenční příspěvek -
3
Feedback Turing Computability, and Turing Computability as Feedback
ISSN: 1043-6871Vydáno: IEEE 01.07.2015Vydáno v 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (01.07.2015)“…The notion of a feedback query is a natural generalization of choosing for an oracle the set of indices of halting computations…”
Získat plný text
Konferenční příspěvek -
4
A Unifying Approach to the Gamma Question
ISSN: 1043-6871Vydáno: IEEE 01.07.2015Vydáno v 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (01.07.2015)“…" (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…”
Získat plný text
Konferenční příspěvek -
5
Quantitative Algebraic Reasoning
ISBN: 9781450343916, 1450343910Vydáno: New York, NY, USA ACM 05.07.2016Vydáno v Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (05.07.2016)“… ". We have 4 interesting examples where we have a quantitative equational theory whose free algebras correspond to well known structures…”
Získat plný text
Konferenční příspěvek -
6
Comonadic semantics for guarded fragments
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…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é…”
Získat plný text
Konferenční příspěvek -
7
Normalization for Cubical Type Theory
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…We prove normalization for (univalent, Cartesian) cubical type theory, closing the last major open problem in the syntactic metatheory of cubical type theory…”
Získat plný text
Konferenční příspěvek -
8
Axiomatizations and Computability of Weighted Monadic Second-Order Logic
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…Weighted monadic second-order logic is a weighted extension of monadic second-order logic that captures exactly the behaviour of weighted automata. Its…”
Získat plný text
Konferenční příspěvek -
9
Finite Model Theory of the Triguarded Fragment and Related Logics
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“… We show that the TGF has the finite model property (providing a tight doubly exponential bound on the model size…”
Získat plný text
Konferenční příspěvek -
10
Some constructive variants of S4 with the finite model property
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…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…”
Získat plný text
Konferenční příspěvek -
11
Living without Beth and Craig: Definitions and Interpolants in the Guarded and Two-Variable Fragments
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…In logics with the Craig interpolation property (CIP) the existence of an interpolant for an implication follows from the validity of the implication. In…”
Získat plný text
Konferenční příspěvek -
12
In search of lost time: Axiomatising parallel composition in process algebras
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…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ískat plný text
Konferenční příspěvek -
13
Strong Call-by-Value is Reasonable, Implosively
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…Whether the number of β -steps in the λ-calculus can be taken as a reasonable time cost model…”
Získat plný text
Konferenční příspěvek -
14
Internal ∞-Categorical Models of Dependent Type Theory : Towards 2LTT Eating HoTT
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…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…”
Získat plný text
Konferenční příspěvek -
15
Evidenced Frames: A Unifying Framework Broadening Realizability Models
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…Constructive foundations have for decades been built upon realizability models for higher-order logic and type theory…”
Získat plný text
Konferenční příspěvek -
16
A Quantum Interpretation of Bunched Logic & Quantum Separation Logic
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…We propose a model of the substructural logic of Bunched Implications (BI) that is suitable for reasoning about quantum states…”
Získat plný text
Konferenční příspěvek -
17
Categorical models of Linear Logic with fixed points of formulas
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…) and relations preserving it, least and greatest fixed points have distinct interpretations. This latter model shows…”
Získat plný text
Konferenční příspěvek -
18
A distributed operational view of Reversible Prime Event Structures
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…Reversible prime event structures extend the well-known model of prime event structures to represent reversible computational processes…”
Získat plný text
Konferenční příspěvek -
19
On Logics and Homomorphism Closure
Vydáno: IEEE 29.06.2021Vydáno v Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (29.06.2021)“…) of the class of all (finite or arbitrary) models of logical sentences: membership of structures in a sentence's homclosure…”
Získat plný text
Konferenční příspěvek -
20
History of Logo
ISSN: 2475-1421, 2475-1421Vydáno: 14.06.2020Vydáno v Proceedings of ACM on programming languages (14.06.2020)“… Early Lisp served as a model with its symbolic computation, recursive functions, operations on linked lists, and dynamic scoping of variables…”
Získat plný text
Journal Article

