Timeline for Speeding up the built-in Rudin-Shapiro and Thue-Morse sequence functions
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 10, 2019 at 16:28 | answer | added | bill s | timeline score: 4 | |
| Aug 1, 2015 at 14:37 | vote | accept | J. M.'s missing motivation♦ | ||
| Jul 30, 2015 at 16:24 | answer | added | Daniel Lichtblau | timeline score: 7 | |
| Jul 29, 2015 at 10:15 | comment | added | Oleksandr R. |
Thanks. I didn't download the notebook since I assumed the content was the same as the web page. It is rudinShapiroEWW[n_Integer] := (-1)^ Count[Partition[IntegerDigits[n, 2], 2, 1], {1, 1}]. On my computer this is about 5 times slower than the version 10.2 built-in, and it uses more memory, as one would expect.
|
|
| Jul 29, 2015 at 10:01 | comment | added | Sjoerd C. de Vries | @OleksandrR. what J. M. says. BTW it differs from the apparently actual implementation in your post. | |
| Jul 29, 2015 at 9:55 | comment | added | J. M.'s missing motivation♦ | @Oleksandr, it's in the notebook in the MathWorld entry I linked to, I believe. | |
| Jul 29, 2015 at 9:53 | comment | added | Oleksandr R. | @SjoerdC.deVries what is that implementation? From where do you find this? | |
| Jul 28, 2015 at 21:42 | comment | added | Daniel Lichtblau |
Mod[Total[IntegerDigits[n, 2]], 2] seems to be faster than ThueMorse.
|
|
| Jul 28, 2015 at 20:38 | history | tweeted | twitter.com/#!/StackMma/status/626129584682106880 | ||
| Jul 28, 2015 at 18:25 | answer | added | Oleksandr R. | timeline score: 29 | |
| Jul 28, 2015 at 18:21 | comment | added | Sjoerd C. de Vries |
I find that RudinShapiro takes the same amount of time as Eric Weisstein's high-level implementation. One might assume they are the same.
|
|
| Jul 28, 2015 at 17:31 | history | asked | J. M.'s missing motivation♦ | CC BY-SA 3.0 |