Task

Create a program that, when run, would display all integers from   1   to      ∞      (or any relevant implementation limit),   in sequence   (i.e.   1, 2, 3, 4, etc)   if given enough time.



An example may not be able to reach arbitrarily-large numbers based on implementations limits.   For example, if integers are represented as a 32-bit unsigned value with 0 as the smallest representable value, the largest representable value would be 4,294,967,295.   Some languages support arbitrarily-large numbers as a built-in feature, while others make use of a module or library.

If appropriate, provide an example which reflect the language implementation's common built-in limits as well as an example which supports arbitrarily large numbers, and describe the nature of such limitations—or lack thereof.




*        Integer sequence      06/05/2016
INTSEQED CSECT
         USING  INTSEQED,12
         LR    12,15
         LA    6,1             i=1
LOOP     CVD   6,DW            binary to pack decimal 
         MVC   WTOMSG+4(12),EM12 load mask
         ED    WTOMSG+4(12),DW+2 packed dec to char
         WTO   MF=(E,WTOMSG)   write to console
         LA    6,1(6)          i=i+1
         B     LOOP            goto loop
WTOMSG   DC    0F,H'80',H'0',CL80' '
DW       DS    0D,PL8          pack dec 15num
EM12     DC    X'402020202020202020202120'  mask CL12 11num
         END   INTSEQED