Talk:Fibonacci word: Difference between revisions
Content added Content deleted
(replaced rep string with repeated substring) |
No edit summary |
||
| Line 1: | Line 1: | ||
Uh, are you sure that any of the Fibonacci words actually have rep-strings? |
Uh, are you sure that any of the Fibonacci words actually have rep-strings? |
||
: It would seem not. I have replaced rep string with repeated substring.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 12:09, 13 July 2013 (UTC) |
: It would seem not. I have replaced rep string with repeated substring.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 12:09, 13 July 2013 (UTC) |
||
I'm not sure that's much better. I've modified the Icon/Unicon solution to print the lengths of the |
|||
longest repeated substring for the first 20 Fibonacci Words. It looks like |
|||
the lengths of those substrings are going to get you in trouble (again) with |
|||
Them That Be. (I stopped after 20 because the algorithm I use for locating |
|||
repeated substrings is pretty naive and slow - hmmm, maybe *that_ should be a separate |
|||
RosettaCode task?* |
|||
Revision as of 21:02, 13 July 2013
Uh, are you sure that any of the Fibonacci words actually have rep-strings?
- It would seem not. I have replaced rep string with repeated substring.--Nigel Galloway (talk) 12:09, 13 July 2013 (UTC)
I'm not sure that's much better. I've modified the Icon/Unicon solution to print the lengths of the longest repeated substring for the first 20 Fibonacci Words. It looks like the lengths of those substrings are going to get you in trouble (again) with Them That Be. (I stopped after 20 because the algorithm I use for locating repeated substrings is pretty naive and slow - hmmm, maybe *that_ should be a separate RosettaCode task?*