Renowned Mathematician “Beloved Smith” Departs

The story of the greatest (and strangest) mathematician in Equestria, as told in obituary form. It takes place in the generation before the events of S1.

Chapters (1)

Comments ( 14 )

Viewing 1 - 50 of 14
- Newest First
- Oldest First

The Well Dressed Ninja

The Well Dressed Ninja #1 · Jun 9th, 2014 · 4 · ·

fc02.deviantart.net/fs45/f/2009/155/d/0/Falcon_Approved_by_EnterPraiz.jpg
abload.de/img/untitled-300upi5fkkh.gif

JDunk1971

JDunk1971 #2 · Jun 9th, 2014 · 1 · ·

I was half-afraid this was going to be Woodrow Wilson Smith...

Boss_Hoss1

Boss_Hoss1 #3 · Aug 26th, 2014 · 1 · ·

Now it's marked "Complete"/ Is this a teaser for a coming tale then?

RustPony

RustPony #4 · Aug 26th, 2014 · 1 · ·

4908105
No, it was just an attempt to see if I could write fiction. I am sort of working on an unrelated long tale, but it isn't progressing all that well.

wtdtd

wtdtd #5 · Nov 16th, 2014 · 3 · ·

I wanna hear more about this guys life.
More! More!

Luna Aeterna Solutae

Luna Aeterna Solutae #6 · Jan 29th, 2015 · · ·

Definitely interesting.

Jess887cp

Jess887cp #7 · Jan 29th, 2015 · 5 · ·

I now wish that I knew more about mathematics, so I could understand all of the subtle references you seem to have in here. I feel as though I'm missing a magnificent joke. Whatever the case, bravo!

Katamariguy

Katamariguy #8 · Jan 30th, 2015 · · ·

Hooray for mathematics!

Arn

Arn #9 · Jan 30th, 2015 · 2 · ·

And the rock farmers smiled,
for they understood,
as gems come from rocks,
their contents unseen.
A statue they erected to this,
their true earth pony kin.

They use the radiation decay equations and rations to this day!

SugarOnMyPancakes

SugarOnMyPancakes #10 · Feb 12th, 2015 · 2 · ·

JAPH

JAPH #11 · Mar 21st, 2015 · 8 · ·

5563248

The B-system is logic (the kind computers use). The NL-system is calculus. The T-machine is a Turing machine, a type of computer (well, sort of—it’s terrible as a real computer, but it’s vital to understanding what computers can and can’t do (and how fast they can do it)). The G theorem is Gödel's Incompleteness Theorem, which proves that there are some things you can’t prove. (This is connected to a proof about T-machines (due to T himself) that proves you can’t prove whether a computer program works or not, you can only try it and see.)

I wonder what extensions to Eucloppian construction he introduced. There’s an excellent theorem due to G (a different G) that gives the general rule on whether a regular n-gon is constructible.

I’m a little surprised he didn’t leave F & G’s (a different G from the other two (this system really doesn’t scale…)) most famous unsolved problems behind, just to keep them on their toes. (Well, technically, F is solved, but TSW is a beast that would probably have required him to spend half his life just explaining the new branches of math involved. “I have a truly marvellous proof of this, which this lifetime is too short to explain.” )