dimpase
/ gist:4992965
Created Feb 20, 2013
A bit of CA in Haskell. The hardest part was to figure out nf, to ensure strict evaluation.
View gist:4992965
| module Main where | |
| import Math.CommutativeAlgebra.Polynomial | |
| import Math.Algebras.VectorSpace -- for nf | |
| main = | |
| print (adder 10000000 d e) | |
| where | |
| [x,y] = map glexvar ["x","y"] | |
| a = 4*x^2 + 3*x + 2 |
View dir_x
| sage: dir(polygen(RR)) | |
| ['N', | |
| '__add__', | |
| '__call__', | |
| '__class__', | |
| '__cmp__', | |
| '__copy__', | |
| '__delattr__', | |
| '__delitem__', |
View x.py
| # run in Python 3, e.g. via importing | |
| B=bytes( | |
| map( | |
| lambda x: x-1, | |
| filter( | |
| lambda y: y < sum(2**x for x in {z for z in range(7)}-{2}), | |
| b'~b{qq}mz!o|px' | |
| ) | |
| ) | |
| ) |
View Hn2.ipynb
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.