EMBEDDINGS OF PRIMITIVE RECURSIVE COMPUTABLE GROUPS.

Abstract

The purpose of the paper is to show that the Higman embedding preserves primitive recursive computability. More generally it is shown that for A, a recursively enumberable subset of the natural numbers and G, and A-primitive recursive computable group G can be embedded as an A-primitive recursive decidable subgroup of a finitely presented, A-primitive recursive computable group. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jan 30, 1970
Accession Number
AD0703757

Entities

People

  • Ronald Wallace Gatterdam

Organizations

  • University of California, Irvine

Tags

DTIC Thesaurus Topics

  • Embedding

Fields of Study

  • Mathematics

Readers

  • Graph Algorithms and Convex Optimization.
  • Mathematical Modeling and Probability Theory.