[ANN] "functional" number sequence device

From: Georg Bauhaus (sb463ba_at_l1-hrz.uni-duisburg.de)
Date: 09/22/04


Date: Wed, 22 Sep 2004 21:15:54 +0000 (UTC)

Hello,

a small programming device that has helped me make "infinite"
sequences based on numbers in Ada is online at
http://home.arcor.de/bauhaus/Ada/fada.txt

It is modelled, in ML terms, after
  datatype chain = Link of (int * (int -> chain)).

Enjoy,
-- Georg



Relevant Pages

  • Re: November 25 is Infinite Clause day!!
    ... Not sure all infinite digit sequences are computable. ... > this is your second error, your construction can never be realised. ...
    (sci.math)
  • Re: probability (was Re: EEQT)
    ... The concept of independent random variables is vacuous in a sigma algebra ... needs infinite series of independent or nearly independent trials to make ... But real coins _never_ produce random binary sequences (which are ... The way randomness is applied to a finite number of facts (and the number ...
    (sci.physics.research)
  • Re: Problems I have with 1.999...=2
    ... we come to the problem of what these infinite decimal ... we know that rationals are dense on the real number ... infinite lists only contain rational numbers for our purposes here so ... As far as I understand these special sequences are ...
    (sci.math)
  • Re: What is wrong with Ada?
    ... def: Closure of T ... non-trivial input will necessarily have infinite S. ... every real program is ... My suspicion is you're mixing up "inifinite input sequences" ...
    (comp.lang.ada)
  • Re: limitation to induction on finite bounds
    ... > if we don't know and never can know all of its digits. ... Its from your meanderings on infinity you *then* talk about infinite time, ... all finite sequences of pi ...
    (sci.math)