Consider a gambler who observes a sequence of independent, non-negative random
numbers and is allowed to stop the sequence at any time, claiming a reward equal to the …

Neurosymbolic programming combines the otherwise complementary worlds of deep
learning and symbolic reasoning. It thereby enables more accurate, interpretable, and …

We first give an introduction to the field of tile-based self-assembly, focusing primarily on
theoretical models and their algorithmic nature. We start with a description of Winfree's …

Theory of algorithmic self-assembly Page 1 78 communications of the acm | december 2012 |
vol. 55 | no. 12 review articles PHO T O g RAPH B Y ZUBEIR TAI seLF-asseMBLY is the process …

We prove that the abstract Tile Assembly Model (aTAM) of nanoscale self-assembly is
intrinsically universal. This means that there is a single tile assembly system U that, with …

Consider a gambler who observes a sequence of independent random numbers and is
allowed to stop at any time, claiming reward equal to the most recent observation. The …

We investigate the power of the Wang tile self-assembly model at temperature 1, a threshold
value that permits attachment between any two tiles that share even a single bond. When …

We present two fast algorithms which apply inclusion–exclusion principle to sum over the
bosonic diagrams in bare diagrammatic quantum Monte Carlo and inchworm Monte Carlo …

In this work we propose a generalization of Winfree's abstract Tile Assembly Model (aTAM)
in which tile types are assigned rigid shapes, or geometries, along each tile face. We …

Working in Winfree's abstract tile assembly model, we show that a constant-sized tile
assembly system can be programmed through relative tile concentrations to build an n*n …