"Definability of Recursively Enumerable Sets in Abstract Computational ..."

Robert E. Byerly (1984)

> Home

Details and statistics

DOI: 10.1002/MALQ.19840303202

access: closed

type: Journal Article

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mlq/Byerly84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mlq/Byerly84
Robert E. Byerly:
Definability of Recursively Enumerable Sets in Abstract Computational Complexity Theory. Math. Log. Q. 30(32-34): 499-503 (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.