BibTeX
@MISC{Puleo_reconfigurablesystems,
author = {Gregory Puleo},
title = {RECONFIGURABLE SYSTEMS AND INTRACTABILITY},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Ghrist and Peterson [4] have investigated the properties of a cer-tain general class of reconfigurable systems, with an eye to practical appli-cation. We show that in the general case, these reconfigurable systems are powerful enough to represent the rewriting rules of finitely presented groups, and therefore fall prey to the existence of finitely presented groups with un-solvable word problem. 1.
