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

Ker-I Ko (1990)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2013-01-02

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/colt/Ko90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/colt/Ko90
Ker-I Ko:
On the Complexity of Learning Minimum Time-Bounded Turing Machines. COLT 1990: 82-96

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.