1. Given any problem containing 'n' equations, there will
always be 'n+1' unknowns.
2. An object or bit of information most needed will be the
least available
3. Once you have exhausted all possibilities and fail, there
will be one solution, simple and obvious, highly visible to
everyone else.
4. Badness comes in waves.
-- The Snafu Equations
always be 'n+1' unknowns.
2. An object or bit of information most needed will be the
least available
3. Once you have exhausted all possibilities and fail, there
will be one solution, simple and obvious, highly visible to
everyone else.
4. Badness comes in waves.
-- The Snafu Equations
Related:
- Snafu Equations
1) Given any problem containing n equations
there will be n + 1 unknowns. 2) An object... - Skip's Lament: Given any problem containing N equations
There will be n+1 unknowns... - Given a problem of 'n' equations, there will be 'n+1' variables
The First SNAFU... - The Snafu Equation
The bit of information most needed is least available... - flowchart, n. & v.:
[From flow to ripple down in rich profusion
as hair + chart a cryptic hidden-treasure map designed... - flowchart, n. & v.:
[From flow "to ripple down in rich profusion
as hair" + chart "a cryptic hidden-treasure map designed... - flowchart, n. & v.
[From flow "to ripple down in rich profusion
as hair" + chart "a cryptic hidden-treasure map designed... - spam vt.,vi.,n.
[from "Monty Python's Flying
Circus"] 1
To crash a program by overrunning a fixed-size buffer... - HAKMEM /hak'mem/ n.
MIT AI Memo 239 (February 1972)
A legendary collection of neat mathematical and...
