GEOUNIVERSAL .:.

pages - photos - log

all 16 binary operations

.    0
:    1

::.. a          | a input
:.:. b          | b input

.... 0          | always 0 
...: n(a+b)     | nor       
..:. na.b       |          
..:: na         | na      
.:.. a.nb       |           
.:.: nb         | nb        
.::. a.nb+na.b  | xor    ⊕   
.::: n(a.b)     | nand    
:... a.b        | and    
:..: a.b+na.nb  | nxor    
:.:. b          | b        
:.:: na+b       |         
::.. a          | a         
::.: a+nb       |           
:::. a+b        | or        
:::: 1          | always 1

helpful links i've found along the way

you can learn anything on the internet

eater.net/8bit

concise electronics for geeks

crash course computer science

hyperphysics - gates

building blocks - dsearls

lots of home brew cpu out there

https://www.homebrewcpuring.org/

http://www.mycpu.eu/

magnetic computers

all magnetic computer (sri history of computers)

magnetic logic jeri ellsworth

Electronics: Magnetic Cores I: Properties 1961 US Army Training Film

cpu emulation

how to emulate cpu/nintendo/anything

pandocs everything about gameboys

building logic gates with transistors

all these gates are made with npn transistors
these are incomplete
and some errors probably exist sorry

always off

      +
      |
      |
      |      
  |---t
  |   |
  |   |--- 0
  |   |
 (-) (-)

always on

  +   +
  |   |
  |   |
  |   |   
  |---t
      |
      |--- 1 
      |
     (-)

buffer gate

     +
     |
     |
     |
a ---t
     |
     |--- a
     |
    (-)

1 0 input a
1 0 a

not gate - inverter

     +
     |
     |--- na
     |
a ---t
     |
     |
     |
    (-)

1 0 input a
0 1 na

and / nand gate

     +
     |
     r
     |--- n(a.b) nand
     |
a ---t
     |
b ---t
     |
     |--- a.b  and
     |
    (-)

1 1 0 0 input a
1 0 1 0 input b

1 0 0 0 a.b and
0 1 1 1 n(a.b) nand

or / nor gate

      +
      |
      |--- n(a+b) nor
      |
     / \
a---t   t---b
     \ /
      |
      |--- a+b or
      |
     (-)

1 1 0 0 input a
1 0 1 0 input b

1 1 1 0 a+b or
0 0 0 1 n(a+b) nor

xor / nxor

    nand                 or        and
     +                    +          +
     |                    |          |
     |                    |          |---nxor
     |                    |          |
     |------nand----------|----------t
a-.--t                .---|          |    
  |  |                |  /           |
  '--|------a-----------t            |
     |                |  \           |
b-.--t                |   |          |
  |  |               /    |          | 
  '--|------b-------t     |          |
     |               \    |          |
     |                |---'          |
     |                |--------or----t
     |                |              |
     |                |              |---xor
     |                |              |
    (-)              (-)            (-)

1 1 0 0 input a
1 0 1 0 input b

0 1 1 0 a.nb+na.b xor

um

..:. na.b | na and b |

.:.. a.nb | a and nb |

:.:: na+b | na or b |

::.: a+nb | a or nb |

1, 2 and 3 bit functions

3 bit functions

iching

programming with hardware

--so far: this can sort three coins into one of four lines

--next:

• make live iching with js (done - ish)
• simulate coins - entropy circuit - look into avalanche transistor/diodes
• line selector - currently all lines are always the same
• need a clock to cycle thru all six lines

--next next: get an understanding of memory, registers, and displays

found out about logism and played with it all night don't really understand registers irl yet but made my iching animate it also helped me find an error in my original logic paths

this truth table is what i used to design the logic

patterns

and when you're done mountains will become mountains again