Toggle search
Search
Toggle menu
notifications
Toggle personal menu
Editing
FAQ
(section)
From Turing Complete
Views
Read
Edit
Edit source
View history
associated-pages
Page
Discussion
More actions
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.
Anti-spam check. Do
not
fill this in!
===Common abbreviations=== * '''1bm''': One Bit Memory. The component in the game capable of storing a single bit with a save signal. * '''CC''': Custom Component, one made in the Component Factory. * '''CLA''': Carry Look Ahead. A special way of building Byte adders that reduces delay. * '''CS''': Computer Science. * '''DAG''': Directed Acyclic Graph. A special kind of graph, used in the game for simulation. This is the reason why cyclic dependencies aren't possible without {{Component|Delay Line|Delay Lines}}. * '''DB''': Delayed Buffer. An obsolete term for the {{Component|Delay Line}} component in the game that outputs the value that was input in the tick before. * '''FA''': {{Component|Full Adder}}. The level/component in the game that adds 3 bits to a 2 bit result. * '''LFSR''': Linear Feedback Shift Register. A NAND efficient alternative to Counters. * '''LUT''': Look Up Table. A common pattern for good solutions for combinatorical levels.
Summary:
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)