Related papers: Computer Art in the Former Soviet Bloc
This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including…
There has been a remarkable increase in work at the interface of computer science and game theory in the past decade. In this article I survey some of the main themes of work in the area, with a focus on the work in computer science. Given…
We investigate the computational power of particle methods, a well-established class of algorit hms with applications in scientific computing and computer simulation. The computational power of a compute model determines the class of…
Section headings: 1 Qubits, gates and networks 2 Quantum arithmetic and function evaluations 3 Algorithms and their complexity 4 From interferometers to computers 5 The first quantum algorithms 6 Quantum search 7 Optimal phase estimation 8…
A view on the history and current status of dark matter and dark energy, at a fairly introductory level.
The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic…
In computability theory and computable analysis, finite programs can compute infinite objects. Presenting a computable object via any program for it, provides at least as much information as presenting the object itself, written on an…
This is a short introduction to quantum computers, quantum algorithms and quantum error correcting codes. Familiarity with the principles of quantum theory is assumed. Emphasis is put on a concise presentation of the principles avoiding…
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
The HCI community has called for renewed attention to labor issues and the political economy of computing. Yet much work remains in engaging with labor theory to better understand modern work and workers. This article traces the development…
In this exposition, I discuss several developments in the theory of vertex operator algebras, and I include motivation for the definition.
In this paper we focus on the beginning of publication of the Large Soviet Encyclopedia, launched in 1925. We present the context of this launching and explain why it was tightly connected to the period of the New Economical Policy. In a…
This Master's Thesis analyzes thoroughly the topic of the Mathematics Education in Russia and Mathematical Circles. It deals with the historical context of the Mathematics Education in Russia in the XVIIIth, XIXth and XXth centuries; the…
In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (interactive) computational problems as games played by a…
Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented…
This is an English translation of the following paper, published several years ago: Nikonorov Yu.G. On a characterization of critical points of the scalar curvature functional (Russian), Tr. Rubtsovsk. Ind. Inst., 7, 211-217 (2000), Zbl.…
The present note sketches a theory of constructs.
In this paper, we introduce iART: an open Web platform for art-historical research that facilitates the process of comparative vision. The system integrates various machine learning techniques for keyword- and content-based image retrieval…
This book discusses computational curiosity, from the psychology of curiosity to the computational models of curiosity, and then showcases several interesting applications of computational curiosity. A brief overview of the book is given as…
This is a survey paper of the theory of crystal bases, global bases and the cluster algebra structure on the quantum coordinate rings.