Posted on June 23, 2015 at 14:27This is a classic problem that was solved back in the 1960s after extensive research, by a revered scholar named Parkinson. His discovery of one of the axiomatic principles of computer science states, in simple terms:
''Work expands so as to fill the time available for its completion.''
Although initially assumed it could not be proved, the theory was later confirmed by the invention of the infinite loop coupled with stack overflow.
Applied to your specific question, a properly coded thread will expand to fill all available memory for an infinite amount of time, within the framework of equipment lifetime or collapse of the universe. For Keil 5 the time is represented by Aleph 1, the infinity of ordinal numbers (see Georg Cantor for further explanation on the more general concept of Cantor sets).
Jack Peacock
