Anonymous user
Talk:Self-describing numbers: Difference between revisions
→What do we do?: added comments about intent vs. table lookup. -- ~~~~
(→Duplicate task: changed indentation) |
(→What do we do?: added comments about intent vs. table lookup. -- ~~~~) |
||
Line 5:
At the moment this reads like an encyclopedia entry rather than a task description. --[[User:Paddy3118|Paddy3118]] 12:33, 8 May 2011 (UTC)
: I believe that using a lookup table doesn't fullfill the intent of the requirement of a task, given that the task states what a self-describing number is and/or how to determine that if a number is one. Seeing if a number is in a simple list is another deterministic method entirely. -- [[User:Gerard Schildberger|Gerard Schildberger]] 22:40, 2 August 2012 (UTC)
: If a task where to ask to determine (or show a list) if a number is a Fibonacci prime, and all that was done was to check if the number was in a pre-defined list. It's not strictly against the "rules" (which really aren't specified), but it sure skirts around showing how a language would solve the intent of the task, that is, use the stated algorithm(s). I see nothing wrong, however, if there'd be an optimized version (listed as a table lookup) in addition to the use of the task's algorithm(s). -- [[User:Gerard Schildberger|Gerard Schildberger]] 22:40, 2 August 2012 (UTC)
==Template needed==
| |||