On the Complexity of Learning Minimum Time-Bounded Turing Machines

Ker-I Ko. On the Complexity of Learning Minimum Time-Bounded Turing Machines. SIAM Journal on Computing, 20(5):962-986, 1991.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.