S
Spiked Math
spikedmath.com · Personal blog · on HN since 2010
Spiked Math is a webcomic by a mathematician, with jokes about math, physics and the culture around them.
What HN saysHN commenters link individual comics as related or favorite jokes, including ones about IQ test sequences, and praise the site's calculus captcha for comments.
19HN people shared it
10linked it in comments
9stories submitted
45story points
8 years agolast shared
2010people per year2026
Most-shared posts
- 14452 people · first shared 2013
- 2I am a mathematician and ...1 people · 33 points · first shared 2011 · 4 comments on HN
- 3Pi is wrong1 people · 3 points · first shared 2015 · discussion on HN
- 4It's a small world after all (infographic)1 people · 2 points · first shared 2013 · 1 comments on HN
- 5Eggnog by Serge Lang1 people · 2 points · first shared 2014 · discussion on HN
- 6Geeky pet names1 people · 1 points · first shared 2011 · discussion on HN
- 7A cute physics pun that accurately describes Reddit1 people · 1 points · first shared 2011 · discussion on HN
- 8What is math (Comic)1 people · 1 points · first shared 2011 · discussion on HN
- 9Working On Math Proofs1 people · 1 points · first shared 2014 · discussion on HN
- 10Martin Gardner - some highlights1 people · 1 points · first shared 2014 · discussion on HN
- 11183.html);1 people · first shared 2018
- 12Homepage1 people · first shared 2012
- 133251 people · first shared 2010
- 140621 people · first shared 2015
- 150561 people · first shared 2010
What HN people wrote when they linked it
thaumasiotes · 2015-07-16
related: http://spikedmath.com/334.html
(there's also a followup, at http://spikedmath.com/335.html )
manaskarekar · 2013-03-02
Comic version: http://spikedmath.com/445.html
Follow up: http://mrburkemath.blogspot.com/2011/05/coffee-logic.html
lotharbot · 2012-07-24
One of the comics I read requires you to solve a simple calculus problem before you can comment, as a pseudo-captcha.
http://spikedmath.com/
nayanshah · 2010-11-07
Love this one : http://spikedmath.com/325.html
jordigh · 2015-09-01
We like to include sequences that appear on IQ tests. It’s always
been one of my goals to help people do these silly tests.
Yessssss! Those damn "IQ" questions:
http://spikedmath.com/062.html
We also get them with some regularity in Freenode's ##math. It's a FAQ. "Here's a list of numbers, what's the formula?" Sometimes we're able to send the person to Sloane's and be done with it.
Other times...
mhartl · 2013-06-29
Many of the examples in The Pi Manifesto are wrong. See the rebuttal I posted last year:
http://tauday.com/tau-manifesto#sec-the_pi_manifesto_a_rebuttal
Indeed, the author of The Pi Manifesto essentially rebutted his own work in March of last year:
http://spikedmath.com/fact-005.html
hazov · 2013-05-22
http://spikedmath.com/445.html
Spiked Math slowed down recently but it's still good.
dbaupp · 2012-12-10
Jesus was the original discoverer of Banach-Tarksi.
(http://spikedmath.com/234.html)
IngoBlechschmid · 2018-08-14
> > A program is a piece of a text.
> But, a program is more than a text, it is a structure, parsed from text with the rules of the language .
Yes, you are right. By "text" I actually meant "term" or "abstract syntax tree".
> Execution of the program is when we give it some input and run it. So there would be similarly an input to proofs. Proof would need to be "proven correct" for EVERY valid input, that is what compiler does for programs, proving the result of the program must be of its declared result-type.
Not necessarily, not all programs require input and similarly not all proofs require input. But yes, for most cases you're right: Just as the program "output a prime number larger than <>" requires an input, so does a proof of the statement "there is a prime number larger than <>".
> But a proof which proves anything is not really a proof as said by someone, it corresponds to a non-halting program. So in this sense doesn't a proof ALWAYS require that we "run" it, to prove that it terminates, and thus is a valid proof actually?
Indeed, in general, running a proof and observing that it terminates is one way to ensure that it's a valid proof. However, all the proof systems (logics) used in mathematical practice correspond, under Curry–Howard correspondence, to programming languages in which any well-typed program terminates. (These programming languages are therefore in some sense quite impoverished; they are definitely not Turing-complete. However they are still…
Muzza · 2010-09-29
Also see http://spikedmath.com/056.html .