trude/web
1
0
Fork 0
mirror of https://github.com/TrudeEH/web.git synced 2025-12-06 08:23:37 +00:00
Code Issues Packages Projects Releases Wiki Activity

Finish proofreading computer

Browse Source
This commit is contained in:
TrudeEH
2025-03-24 15:59:56 +00:00
parent 32abca967d
commit 0a5d02da65
2 changed files with 41 additions and 41 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
content/.obsidian/workspace.json vendored
View File

@@ -78,7 +78,7 @@
} }
], ],
"direction": "horizontal", "direction": "horizontal",
"width": 312.5 "width": 224.5
}, },
"right": { "right": {
"id": "f049c1d8215eafd9", "id": "f049c1d8215eafd9",
@@ -161,7 +161,7 @@
} }
} }
], ],
"currentTab": 4 "currentTab": 3
} }
], ],
"direction": "horizontal", "direction": "horizontal",
@@ -179,7 +179,7 @@
"table-editor-obsidian:Advanced Tables Toolbar": false "table-editor-obsidian:Advanced Tables Toolbar": false
} }
}, },
"active": "ab03f7100c1ce0fb", "active": "91a2b2f8427bd50b",
"lastOpenFiles": [ "lastOpenFiles": [
"textgenerator/templates/awesomePrompts/statisticianAwesome.md", "textgenerator/templates/awesomePrompts/statisticianAwesome.md",
"textgenerator/templates/awesomePrompts/techreviewerAwesome.md", "textgenerator/templates/awesomePrompts/techreviewerAwesome.md",

76
content/notes/ready/how_to_computer/index.md
View File

@@ -188,7 +188,7 @@ Implementation using switches (transistors could be used instead) and a pull-up
### NOT ### NOT
Invert any given input. Invert a given input.
![image42](image42.png) ![image42](image42.png)
@@ -300,7 +300,7 @@ Outputs `1` if at least one input is `1`.
An OR gate followed by a NOT gate. An OR gate followed by a NOT gate.
A NOR gate is can also be used to build every other gate, just like NAND. However, NAND gates are preferred over NOR gates, as, in modern computers, they occupy less area and have less delay. A NOR gate is can also be used to build every other gate, just like NAND. However, NAND gates are preferred over NOR gates, as, in modern computers, they occupy less area and cause less delay.
![image46](image46.png) ![image46](image46.png)
@@ -321,7 +321,7 @@ A NOR gate is can also be used to build every other gate, just like NAND. Howeve
### XOR ### XOR
Either input is `1`, exclusively. (OR, but if both inputs are on, it turns off.) Either input is `1`, exclusively. (Similar to `OR`, but if both inputs are on, it turns off.)
![image47](image47.png) ![image47](image47.png)
@@ -598,7 +598,7 @@ The larger the Address Bus is, the more bits can be managed. This is why a 32bit
![image92](image92.png) ![image92](image92.png)
This kind of RAM is Static RAM (**S**RAM), which uses many transistors, making it faster, but is more expensive to produce than **D**RAM. This kind of RAM is called Static RAM (**S**RAM), which uses many transistors, making it faster, but is more expensive to produce than **D**RAM.
## CPU Architecture ## CPU Architecture
@@ -650,7 +650,7 @@ Instructions:
## Putting it All Together ## Putting it All Together
We can now use the previous components to build and OVERTURE architecture computer! We can now use the previous components to build an OVERTURE architecture computer!
### Upgraded Register ### Upgraded Register
@@ -776,34 +776,34 @@ For example, to represent text, it's very common to use either ASCII or UNICODE.
The table below is only part of the ASCII standard, used for capitalized letters: The table below is only part of the ASCII standard, used for capitalized letters:
| Dec | Hex | Binary | HTML | Char | | Dec | Hex | Binary | HTML | Char |
| --- | --- | -------- | -------- | ---- | | --- | --- | -------- | ------- | ---- |
| 65 | 41 | 01000001 | `A` | A | | 65 | 41 | 01000001 | `A` | A |
| 66 | 42 | 01000010 | `B` | B | | 66 | 42 | 01000010 | `B` | B |
| 67 | 43 | 01000011 | `C` | C | | 67 | 43 | 01000011 | `C` | C |
| 68 | 44 | 01000100 | `D` | D | | 68 | 44 | 01000100 | `D` | D |
| 69 | 45 | 01000101 | `E` | E | | 69 | 45 | 01000101 | `E` | E |
| 70 | 46 | 01000110 | `F` | F | | 70 | 46 | 01000110 | `F` | F |
| 71 | 47 | 01000111 | `G` | G | | 71 | 47 | 01000111 | `G` | G |
| 72 | 48 | 01001000 | `H` | H | | 72 | 48 | 01001000 | `H` | H |
| 73 | 49 | 01001001 | `I` | I | | 73 | 49 | 01001001 | `I` | I |
| 74 | 4A | 01001010 | `J` | J | | 74 | 4A | 01001010 | `J` | J |
| 75 | 4B | 01001011 | `K` | K | | 75 | 4B | 01001011 | `K` | K |
| 76 | 4C | 01001100 | `L` | L | | 76 | 4C | 01001100 | `L` | L |
| 77 | 4D | 01001101 | `M` | M | | 77 | 4D | 01001101 | `M` | M |
| 78 | 4E | 01001110 | `N` | N | | 78 | 4E | 01001110 | `N` | N |
| 79 | 4F | 01001111 | `O` | O | | 79 | 4F | 01001111 | `O` | O |
| 80 | 50 | 01010000 | `P` | P | | 80 | 50 | 01010000 | `P` | P |
| 81 | 51 | 01010001 | `Q` | Q | | 81 | 51 | 01010001 | `Q` | Q |
| 82 | 52 | 01010010 | `R` | R | | 82 | 52 | 01010010 | `R` | R |
| 83 | 53 | 01010011 | `S` | S | | 83 | 53 | 01010011 | `S` | S |
| 84 | 54 | 01010100 | `T` | T | | 84 | 54 | 01010100 | `T` | T |
| 85 | 55 | 01010101 | `U` | U | | 85 | 55 | 01010101 | `U` | U |
| 86 | 56 | 01010110 | `V` | V | | 86 | 56 | 01010110 | `V` | V |
| 87 | 57 | 01010111 | `W` | W | | 87 | 57 | 01010111 | `W` | W |
| 88 | 58 | 01011000 | `X` | X | | 88 | 58 | 01011000 | `X` | X |
| 89 | 59 | 01011001 | `Y` | Y | | 89 | 59 | 01011001 | `Y` | Y |
| 90 | 5A | 01011010 | `Z` | Z | | 90 | 5A | 01011010 | `Z` | Z |
You may have used RGB values before. These are used to represent a color: You may have used RGB values before. These are used to represent a color:
@@ -870,7 +870,7 @@ Instructions:
#### Equal #### Equal
Calculating equality can be done by subtracting both inputs, then verifying that the result is 0. Calculating equality can be done by subtracting both inputs, then verifying if the result is 0.
![Pasted image 20250311091659](Pasted%20image%2020250311091659.png) ![Pasted image 20250311091659](Pasted%20image%2020250311091659.png)
@@ -907,7 +907,7 @@ You may notice how the stack is being populated from the last byte instead of th
The assembly for LEG might even be simpler than OVERTURE's. There are a few things to keep in mind, though: The assembly for LEG might even be simpler than OVERTURE's. There are a few things to keep in mind, though:
- `REG4` was renamed to `ADDR`, as it is more commonly used as the memory address, opposed to a regular register. - `REG4` was renamed to `ADDR`, as it is more commonly used as the memory address, opposed to a regular register.
- There is no `COPY` statement. Instead, `ADD` a value with 0 to select a destination to copy to. Keep in mind that 0 is `REG0` in this context, so it must be kept empty while copying values. - There is no `COPY` statement. Instead, `ADD` a value with 0 to select a destination to copy to. Keep in mind that 0 is `REG0` in this context, so it must be kept empty while copying values.
- If a value in a command is 0, it must be typed with an actual 0 in that place. This is because the clock is fixed, and if an instruction only uses 2 or 3 bytes instead of 4, the unused bytes must be set to 0, to not misalign the next clock cycle. A solution to this problem would be to implement a variable counter, capable of skipping unused bytes. This would complicate the physical circuit quite a bit, and so I decided against implementing it. - If a value in a command is 0, it must be typed with an actual 0 in that place. This is because the clock is fixed, and if an instruction only uses 2 or 3 bytes instead of 4, the unused bytes must be set to 0, to not misalign the next clock cycle. A solution to this problem would be to implement a variable counter, capable of skipping unused bytes. This would complicate the physical circuit quite a bit, and so I decided against implementing it for this example.
#### Assembly Codes #### Assembly Codes
@@ -1009,8 +1009,8 @@ CALL 0 0 functionName
Every circuit in this post was designed by me, mostly through trial and error, so the source would quite literally be: I made it up. `¯\_(ツ)_/¯` Every circuit in this post was designed by me, mostly through trial and error, so the source would quite literally be: I made it up. `¯\_(ツ)_/¯`
Most screenshots were taken from Turing Complete, a simulator/game on Steam. As the name suggests, the simulator attempts to teach you the basics of computing, and give you a platform to test and develop on. If you've read this far, I highly recommend you to try it! Most screenshots were taken from Turing Complete, a simulator available for purchase on Steam. As the name suggests, the simulator attempts to teach you the basics of computing, and give you a platform to test and develop on. If you've read this far, I highly recommend you to try it!
If you find that I made a mistake, want to improve one of my circuits, or have any constructive feedback to share, please contact me, and I will happily add your name to the credits. If you found that I made a mistake, want to improve one of my circuits, or have any constructive feedback to share, please contact me, and I will happily add your name to the credits.
Everything in this website, including other notes and posts (and the website itself) are open-source, licensed under the `MIT`. Feel free to use it for your own research. If you'd like to submit a PR or Issue on [GitHub](https://github.com/TrudeEH/web), I would appreciate it! Everything in this website, including other notes and posts (and the website itself) is open-source, licensed under the `MIT`. Feel free to use it for your own research. If you'd like to submit a PR or Issue on [GitHub](https://github.com/TrudeEH/web), I would appreciate it!