Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Calculating the Fibonacci Numbers to Demonstrate that LaTeX is Turing Complete
(
scribtex.com
)
2 points
by
rmurrish
on April 25, 2012
|
hide
|
past
|
favorite
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
