Results 1 to 10 of about 907,412 (25)
Theoretical Computer Science, 929C, pp. 172-173, 2022, 2022 Gacs-Kucera Theorem, tightened by Barmpalias and Lewis-Pye, w.t.t.-reduces each infinite sequence to a Kolmogorov--Martin-Lof random one and is broadly used in various Math and CS areas. Its early proofs are somewhat cumbersome, but using some general concepts yields significant simplification illustrated here.
arxiv +1 more source
Decidability of higher-order matching [PDF]
Logical Methods in Computer Science, Volume 5, Issue 3 (July 30,
2009) lmcs:757, 2009 We show that the higher-order matching problem is decidable using a game-theoretic argument.
arxiv +1 more source
Proceedings 11th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science [PDF]
EPTCS 233, 2016, 2016 MEMICS provides a forum for doctoral students interested in applications of mathematical and engineering methods in computer science. Besides a rich technical programme (including invited talks, regular papers, and presentations), MEMICS also offers friendly social activities and exciting opportunities for meeting like-minded people. MEMICS submissions
arxiv +1 more source
Multi-Agent Systems for Computational Economics and Finance [PDF]
, 2022 In this article we survey the main research topics of our group at the University of Essex. Our research interests lie at the intersection of theoretical computer science, artificial intelligence, and economic theory. In particular, we focus on the design and analysis of mechanisms for systems involving multiple strategic agents, both from a ...
arxiv +1 more source
A short proof that adding some permutation rules to $β$ preserves $SN$ [PDF]
, 2010 I show that, if a term is $SN$ for $\beta$, it remains $SN$ when some permutation rules are added.
arxiv +1 more source
Typed Operational Semantics for Dependent Record Types [PDF]
EPTCS 53, 2011, pp. 30-46, 2011 Typed operational semantics is a method developed by H. Goguen to prove meta-theoretic properties of type systems. This paper studies the metatheory of a type system with dependent record types, using the approach of typed operational semantics. In particular, the metatheoretical properties we have proved include strong normalisation, Church-Rosser and
arxiv +1 more source
The number of {1243, 2134}-avoiding permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, vol. 22 no.
2, Permutation Patterns 2019 (March 16, 2023) dmtcs:5287, 2013 We show that the counting sequence for permutations avoiding both of the (classical) patterns 1243 and 2134 has the algebraic generating function supplied by Vaclav Kotesovec for sequence A164651 in The On-Line Encyclopedia of Integer Sequences.
arxiv +1 more source
Permutations avoiding 4321 and 3241 have an algebraic generating function [PDF]
Discrete Mathematics & Theoretical Computer Science, vol. 22 no.
2, Permutation Patterns 2019 (December 13, 2022) dmtcs:5286, 2013 We show that permutations avoiding both of the (classical) patterns 4321 and 3241 have the algebraic generating function conjectured by Vladimir Kruchinin.
arxiv +1 more source
Robin Milner's Work on Concurrency: An Appreciation [PDF]
Electronic Notes in Theoretical Computer Science 265 (2010): 5-10, 2022 We give a short appreciation of Robin Milner's seminal contributions to the theory of concurrency.
arxiv
Visions in Theoretical Computer Science: A Report on the TCS Visioning Workshop 2020 [PDF]
arXiv, 2021 Theoretical computer science (TCS) is a subdiscipline of computer science that studies the mathematical foundations of computational and algorithmic processes and interactions. Work in this field is often recognized by its emphasis on mathematical technique and rigor.
arxiv