"On the Complexity of Learning Minimum Time-Bounded Turing Machines."

Ker-I Ko (1991)

> Home

Details and statistics

DOI: 10.1137/0220059

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/Ko91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/Ko91
Ker-I Ko:
On the Complexity of Learning Minimum Time-Bounded Turing Machines. SIAM J. Comput. 20(5): 962-986 (1991)

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.