Related papers: Open Problems in Computability Theory and Descript…
This thesis presents a series of theoretical results and practical realisations about the theory of computation in distributive categories. Distributive categories have been proposed as a foundational tool for Computer Science in the last…
In the talk at the workshop my aim was to demonstrate the usefulness of graph techniques for tackling problems that have been studied predominantly as problems on the term level: increasing sharing in functional programs, and addressing…
The notion of computability closure has been introduced for proving the termination of higher-order rewriting with first-order matching by Jean-Pierre Jouannaud and Mitsuhiro Okada in a 1997 draft which later served as a basis for the…
Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can…
These are lecture notes based on the first part of a course on 'Mathematical Data Science', which I taught to final year BSc students in the UK in 2019-2020. Topics include: concentration of measure in high dimensions; Gaussian random…
Correctly applying distributed systems concepts is important for software that seeks to be scalable, reliable and fast. For this reason, Distributed Systems is a course included in many Computer Science programs. To both describe current…
This is the list of open problems in topological algebra posed on the conference dedicated to the 20th anniversary of the Chair of Algebra and Topology of Lviv National University, that was held on 28 September 2001.
We formulate some problems and conjectures about semigroups of rational functions under composition. The considered problems arise in different contexts, but most of them are united by a certain relationship to the concept of amenability.
Cost functions provide a framework for constructions of sets Turing below the halting problem that are close to computable. We carry out a systematic study of cost functions. We relate their algebraic properties to their expressive…
These notes are a short introduction to the mathematical theory of open quantum systems. They are meant to serve as an entry point into a broad research area which has applications across the quantum sciences dealing with systems subjected…
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…
This is a self-contained set of lecture notes covering various aspects of the theory of open quantum system, at a level appropriate for a one-semester graduate course. The main emphasis is on completely positive maps and master equations,…
The computability power of a distributed computing model is determined by the communication media available to the processes, the timing assumptions about processes and communication, and the nature of failures that processes can suffer. In…
The study of semifeasible algorithms was initiated by Selman's work a quarter of century ago [Sel79,Sel81,Sel82]. Informally put, this research stream studies the power of those sets L for which there is a deterministic (or in some cases,…
We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.
This list of 10 problems and their subsequent discussion by prominent scholars at the workshop in Geneva Observatory, 1993, were published in Lecture Notes in Physics, 1994, not too reachable now. The problems cover Theory, Computer…
This volume contains the position papers presented at CSCW 2021 Workshop - Investigating and Mitigating Biases in Crowdsourced Data, held online on 23rd October 2021, at the 24th ACM Conference on Computer-Supported Cooperative Work and…
In May 2015, a conference entitled "Groups, Geometry, and 3-manifolds" was held at the University of California, Berkeley. The organizers asked participants to suggest problems and open questions, related in some way to the subject of the…
This volume contains the proceedings of PLACES 2024, the 15th edition of the Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software. The PLACES workshop series offers a forum for researchers from…