X hits on this document

84 views

0 shares

0 downloads

0 comments

21 / 40

Learnability Models

Two naming relations

Tester (comprehensive/analysis): a binary decision procedure (TM) – 1(0) if the input string is (not) in .

Generator (productive/generation): a TM generating a string in given an input integer.

A tester exists to test a recursive language, a generator exists to generate RE language.

It is possible to translate from testers to generators, but not vice versa if testers are identifiable than so are the corresponding generators, but not vice versa, e.g., anomalous text.

Document info
Document views84
Page views84
Page last viewedSun Dec 04 10:09:29 UTC 2016
Pages40
Paragraphs326
Words1871

Comments