THE ALGEBRAIC INVARIANCE OF THE WORD PROBLEM IN GROUPS,

Abstract

A study of conditions on classes of recursive function sufficient to insure the algebraic invariance of the work problem in finitely generated (f.g.) groups, that is, conditions such that for all f.g. presentations the algorithm solving the word problem resides in the same class. Several proposed classes satisfying these conditions are given and examples of finitely presented groups having word problems for these classes are constructed.

Document Details

Document Type
Technical Report
Publication Date
Oct 19, 1969
Accession Number
AD0704130

Entities

People

  • Frank B. Cannonito

Organizations

  • University of California, Irvine

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Invariance
  • Recursive Functions

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.