Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

You know a better language?

Name: Enterprise COBOL Programmer 2010-05-31 10:58

You know a better language?  What's that supposed to mean, Shirley?  There's no such thing as a programming language better than COBOL.
http://www.marriedtothesea.com/053110/a-better-language.gif

Name: Anonymous 2010-05-31 11:00

Thanks for transcribing that. This is the kind of thing that wget and less just don't work well enough for.

Name: Anonymous 2010-05-31 11:09

>>1
What about FORTRAN?

Name: Anonymous 2010-05-31 11:11

COBOL 2004 isn't that bad, really.

Name: Anonymous 2010-05-31 11:12

>>3
What about my am FORTRAN ?

Name: Anonymous 2010-05-31 13:29

>>4
Back to bed, Xarn.

Name: Anonymous 2013-08-31 23:02


Since cardinality is such a common concept in mathematics, a variety of names are in use. Sameness of cardinality is sometimes referred to as equipotence, equipollence, or equinumerosity. It is thus said that two sets with the same cardinality are, respectively, equipotent, equipollent, or equinumerous.

Name: Anonymous 2013-08-31 23:47


    * Enumerable: lowest, intermediate, and highest

    * Innumerable: nearly innumerable, truly innumerable, and innumerably innumerable

    * Infinite: nearly infinite, truly infinite, infinitely infinite

Name: Anonymous 2013-09-01 0:32


Some programming languages, such as Java[13] and J,[14] allow the programmer an explicit access to the positive and negative infinity values as language constants. These can be used as greatest and least elements, as they compare (respectively) greater than or less than all other values. They are useful as sentinel values in algorithms involving sorting, searching, or windowing.

Name: Anonymous 2013-09-01 1:18


Set theory as a foundation for mathematical analysis, topology, abstract algebra, and discrete mathematics is likewise uncontroversial; mathematicians accept that (in principle) theorems in these areas can be derived from the relevant definitions and the axioms of set theory.

Name: Anonymous 2013-09-01 2:03


One motivation for this use is that a number of generally accepted mathematical results, such as Tychonoff's theorem, require the axiom of choice for their proofs. Contemporary set theorists also study axioms that are not compatible with the axiom of choice, such as the axiom of determinacy.

Name: Anonymous 2013-09-01 2:48


In Martin-Löf type theory and higher-order Heyting arithmetic, the appropriate statement of the axiom of choice is (depending on approach) included as an axiom or provable as a theorem.

Don't change these.
Name: Email:
Entire Thread Thread List