Tutorial talk:Combinator tutorial
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.
- Thank you for this, designs are appreciated here. It's good that you remain objective about their advantages and disadvantages. -- Bilka (talk) - Admin 11:57, 13 May 2018 (UTC)
- Thank you for your incredible work on the Wiki. I am always 100% objective. In this particular scenario, the initial design is objectively flawed. Try connecting a simple clock (self-connected arithmetic combinator with + 1) into it and then disconnecting it suddenly, its memory will flicker between the last two values. More generally, if the current input is only given for 1 tick, then it flickers between the current and the previous input. I do not want to remove it without the approval of the original poster. Here is a demo of the flicker. This device on the left sends a 1-tick pulse of 1. The lamp turns on if the output signal is 1. -- SafwatHalaby (talk) 13:46, 13 May 2018 (UTC)
- (edit: fixed link): https://streamable.com/5r7w8
- Ok. Let's wait for a while in case the original poster has comments that we've missed.
- There's one advantage for the previous design: It's useful for someone that absolutely requires a reset-on-negative and not reset on a dedicated line, and does not care about the flicker issue. But that seems like a very rare edge case, and someone who needs it is most likely very experienced and doesn't need this guide. -- SafwatHalaby (talk) 15:54, 13 May 2018 (UTC)
Binary gates redundant?
- I am not very experienced in combinators, but aren't the combinators OR, XOR and AND option bitwise instead of binary? User:My3DS changed the page to specify that just yesterday, so it seems important to me. -- Bilka (talk) - Admin 11:57, 13 May 2018 (UTC)
- I am not sure I understand the difference between "bitwise" and "binary" in the context of 1-bit inputs.
- The built-in OR, XOR, and AND produce exactly the same truth tables as the ones currently in the article for inputs of 1's and zeros, and are additionally capable of performing more than that for inputs greater than 1.
I have updated the page to have some clarification of what is meant by bitwise and some additional notes on the gates, as some can function with boolean or non-boolean values (or binary vs non-binary values), and some can have more inputs. Let me know if something doesn't make sense or should be improved. I'm also not sure if the built in ones should be under the others or before it. BlackJack69 (talk) 00:19, 12 February 2019 (UTC)
This is not a beginner tutorial at the moment
This page seems inappropriate for circuit beginners and I've added a sentence at the beginning to keep beginners from getting frustrated; the circuit network page and cookbook page should be more helpful for beginners. A beginner section on this (or on a different page) that explains how to connect wires, how signals work and so on would be useful.
There's also a decent overlap with the cookbook page (the madzuri setup, memory cells, sr latches, logic gates). And virtual signals are explained here and on the circuit network page. That is not a problem as such but it means there is more work to keep it updated. In sections where the intended depth of explanation is comparable between the pages, it may be better to keep the content on one page and have a link on the other one. Unique 2 (talk) 23:25, 10 March 2019 (UTC)
Working on improving the Virtual Signal section
So far I've rewritten the section explaining wildcards, as it was very terse compared to overview at the Circuit network#Logic signals section. Given that this is a tutorial page, they should be explained in depth, which I attempted to do.