X hits on this document

92 views

0 shares

0 downloads

0 comments

28 / 40

Proof Sketches

Theorem

Ineffective identifiability distinguishability

Collapsing uncertainty identification by enumeration gives ineffective identification in the limit for any enumeration

I() is countable plus distinguishability ineffective identification in the limit

Document info
Document views92
Page views92
Page last viewedWed Dec 07 17:48:42 UTC 2016
Pages40
Paragraphs326
Words1871

Comments