X hits on this document

127 views

0 shares

0 downloads

0 comments

27 / 40

Proof Sketches

Identification by enumeration An enumeration is an onto function  (this assumes is countable). At time t we find the first in that is in t. In the limit we return the name of the only element left in t, if collapsing uncertainty condition holds. To make this effective we need

an effective procedure to test (n) t

an effective procedure to find a name of (n)

Document info
Document views127
Page views127
Page last viewedFri Jan 20 08:31:16 UTC 2017
Pages40
Paragraphs326
Words1871

Comments