X hits on this document

130 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 views130
Page views130
Page last viewedFri Jan 20 20:43:11 UTC 2017
Pages40
Paragraphs326
Words1871

Comments