There Is No Problem That Can't Be Solved With Large Enough Hash Table

I first used this quote when referring to the z-buffering used in ID first person shooter Castle Wolfenstein. While not strictly a hash table, its a philosophy of “the audacity of scale” that I have maintained since my demo coding days.

Q: How did you get that so fast?

A: A Lookup table!

The original BSCAL execution cache and the WebGod application server, the MetaWrap server object mutation event handler, the nanotech audio wavetracer all used this approach with great benefit.

This saying is fundamentally true, because any deterministic computation is input for a set of outputs, and thus all computation could be simulated with a pre-calculated cache of the result for every input.

About James McParlane

CTO Massive Interactive. Ex Computer Whiz Kid - Now Grumpy Old Guru.
This entry was posted in Nostalgia for Misspent Youth, Rants. Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s