X hits on this document

95 views

0 shares

0 downloads

0 comments

25 / 40

Proof Sketches

Definitions

Effective vs. ineffective identification

There exists an algorithm for the former but the latter

The former implies the latter

Distinguishability condition: there is no information sequence describing two different languages, i.e., i j I(i)=I(j) i = j

Document info
Document views95
Page views95
Page last viewedThu Dec 08 11:59:45 UTC 2016
Pages40
Paragraphs326
Words1871

Comments