this post was submitted on 21 Aug 2023
746 points (98.4% liked)

Memes

45753 readers
1928 users here now

Rules:

  1. Be civil and nice.
  2. Try not to excessively repost, as a rule of thumb, wait at least 2 months to do it if you have to.

founded 5 years ago
MODERATORS
 
you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 152 points 1 year ago (2 children)

there are 8 logic gates in a byte

uh. no? a logic gate isn’t a bit. you can store a single bit with a pair of not gates to make a flip flop, but the core logic here is flawed

[–] [email protected] 78 points 1 year ago (1 children)

Right? Even if it weren't, this only calculates how many crabs it would take to store Doom, not run it.

[–] [email protected] 36 points 1 year ago (4 children)

No mention of fps or latency, authors clearly not gamers.

Imagine some Smash Bros players who get pissy about 16.6ms playing on a CrabCPU with 13s latency...

[–] [email protected] 6 points 1 year ago

Authors never said anything about gaming, the tweet did

[–] Lev_Astov 5 points 1 year ago

With over sixteen billion crabs involved, I'm sure the latency would be measured in years.

[–] [email protected] 1 points 1 year ago

smash keys spend 15:30 delay in processing to go make tendies and hunny mussy return in time to watch mayhem ensue

I see no downsides to this.

[–] [email protected] 26 points 1 year ago (5 children)

you can store a single bit with a pair of not gates to make a flip flop

Isn't it a pair of NAND gates? You can make anything with NAND gates.

Like this:

[–] candybrie 20 points 1 year ago* (last edited 1 year ago)

You can also do it with NOT gates. The driver needs to overpower the gates to change the bit and then it acts like a D flip flop rather than an RS flip flop like NAND gates will. But that's generally how they're actually made. SRAM generally looks like this: The side transistors are called access transistors; they're there so you can selectively read/write, but aren't needed to store the bit.

[–] kautau 5 points 1 year ago* (last edited 1 year ago) (2 children)

So here’s some bad math. 160 crabs per NAND gate / byte. Doom’s original file size is roughly 2.39MB (I couldn’t find an actual source for this but it’s touted all over the web).

So 2390000 bytes * 160 crabs is 382400000 crabs.

So you can run doom on 382.4 million crabs

Edit: store, not run

[–] [email protected] 9 points 1 year ago

you can ~~run~~ store doom

[–] [email protected] 2 points 1 year ago

2 NAND gates are only a bit. You need 8 of those for a byte, that is 8 * 160 = 1280 crabs. For Doom you need 1280 * 2390000 = 3059200000 = 3059.2 million crabs

[–] [email protected] 5 points 1 year ago

yes, tired brain hiccup :)

[–] [email protected] 2 points 1 year ago (1 children)
[–] [email protected] 5 points 1 year ago

They've got diagrams of OR and AND gates with the crabs.

I feel like they would need a NOT gate to do anything meaningful, which obviously isn't possible. You can't have zero crabs going in with crabs coming out. Without a NOT gate I don't think they can do much in the way of traditional computing - you probably can't run Doom on any number of crabs (although I'd love to be proven wrong).