My rule tables and ruel tabels(Nutshell)
- threeswitchlife: three life states switch between each other.
- disamb_template: a template for making 'disambiguation rules', a class of three-state rules.
- Transistoric: a circuit rule with semiconductors.
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
| def cremove(s): | |
| while "()" in s: | |
| s = s.replace("()", "") | |
| return not s | |
| def checkp(s): | |
| if len(s) % 2: | |
| return False | |
| return cremove(s) |
EZLiang
/ MyRuleTablesAndRuelTabels.md
Last active
December 15, 2019 02:01
My rule tables and ruel tabels
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
| @NUTSHELL Transistoric | |
| 0: dead | |
| 1: wire | |
| 2: tail | |
| 3: head | |
| 4: splitter | |
| 5: splitter tail | |
| 6: splitter head | |
| 7: {Ng} semiconductor N | |
| 8: semiconductor N tail |
EZLiang
/ gen2wire.py
Last active
January 6, 2020 21:10
A circuit rule generator from any generations rule
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
| transitions = { | |
| "0": "00000000", | |
| "1c": "01000000", "1e": "10000000", | |
| "2c": "01010000", "2e": "10100000", "2k": "10010000", "2a": "11000000", "2i": "10001000", "2n": "01000100", | |
| "3c": "01010100", "3e": "10101000", "3k": "10100100", "3a": "11100000", "3i": "01110000", "3n": "11010000", "3y": "10010100", "3q": "11000100", "3j": "11000010", "3r": "11001000", | |
| "4c": "01010101", "4e": "10101010", "4k": "11010010", "4a": "11110000", "4i": "11011000", "4n": "11000101", "4y": "11010100", "4q": "11100100", "4j": "11010100", "4r": "11101000", "4t": "11001001", "4w": "11011000", "4z": "11001100", | |
| "5c": "10101011", "5e": "11010101", "5k": "11010110", "5a": "11110001", "5i": "11111000", "5n": "11101001", "5y": "11011010", "5q": "11101100", "5j": "11110100", "5r": "11011100", | |
| "6c": "11111010", "6e": "11110101", "6k": "10111101", "6a": "11111100", "6i": "11011101", "6n": "11101110", | |
| "7c": "11111110", "7e": "01111111", | |
| "8": "11111111" |
EZLiang
/ circuitgen.py
Last active
May 30, 2020 15:33
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
| """ | |
| Use like: python circuitgen.py /12/3 | |
| or whatever generations rule you want to use | |
| """ | |
| import sys | |
| transitions = { | |
| "0": "00000000", | |
| "1c": "01000000", "1e": "10000000", |
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
| suffixes = ["", "thousand", "million", "billion", "trillion", "quadrillion", "quintillion", "sextillion", "septillion", "octillion", "nonillion", "decillion", "undecillion", "duodecillion", "tredecillion", "quatturodecillion", "quindecillion", "sexdecillion", "septendecillion", "octodecillion", "novemdecillion", "vingtillion"] | |
| numbers = ["zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"] | |
| teens = ["ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen"] | |
| tens = ["zero", "ten", "twenty", "thirty", "forty", "fifty", "sixty", "seventy", "eighty", "ninety"] | |
| def synth2(n): | |
| if n == 0: | |
| return "" | |
| elif n < 10: | |
| return numbers[n] |
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
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
| ABSOLUTELY FREE LICENSE | |
| The RIGHTS are hereby granted to all distributors and clients of this software under the TERMS AND CONDITIONS | |
| TERMS AND CONDITIONS | |
| 1. The LICENSE must remain the same. | |
| 2. All future versions must be open source. | |
| 3. This software shall not be distributed for personal or corporate gain. | |
| 4. The source of this software must be provided. |
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
| print("hello") |
EZLiang
/ gistrunner.py
Last active
March 19, 2020 15:00
Gist Runner Python 3 -- run gists on your computer
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
| """ | |
| Copyright (c) 19 March 2020 EZLiang | |
| This is distributed under the absolutely free lisence (https://gist.github.com/EZLiang/65b9a273fe2790d9abe31baf4f7b9d42) | |
| To run: | |
| ---- | |
| $ python gistrunner.py username/gist_hash filename | |
| or whichever python version works for you: | |
| - python | |
| - python3 |
OlderNewer