"Terminating Turing Machine Computations and the Complexity and/or ..."

Harry B. Hunt III (1984)

> Home

Details and statistics

DOI: 10.1145/62.2737

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/Hunt84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/Hunt84
Harry B. Hunt III:
Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes. J. ACM 31(2): 299-318 (1984)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.