I consider myself very lucky to have seen a PDP-10 in the metal, running the first video game Spacewar! At the Computer History Museum in Mountain View. Presented by the Spacewar author himself Steve Russell. Whom I was lucky enough to talk to.
Today I find Steve Russel's alma marta was Dartmouth College, birthplace of BASIC. But he was known for implementing Lisp and inventing the "continuation".
On the downside he mentored Bill Gates and Paul Allen. Presumably they were not smart enough for all the serious Lisp stuff and ended up building BASIC instead.
Anyway, maxima, what a treat. A blast from the past. Runs on my PC just fine:
Code: Select all
$ cat fibo.sh
maxima --very-quiet <<EOF
$ time ./fibo.sh | head -c 32
10727395641800477229364813596225Inappropriate ioctl for device
$ time ./fibo.sh | tail -c 32
Except, as you see, it complains about piping to "head", like some others we have seen.
I have no idea about maxima, but judging by this page: https://andrejv.wordpress.com/2010/02/1 ... i-numbers/
it might well use more funky techniques to get fibos than we know. Never mind GMP.
But here is the dilemma for the fibo(4784969) challenge. What you have presented is a shell script that runs maxima which calls a ready made fibo function. Is that cheating because the entry does not actually show code that implements a fibo algorithm? Is it acceptable because the challenge never actually said show the algorithm, only write the program and don't use non-standard libraries?
I'm leaning toward the latter and am about to check it into the challenge repository.