Murphys Laws: Peck's Programming Postulates to Peck's Programming Postulates
(Murphy's Laws collected: 1583)
Peck's Programming Postulates : Not until the program has been in production for at least six months will the most harmful error be discovered.
Peck's Programming Postulates : Any constants, limits, or timing formulas that appear in the computer manufacturer's literature should be treated as variables.
Peck's Programming Postulates : The most vital parameter in any subroutine stands the greatest chance of being left out of the calling sequence.
Peck's Programming Postulates : If only one compiler can be secured for a piece of hardware, the compilation times will be exorbitant.
Peck's Programming Postulates : If a test installation functions perfectly, all subsequent systems will malfunction.
Peck's Programming Postulates : Job control cards that positively cannot be arranged in improper order, will be.
Peck's Programming Postulates : Interchangeable tapes won't.
Peck's Programming Postulates : If more than one person has programmed a malfunctioning routine, no one is at fault.
Peck's Programming Postulates : If the input editor has been designed to reject all bad input, an ingenious idiot will discover a method to get bad data past it.
Peck's Programming Postulates : Duplicated object decks which test in identical fashion will not give identical results at remote sites.
Suggest a Murphy's Law for this list. Contact : SanjeevDotNet at gmail dot com :
