"Enumerable Classes of Total Recursive Functions: Complexity of Inductive ..."

Andris Ambainis, Juris Smotrovs (1994)

> Home

Details and statistics

DOI: 10.1007/3-540-58520-6_50

access: closed

type: Conference or Workshop Paper

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/alt/AmbainisS94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/alt/AmbainisS94
Andris Ambainis, Juris Smotrovs:
Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference. AII/ALT 1994: 10-25

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.