girving

#!/usr/bin/env python

from __future__ import division
from numpy import *

def iter(n,boundary):
  p = ones(n)
  b = boundary.copy()
  j = 3*arange(1,n)
  for i in xrange(1000):

girving

#!/usr/bin/env python

from __future__ import division,print_function
from numpy import *
import scipy.sparse
import scipy.sparse.csgraph

"""
Consider approximate disjoint diagonal cycles concentric around the origin.
We can arrange that cycle C_n has radius O(n) and length O(n).

girving

2015-11-14 22:02:14 -0800

python
-c
import setuptools, tokenize
__file__ = 'setup.py'
exec(compile(getattr(tokenize, 'open', open)(__file__).read()
  .replace('\r\n', '\n'), __file__, 'exec'))
--no-user-cfg
install

girving

2015-11-15 14:05:33 -0800

cmake
..
-DCMAKE_C_FLAGS_RELEASE=
-DCMAKE_CXX_FLAGS_RELEASE=
-DCMAKE_INSTALL_PREFIX=/usr/local/Cellar/cubicsdr/HEAD
-DCMAKE_BUILD_TYPE=Release
-DCMAKE_FIND_FRAMEWORK=LAST
-DCMAKE_VERBOSE_MAKEFILE=ON

girving

2015-11-15 14:09:03 -0800

cmake
..
-DCMAKE_SHARED_LINKER_FLAGS='-Wl,-undefined,dynamic_lookup'
-DPYTHON_LIBRARY='/usr/local/lib/libgnuradio-runtime.dylib'
-DCMAKE_C_FLAGS_RELEASE=
-DCMAKE_CXX_FLAGS_RELEASE=
-DCMAKE_INSTALL_PREFIX=/usr/local/Cellar/soapysdr/HEAD
-DCMAKE_BUILD_TYPE=Release

girving

2015-11-15 14:05:33 -0800

cmake
..
-DCMAKE_C_FLAGS_RELEASE=
-DCMAKE_CXX_FLAGS_RELEASE=
-DCMAKE_INSTALL_PREFIX=/usr/local/Cellar/cubicsdr/HEAD
-DCMAKE_BUILD_TYPE=Release
-DCMAKE_FIND_FRAMEWORK=LAST
-DCMAKE_VERBOSE_MAKEFILE=ON

girving

2015-11-15 16:43:49 -0800

cmake
..
-DCMAKE_C_FLAGS_RELEASE=
-DCMAKE_CXX_FLAGS_RELEASE=
-DCMAKE_INSTALL_PREFIX=/usr/local/Cellar/cubicsdr/HEAD
-DCMAKE_BUILD_TYPE=Release
-DCMAKE_FIND_FRAMEWORK=LAST
-DCMAKE_VERBOSE_MAKEFILE=ON

girving

"""Print ops that have float but not double definitions."""

from __future__ import absolute_import
from __future__ import division
from __future__ import print_function

from google3.net.proto2.python.public import text_format
from google3.pyglib import app
from google3.pyglib import flags
from google3.third_party.tensorflow.core.framework import op_def_pb2

girving

The complete works of Shakespeare in binary have length

  s = 8 * 5.3M = 8 * 5458199 = 43665592

Let S be the set of numbers that contain the complete works of Shakespeare in binary.
If N is the number of occurrences of the complete works of Shakespeare, N is approximately
Poisson distributed with mean

  E(N) = (lg n - s) 2^-s = mu

girving

000000000024e0e4 s GCC_except_table0
0000000000256bb4 s GCC_except_table0
0000000000256fd0 s GCC_except_table0
0000000000257c30 s GCC_except_table0
000000000025975c s GCC_except_table0
00000000002597f8 s GCC_except_table0
000000000025bf98 s GCC_except_table0
000000000025c118 s GCC_except_table0
000000000025dd8c s GCC_except_table0
000000000025df1c s GCC_except_table0