This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import matplotlib.pyplot as plt | |
import numpy as np | |
x=np.random.randn(10000) | |
plt.hist(x,100) | |
plt.title(r'Normal Distribution with $\mu = 0 and \sigma = 1$ ') | |
plt.savefig('matplotlib_histogram.png') | |
plt.show() |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import math | |
import matplotlib.pyplot as plt | |
import numpy as np | |
import scipy.stats | |
mean = 0 | |
variance = 1 | |
sigma = math.sqrt(variance) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
""" | |
helloevolve.py implements a genetic algorithm that starts with a base | |
population of randomly generated strings, iterates over a certain number of | |
generations while implementing 'natural selection', and prints out the most fit | |
string. | |
The parameters of the simulation can be changed by modifying one of the many | |
global variables. To change the "most fit" string, modify OPTIMAL. POP_SIZE | |
controls the size of each generation, and GENERATIONS is the amount of | |
generations that the simulation will loop through before returning the fittest |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from flask import Flask | |
from flask import request | |
import json | |
import requests | |
import hashlib as hasher | |
import datetime as date | |
node = Flask(__name__) | |
# Define what a Snakecoin block is | |
class Block: |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import hashlib as hasher | |
import datetime as date | |
# Define what a Snakecoin block is | |
class Block: | |
def __init__(self, index, timestamp, data, previous_hash): | |
self.index = index | |
self.timestamp = timestamp | |
self.data = data | |
self.previous_hash = previous_hash |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# [ENTER_SOURCE_CODE] | |
# A.G. (c) 2017. All Rights Reserved. | |
# January 4th, 2017 | |
import time | |
class EnterSourceCode: | |
def __init__(self, time, filename, sourcecode, category): | |
self.time = time | |
self.filename = filename |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# very simple Mersenne prime search. | |
# AW2016-01-23 | |
import time | |
import math | |
# http://stackoverflow.com/questions/16004407/a-fast-prime-number-sieve-in-python | |
def prime_sieve(n): | |
size = n//2 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import math | |
import random | |
def str_to_ascii(text): | |
""" Gets rid of on ASCII characters in text""" | |
return ''.join(ch for ch in text if ord(ch)<128) | |
def maxmatch(T, p, w=2**12-1, max_length=2**5-1): | |
""" finds a maximum match of length k<=2**5-1 in a | |
w long window, T[p:p+k] with T[p-m:p-m+k]. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import http.client | |
import random | |
def random_string(n): | |
return "".join(chr(random.randrange(128)) for i in range(n)) | |
def str_to_bin(text): | |
""" translates text to binary reprersentation using | |
7 bits per character. Non ASCII characters are discarded""" | |
return ''.join('{:07b}'.format(ord(ch)) for ch in text if ord(ch) < 128) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#! /usr/bin/env python3 | |
# -*- coding: utf-8 -*- | |
''' | |
The VerilogBits provides Verilog-style representation of the numbers. | |
Copyright (C) 2015 Jan Marjanovic <jan@marjanovic.pro> | |
This program is free software: you can redistribute it and/or modify | |
it under the terms of the GNU General Public License as published by |
NewerOlder