Editing User:Gelthor

337 editsJoined 28 October 2023
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.

Latest revision Your text
Line 1: Line 1:
{{Infobox level
[[arxiv:Test]]
| section            = Programming <!-- One of Basic Logic; Arithmetic; Memory; CPU Architecture; Programming; CPU Architecture 2; Functions; Assembly Challenges -->
arxiv>Test
| type                = Architechture <!-- One of Component; Architechture; Other -->
| architechture      = Overture <!-- Optional: One of Overture; Leg -->
| prerequisite1      = Conditions <!-- Immediate prequesite level 1/3 -->
| prerequisite2      = Immediate Values
| prerequisite3      = prerequisite3
| unlocks-level1      = Add 5 <!-- Which levels are opened on completion of this one 1/3 -->
| unlocks-level2      = unlocks-level2
| unlocks-level3      = unlocks-level2
| unlocks-component1  = Program <!-- Which components are unlocked by this level 1/5 -->
| unlocks-component2  = unlocks-component2
| unlocks-component3  = unlocks-component3
| unlocks-component4  = unlocks-component4
| unlocks-component5  = unlocks-component5 <!-- If more than 5 components unlocked describe them in unlock-notes -->
| unlocks-page1      = Turing complete <!-- Which manual page is unlocked -->
| unlocks-feature1    = unlocks-feature1 <!-- Which feature is unlocked -->
| unlock-notes        = Some other components, for example <!-- Additional text -->
| nocategory          = 1
}}


<br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/>
[[w:c:stratgeywiki:User/henke37]]
w:c:strategywiki>Henke37


==Smaller component test==
==Truth Table test==


{{Infobox level
{| {{truthtable}}
| section            = Programming
|+ NAND Gate Truth Table
| type                = Architechture
|-
| architechture      = Overture
! Input One !! Input Two !! Output
| prerequisite1      = Conditions
|-
| prerequisite2      = Immediate Values
| {{No}}|| {{No}}|| {{Yes}}
| unlocks-level1      = Add 5
|-
| unlocks-component1  = Program
| {{No}}|| {{Yes}}|| {{Yes}}
| unlocks-page1      = Turing complete
|-
| nocategory          = 1
| {{Yes}}|| {{No}}|| {{Yes}}
}}
|-
| {{Yes}}|| {{Yes}}|| {{No}}
|}


Loreum ipsum
As the truth table shows, a NAND gate returns true unless both inputs are true, then it returns false. so set the result accordingly and press the verify button.
 
==Prettyable test==
 
{| {{prettytable}}
|+ NAND Gate Truth Table
|-
! Input One !! Input Two !! Output
|-
| {{No}}|| {{No}}|| {{Yes}}
|-
| {{No}}|| {{Yes}}|| {{Yes}}
|-
| {{Yes}}|| {{No}}|| {{Yes}}
|-
| {{Yes}}|| {{Yes}}|| {{No}}
|}
 
As the truth table shows, a NAND gate returns true unless both inputs are true, then it returns false. so set the result accordingly and press the verify button.


==Infobox test==
==Infobox test==
<br/><br/><br/><br/><br/><br/>


{| class=wikitable style="float:right; margin-left: 10px;"
{| class=wikitable style="float:right; margin-left: 10px;"
Line 65: Line 66:


More testing, I guess?
More testing, I guess?
===tables===
{|{{truthtable|sortable=1}}
!A !! NOT(A)
|-
|data-sort-value="0"| {{off}} || data-sort-value="1"| {{on}}
|-
|data-sort-value="1"| {{on}} || data-sort-value="0"| {{off}}
|}
{|{{truthtable|sortable=1}}
!A !! NOT(A)
|-
|{{t off}} || {{t on}}
|-
|{{t on}} || {{t off}}
|}
{|{{truthtable|sortable=1|float=right}}
!A !! NOT(A)
|-
|{{off|t}} || {{on|t}}
|-
|{{on|t}} || {{off|t}}
|}
{|{{truthtable|sortable=1|float=right|style=font-size:0.8em}}
!B !! NOT(B)
|-
|{{off|t}} || {{on|t}}
|-
|{{on|t}} || {{off|t}}
|}
{| {{truthtable|sortable=1}}
!4-bits
|-
|data-sort-value="0" | {{Off}}{{Off}}{{Off}}{{Off}}
|-
|data-sort-value="1" | {{Off}}{{Off}}{{Off}}{{On}}
|-
|data-sort-value="2" | {{Off}}{{Off}}{{On}} {{Off}}
|-
|data-sort-value="3" | {{Off}}{{Off}}{{On}} {{On}}
|-
|data-sort-value="4" | {{Off}}{{On}} {{Off}}{{Off}}
|-
|data-sort-value="5" | {{Off}}{{On}} {{Off}}{{On}}
|-
|data-sort-value="6" | {{Off}}{{On}} {{On}} {{Off}}
|-
|data-sort-value="7" | {{Off}}{{On}} {{On}} {{On}}
|-
|data-sort-value="8" | {{On}} {{Off}}{{Off}}{{Off}}
|-
|data-sort-value="9" | {{On}} {{Off}}{{Off}}{{On}}
|-
|data-sort-value="10"| {{On}} {{Off}}{{On}} {{Off}}
|-
|data-sort-value="11"| {{On}} {{Off}}{{On}} {{On}}
|-
|data-sort-value="12"| {{On}} {{On}} {{Off}}{{Off}}
|-
|data-sort-value="13"| {{On}} {{On}} {{Off}}{{On}}
|-
|data-sort-value="14"| {{On}} {{On}} {{On}} {{Off}}
|-
|data-sort-value="15"| {{On}} {{On}} {{On}} {{On}}
|+4-bit binary example
|}
Please note that all contributions to Turing Complete are considered to be released under the Creative Commons Attribution-ShareAlike (see TuringComplete:Copyrights for details). If you do not want your writing to be edited mercilessly and redistributed at will, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource. Do not submit copyrighted work without permission!
Cancel Editing help (opens in new window)