Snafu Equations
1) Given any problem containing n equations, there will
be n + 1 unknowns.
2) An object or bit of information most needed, will be
least available.
3) Any device requiring service or adjustment will be
least accessible.
4) Interchangable devices won't.
5) In any human endeavor, once you have exhausted all
possibilities and fail, there will be one solution,
simple and obvious, highly visible to everyone else.
6) Badness comes in waves.
1) Given any problem containing n equations, there will
be n + 1 unknowns.
2) An object or bit of information most needed, will be
least available.
3) Any device requiring service or adjustment will be
least accessible.
4) Interchangable devices won't.
5) In any human endeavor, once you have exhausted all
possibilities and fail, there will be one solution,
simple and obvious, highly visible to everyone else.
6) Badness comes in waves.
Related:
- 1. Given any problem containing 'n' equations, there will
always be 'n+1' unknowns.
2. An object or bit of information most needed will... - 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... - Laws of Computer Programming:
1. Any given program,
when running, is obsolete. 2. Any given program costs... - 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... - 1) Any given program, when running, is obsolete.
(2) Any given program costs more and takes longer.
(3) If a program is useful, it will have to be changed...
