The greatest mathematician since antiquity.





Submit your Gauss fact:


Send your submissions to spikedmath@gmail.com

Category: Computer Science

Sort: All Time | Today Only | This Week | This Month | This Year

Gauss knows of an efficient way of factoring large numbers into nontrivial primes, but gets such a laugh out of the general agreement of P != NP that he won't tell anybody.


#343
0 Comments

Upvote (33) - Downvote (19)

Submitted May 06 -- in Computer Science -- by j3r3my

Sign up for more!

Gauss can run insertion sort in less than constant time.


#338
0 Comments

Upvote (10) - Downvote (21)

Submitted May 07 -- in Computer Science -- by j3r3my

Sign up for more!

When Gauss creates a spanning tree, he just draws one line that goes through all nodes.


#331
0 Comments

Upvote (53) - Downvote (3)

Submitted May 06 -- in Computer Science -- by Stecas

Sign up for more!

Gauss can write out A(6,3) in decimal on an imaginary chalkboard in his head.


#330
0 Comments

Upvote (20) - Downvote (9)

Submitted May 07 -- in Computer Science -- by j3r3my

Sign up for more!

Gauss checkmated Watson in 3 moves using BASIC on an Atari 2600.


#297
0 Comments

Upvote (29) - Downvote (23)

Submitted March 23 -- in Computer Science -- by RandomFactor

Sign up for more!

Gauss doesn't sort, he raises one eyebrow, and arrays sort themselves out in constant time, and throw themselves at his feet, crying for mercy.


#286
0 Comments

Upvote (174) - Downvote (19)

Submitted April 29 -- in Computer Science -- by BrownGuyWithGlasses

Sign up for more!

Gauss doesn't need to solve the halting problem. Turing Machines halt whenever Gauss tells them to.


#259
0 Comments

Upvote (18) - Downvote (6)

Submitted May 01 -- in Computer Science -- by polybot

Sign up for more!

Gauss once determined whether P = NP, but didn't think it was important enough to publish.


#251
0 Comments

Upvote (22) - Downvote (13)

Submitted April 29 -- in Computer Science -- by ahugenerd

Sign up for more!

Gauss knows which Turing machines halt, because they have to ask him for permission first.


#248
0 Comments

Upvote (47) - Downvote (6)

Submitted April 28 -- in Computer Science -- by matt.might.net

Sign up for more!

Gauss doesn't need to solve the Halting Problem — Turing machines halt whenever Gauss tells them to.


#246
0 Comments

Upvote (39) - Downvote (3)

Submitted May 01 -- in Computer Science -- by anand

Sign up for more!


Your account
Username Password  Remember Me