"Effectivity and reducibility with ordinal Turing machines."

Merlin Carl (2021)

> Home

Details and statistics

DOI: 10.3233/COM-210307

access: closed

type: Journal Article

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/computability/Carl21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/computability/Carl21
Merlin Carl:
Effectivity and reducibility with ordinal Turing machines. Comput. 10(4): 289-304 (2021)

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.