The Computability of Group Constructions. Part 1
Abstract
The work of Rabin on computable algebra is extended by Cannonito and Gatterdam by applying the Grzegorczyk hierarchy to obtain an improved concept of a computable group. Word problems are shown to be algebraic invariants for computable groups with standard indicies. Higman embedding is covered along with its relationship to the Strong Britton extension. An excellent flow chart is presented to aid the reader in visualizing the relationship the several sections bear to each other.
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 04, 1972
- Accession Number
- AD0740603
Entities
People
- F. B. Cannonito
- R. W. Gatterdam
Organizations
- University of California, Irvine