A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Efficient Computation in Groups and Simplicial Complexes
Transactions of the American Mathematical Society
Using HNN extensions of the Boone-Britton group, a group E is obtained which simulates Turing machine computation in linear space and cubic time. Space in E is measured by the length of words, and time by the number of substitutions of defining relators and conjugations by generators required to convert one word to another. The space bound is used to derive a PSPACE-complete problem for a topological model of computation previously used to characterize NP-completeness and RE-completeness.doi:10.2307/1999079 fatcat:h5ogcyo7nzguxhjmgughpjxm54