"Universal computably enumerable sets and initial segment prefix-free ..."

George Barmpalias (2013)

> Home

Details and statistics

DOI: 10.1016/J.IC.2013.12.001

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/Barmpalias13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/Barmpalias13
George Barmpalias:
Universal computably enumerable sets and initial segment prefix-free complexity. Inf. Comput. 233: 41-59 (2013)

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.