We investigate the consequences of assuming integer variables of algorithmic languages to be finite vs. infinite in number and/or range. We suggest that different groups of computer scientists use different postulates about algorithmic languages. This leads to difficulty in communication, since the assumptions are usually unstated. Key words and phrases: Algol vs. FORTRAN, finiteness assumptions, intellectual isolation, integer variable range, memory finiteness, finite word size.