"An enumerable undecidable set with low prefix complexity: a simplified proof"

Nikolai K. Vereshchagin (2001)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2022-09-28

- view
  - electronic edition @ weizmann.ac.il (open access)
- export record
  dblp key:
  - journals/eccc/ECCC-TR01-083
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR01-083
Nikolai K. Vereshchagin:
An enumerable undecidable set with low prefix complexity: a simplified proof. Electron. Colloquium Comput. Complex. TR01 (2001)

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.