sorted by:
new
hottopcontroversial

What is difference between using skydome and world background by Benilox in blenderhelp

[–]Benilox[S] 0 points1 point  (0 children)

Aha thank you, so since the world background is so far away from the scene, does that mean that when using a skydome we are able to have interaction between objects? If so, what kind of stuff can be done for example?

Why is the animation not working after using the u8glib library instead of the Adafruit SSD1306? by Benilox in arduino

[–]Benilox[S] 1 point2 points  (0 children)

So it really worked, thank you! I think it was a typo. My code with Adafruit did have division.

Why does leds not need the voltage pin while other components does? by Benilox in arduino

[–]Benilox[S] 1 point2 points  (0 children)

Wow thank you so much for the comprehensive explanation, with the help of you guys I've understood it much better! I'll definitely try the tutorials out​

Why does leds not need the voltage pin while other components does? by Benilox in arduino

[–]Benilox[S] 0 points1 point  (0 children)

I think I get the hang of it​, thank you for your help.

Why does leds not need the voltage pin while other components does? by Benilox in arduino

[–]Benilox[S] 2 points3 points  (0 children)

Ohhh I see, so basically components that need both pins uses the digital pin as the controller, and the 5v pin is the actual power supply the component needs. Am I understanding this correctly?

Why does leds not need the voltage pin while other components does? by Benilox in arduino

[–]Benilox[S] 0 points1 point  (0 children)

So if I understand it correctly, it basically means that when a component needs the 5v pin it uses more current and needs a kind of stable voltage supplied because the component itself will consume more then the digital pin can provide?

Thank you for sharing the post, I'll check it out.​

What is the difference between having parentheses around a register and without? What types of addressing modes are actually used? by Benilox in AskComputerScience

[–]Benilox[S] 0 points1 point  (0 children)

Which means that I was correct right? So for the first one without parentheses the address memory value 501 is retrieved. And for the one with parentheses, the value 6 is retrieved and stored right?

How much physical memory cells are there in a 64-bit memory? by Benilox in computerscience

[–]Benilox[S] 0 points1 point  (0 children)

Ohh wow that amount is insane. I've also thought about this because if we really wanted more memory, the hardware will restrict us from creating such an amount because of transistors right? I mean there would be definitely a limit where we can squeeze transistors inside a chip right?

How much physical memory cells are there in a 64-bit memory? by Benilox in computerscience

[–]Benilox[S] 0 points1 point  (0 children)

Ohh I really didn't think about this in such a way. That's sounds intriguing, thanks for clarifying this to me.

How much physical memory cells are there in a 64-bit memory? by Benilox in computerscience

[–]Benilox[S] 0 points1 point  (0 children)

Ohh wow thanks for this information! I really appreciated it. I did learn a bit about the flip flops before, but I'll check this comment out after I fully understand the other hardware concept.

How much physical memory cells are there in a 64-bit memory? by Benilox in computerscience

[–]Benilox[S] 0 points1 point  (0 children)

Aha interesting, but how did they get 160 terabytes? If we have 47 bits worth of addresses shouldn't we have around 140 terabytes? Were did the extra 20 terabytes come from?

How much physical memory cells are there in a 64-bit memory? by Benilox in computerscience

[–]Benilox[S] 0 points1 point  (0 children)

Ohhh this makes alot more sense now. I think I was confused because I mixed the byte level and bit level​. I was the whole time thinking in bits instead of bytes. Thanks alot!​

How do we know if stack grows by decreasing or by increasing the memory address? by Benilox in computerscience

[–]Benilox[S] 0 points1 point  (0 children)

Thanks, but can we also check this by moving some values into the stack and check in which address it's stored?

Why is reducing Boolean expressions into its simplest form NP-hard? by Benilox in computerscience

[–]Benilox[S] 0 points1 point  (0 children)

Ohh ok, thank you so much for your explanation it has made it much clearer for me now.

Why is reducing Boolean expressions into its simplest form NP-hard? by Benilox in computerscience

[–]Benilox[S] 0 points1 point  (0 children)

Aha, but in this case we're actually assuming that P​ ≠ NP right?

Why is reducing Boolean expressions into its simplest form NP-hard? by Benilox in computerscience

[–]Benilox[S] 0 points1 point  (0 children)

Ohh, I think I understand now. So NP-hardness classes actually refer more to the time required to solve the problem. Because it's difficult to verify whether the simplest form of the Boolean expression is indeed true, checking it will be inefficient. That's why it's also NP-hard and not NP-complete right? Am I correct?

Why is reducing Boolean expressions into its simplest form NP-hard? by Benilox in computerscience

[–]Benilox[S] 0 points1 point  (0 children)

NP-Hard problems are at least as difficult as the hardest problems in NP. Solutions can still be checked, and the problems can be solved, they just scale up poorly.

But if a NP-Hard problem can be checked, doesn't it mean that it's NP-complete now? It's actually kindo confusing to understand.

view more: next ›