Cantor's diagonal argument

cantor.py

# https://en.wikipedia.org/wiki/Cantor%27s_diagonal_argument


def bits(n):
    return list(int(x) for x in reversed(bin(n)[2:]))


def nth(lst, n):
    if n < len(lst):
        return lst[n]
    return 0


def flip(n):
    return (n + 1) % 2


N = 17
t = [bits(n) for n in xrange(N)]
print 'Possible enumeration of all infinite sequences of binary digits:'
print '\n'.join(str(row + [0, 0, 0] + ['...']) for row in t)
print '...'
print '\nEntry not in the table by Cantor\'s diagonal argument:'
print [flip(nth(row, n)) for n, row in enumerate(t)]