Yes, it is. To reduce the problem size, the following program is likely to eventually print out any Fibonacci numbers between 0 and N-1, where N is the command line argument. In order, even. However, you must find them buried in all the other numbers, and it will take an indeterminate amount of time. It will not stop upon hitting a sequence of fibonacci numbers. (Hint: The output is random.)
#!/usr/bin/perl -w
use strict;my$N=$_[0];$\=' ';for (;;){print int rand$N}
| [reply]
[d/l] |