Reachability is Tower Complete
arXiv:2003.06077
Abstract
A complete characterization of the complexity of the reachability problem for vector addition system has been open for a long time. The problem is shown to be Tower complete.
We apply to with draw this paper because there is a fatal error. At the moment we do not know how correct the mistake