|
|
A290642
|
|
a(n) is the maximum diameter for an n-threaded binary program. In other words, a(n) is the maximal finite distance in the transition graph of an n-threaded binary program.
|
|
0
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Here, a binary n-threaded program is a multithreaded program with n threads, two local states per thread, and 2 shared states.
Conjecture: a(n) = 3*n for all n >= 5.
|
|
LINKS
|
|
|
FORMULA
|
a(n) >= 3*n for all n >= 1.
a(n) <= n^{2^{13}} for all n >= 2.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|