Comments by "xybersurfer" (@xybersurfer) on "Infinite Data Structures: To Infinity u0026 Beyond! - Computerphile" video.

  1. wait for it to finish :p
    3
  2. mrsuperguy2073 there are infinitely many whole numbers and we use integers to represent them. the number of bits is just a practical consideration. i think it's more about the length of the list than the numbers in it being infinitely large. not all lists have to containing growing numbers or numbers at all. similarly to the size of whole numbers, a list can be infinitely long but we use a data type to represent such a list. the amount of memory is also just a practical consideration. being able to directly represent an infinite list allows us to separate the definition of the list from the operations on it. in strict languages we would have to re-implement the same list along with different operations, everytime we would want to transform it. i think that being able to more directly express yourself and so not having to repeat yourself, makes it worth dealing with the practical considerations.
    2
  3. certee it never finishes sieving the infinite list because it is infinite. the result of sieve is a list with the first element calculated, and the rest of the elements are again a sieve result. the rest is a call to sieve waiting to be evaluated when you ask for the next element. you can stop sieving by not requesting more elements but this is different from finishing the sieving of the infinite list. it's more like "giving up" after you have the elements you want
    2
  4. @mrsuperguy2073 that's true, i agree that he should have at least mentioned the limits
    1
  5. matsv201 in haskell a list is a recursive data structure. because: a list is defined as either empty, or the first element followed by a list of the remaining elements, it is a recursive data structure (its definition contains itself). an infinite list, is a list that always has remaining elements
    1