Now you're really gonna' piss the interviewers off!<p><a href="http://joelgrus.com/2016/05/23/fizz-buzz-in-tensorflow/" rel="nofollow">http://joelgrus.com/2016/05/23/fizz-buzz-in-tensorflow/</a>
Another article on the HN front page also talks about computing Fibonacci numbers quickly.<p>"Automatic Algorithms Optimization via Fast Matrix Exponentiation (2015)" ; <a href="https://news.ycombinator.com/item?id=17592359" rel="nofollow">https://news.ycombinator.com/item?id=17592359</a> ; <a href="https://kukuruku.co/post/automatic-algorithms-optimization-via-fast-matrix-exponentiation/" rel="nofollow">https://kukuruku.co/post/automatic-algorithms-optimization-v...</a>
Previous discussion: <a href="https://news.ycombinator.com/item?id=11560122" rel="nofollow">https://news.ycombinator.com/item?id=11560122</a> and Paul Hankin has some more thoughts on the subject: <a href="https://blog.paulhankin.net/fibonacci2/" rel="nofollow">https://blog.paulhankin.net/fibonacci2/</a>