Related:

• There is an infinite number of describable functions, which are not effectively computable.
  -- N. Jones, "Computability Theory" Note: This contradicts the oft stated maxim "If a function can be defined, it can be programmed"....
• SEMINAR ANNOUNCEMENT Title: Are Frogs Turing Compatible?
  Speaker: Don "The Lion" Knuth ABSTRACT Several researchers at the University of Louisiana have been studying the computing power of various amphibians, frogs in particular....
• Life can be modeled as a hidden Markov process with infinite states and no a-priori knowledge of the probability density functions.
• This function is occasionally useful as an argument to other functions which require functions as arguments.
  -- Guy Steele Jr. CLTL...
• dongle /dong'gl/ n. 1. A security or copy protection device for proprietary software consisting of a serialized EPROM and some drivers in a D-25 connector shell
  which must be connected to an I/O port of the computer while the program is run....
• creaming tty: [UNIX] n. A terminal line which spews an infinite number of random characters at the operating system.
  This can happen if the terminal is either disconnected or connected to a powered-off terminal but still enabled for logi...
• creaming tty n. [Unix] A terminal line which spews an infinite number of random characters at the operating system.
  This can happen if the terminal is either disconnected or connected to a powered-off terminal but still enabled for logi...
• The number of rational hypotheses that can explain any given phenomenon is infinite.
  -- Persig's Postulate...
• howstopper n. A hardware or (especially) software bug that makes an implementation effectively unusable
  one that absolutely has to be fixed before development can go on....