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

Ker-I Ko (1990)

Details and statistics

DOI:

access: closed

type: Conference or Workshop Paper

metadata version: 2013-01-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics