Prague Theory 2
About Language Machine
1
Language machine
is assumed to a device of automatic generating language.
2
In this phase,
<automatic> means the orderly arranged output against random occurred
input.
3
The relationship
between input and output is obeyed by a digitized quantified logic.
4
The logic is in
accord with the principles and rules on <Quantum Theory for Language>.
5
In the machine,
automatism contains the generation of linking language usually called copula.
6
For example, [ I ]
and [ student ] is inputted, the output is [[ I am student]]. In the output, [[
am ]] is newly generated in the language machine.
Mark [ is a sign
of input starting.
Mark ] is a sign
of input ending.
Mark [[ is a sign
of output starting.
Mark ]] is a sign
of output ending.
7
Now [I], [student]
and [March] are inputted, the output becomes [[I will be student in March]].
In this situation,
[will be] and [in] are newly generated.
8
<Time principle
of quantum> is the most radical theory for <Prague Theory>.
The principle is
abbreviated to TPQ.
9
<Reversion
principle of quantum> is contributed to <Guarantee of Language>.
The principle is
abbreviated to RPQ.
10
TPQ and RPQ
contain the longitude of time.
11
The time of TPQ is
classified to the static one.
It is a width of
the time on body clock of the quantum.
The time of RTQ is
classified to the dynamic one.
It is a progress
of the time on outer quantum.
12
Newly generated
parts of language are linking language of different floor of <Quantum Theory
for Language>.
Each floor has an
orbit of quanta.
13
For example, in
[[I am student]], [[I]] and [[student]] are placed to the different floors.
Two floors are
linked by the copula [[am]].
14
The selection of
suitable copula is operated by the inner information of each quantum and
combination of two or over two quanta on the orbit.
Tokyo October 17, 2004