We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
In this note we give a new representation for closed sets under which the robust zero set of a function is computable. We call this representation the component cover representati...
In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. Firs...