X hits on this document

126 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 views126
Page views126
Page last viewedFri Jan 20 08:22:09 UTC 2017
Pages40
Paragraphs326
Words1871

Comments