Conjecture 3
Recognition
1
Total of words is finite at a certain time.
2
Total of being generated sentences is infinite at a certain time.
3
Recognition of total words is practical for its finiteness.
4
Recognition of total of being generated sentences is uncertain for its infinity.
5
For guarantee of recognition of words and sentences, finiteness is indispensable condition.
6
From the viewpoint of guarantee of recognition, uncertainty of total’s infinity at sentences is demanded.
7
From the correspondence with classification of von Neumann algebra, total of sentences is concerned with <properly infinite>, not concerned with <purely infinite>.
[Reference]
Kac-Moody Lie Algebra / Conjecture 1 / Finiteness in Infinity on Language / Tokyo February 10, 2008
No comments:
Post a Comment