Article ID Journal Published Year Pages File Type
6873878 Information and Computation 2018 23 Pages PDF
Abstract
We construct an incompressible sequence of finite word languages and transfer this and several other results about the complexity of word and tree languages to formal proofs.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
On the compressibility of finite languages and formal proofs
Authors
, ,