Timeline for Limiting Entropy of deterministic sequences - 1
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:57 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Jan 2, 2015 at 6:59 | comment | added | Turbo | So in this question am I right in my conjecture? | |
| Jan 2, 2015 at 6:59 | comment | added | Turbo | Posted mathoverflow.net/questions/191943/… | |
| Jan 2, 2015 at 6:32 | comment | added | Bjørn Kjos-Hanssen | @Turbo sounds like another interesting question :) | |
| Jan 2, 2015 at 5:28 | comment | added | Turbo | @BjornKjosHanssen What is interpretation of entropy here? Does it mean we should be able to compress $a_i$ in finite number of bits or impossible to do in finite number of bits in total? | |
| Jan 2, 2015 at 2:14 | comment | added | Turbo | I checked a while back. Case $1$ seems related to $a\leq2$ and case $2$ seems related to $a>2$(possibly $a$ takes value such as $3$ that makes your summation converge). | |
| Jan 1, 2015 at 9:09 | comment | added | Bjørn Kjos-Hanssen | I didn't check how it covers the case (1) exactly, so maybe you can try to work it out and report back | |
| Jan 1, 2015 at 9:02 | comment | added | Turbo | $a=2$ case corresponds to $a_{i+1}=a_i + \theta(\log^c a_i)$ correct for all fixed $c\geq2$ correct? What does $a=3$ case correspond to in terms of $|a_{i+1}-a_i|$? | |
| Jan 1, 2015 at 8:43 | history | answered | Bjørn Kjos-Hanssen | CC BY-SA 3.0 |