|
Search: id:A108717
|
|
|
| A108717 |
|
A model of LQTL "possible world lines" as a balanced binary tree with four successors (S4S). Each path through the tree creates a unique "word" describing the linked nodes. Four iterations generate the sequence which is extensible. Qubits mapped to a balanced binary tree. |
|
+0
1
|
|
| 11111111, 11111112, 11111212, 11111222, 11111212, 11121222, 11122222, 11122221
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
For this sequence qubits have been represented as 11, 12, 21, 22, rather than the more common 00, 01, 11, 10. With the latter encoding the sequence would be 00000000, 00000001, 00000101, 00000111, 00000101, 00010111, 00011111, 00011110.
|
|
REFERENCES
|
P. Blackburn, W. Meyer Viol, "Linguistics, Logic and Finite Trees", Bulletin of the IGPL 2, (1994), 3-31.
U. Endriss, Modal Logics of Ordered Trees. Unpublished PhD thesis, King's College, London. (2003).
M. O. Rabin, Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the American Mathematical Society, 141:(1969) 1-35.
|
|
LINKS
|
L. Alison, Binary Trees.
H. Comon, M. Dauchet, R. Gilleron, D. Lugiez S. Tison and M. Tommasi, Tree Automata.
T. Smith, Surreal Numbers.
|
|
CROSSREFS
|
Cf. A094266.
Sequence in context: A071370 A114680 A094326 this_sequence A038450 A075093 A069341
Adjacent sequences: A108714 A108715 A108716 this_sequence A108718 A108719 A108720
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
R. H. Barbour (bbarbour(AT)unitec.ac.nz), Jun 20 2005
|
|
|
Search completed in 0.002 seconds
|
