Tutorial talk:Combinator tutorial: Difference between revisions
Jump to navigation
Jump to search
SafwatHalaby (talk | contribs) No edit summary |
SafwatHalaby (talk | contribs) (→Binary gates redundant?: new section) |
||
| Line 7: | Line 7: | ||
I may post some of my designs here once I finish polishing them. | I may post some of my designs here once I finish polishing them. | ||
-- [[User:SafwatHalaby|SafwatHalaby]] ([[User talk:SafwatHalaby|talk]]) 09:46, 13 May 2018 (UTC) | -- [[User:SafwatHalaby|SafwatHalaby]] ([[User talk:SafwatHalaby|talk]]) 09:46, 13 May 2018 (UTC) | ||
== Binary gates redundant? == | |||
The binary gates do not seem to have much function, because As of 0.16, arithmetic combinators have built-in binary logic support. -- [[User:SafwatHalaby|SafwatHalaby]] ([[User talk:SafwatHalaby|talk]]) 09:56, 13 May 2018 (UTC) | |||
Revision as of 09:56, 13 May 2018
Memory cells
I am aiming to update the "memory cells" section.
- The "advanced cell" does not handle 1-tick bursts properly. (I updated the article and wrote about that)
- There should be more versions of the memory cell, including versions that can handle negative input.
I may post some of my designs here once I finish polishing them. -- SafwatHalaby (talk) 09:46, 13 May 2018 (UTC)
Binary gates redundant?
The binary gates do not seem to have much function, because As of 0.16, arithmetic combinators have built-in binary logic support. -- SafwatHalaby (talk) 09:56, 13 May 2018 (UTC)