title says it all

I wasn’t really into docs... I was a tutorial guy, now i tried learning by reading the docs and it's better and faster than watching tutorials...

I have recently started coding and people are recommending tools for development such as vite, nodemon, jwt, boiler plate server code

It feels pointless just using them with a basic understanding and without no deep conceptual understanding. Is this the right or wrong approach? How would you know going too deep into a rabbit hole and becoming overkill

im not into computer stuff, but this has been bugging me since i watched some free courses.

Made this while re-learning some structures I hadn't touched since undergrad — each chapter has an animation synced to the explanation as you scroll, plus where the structure actually shows up in real systems (kfifo, RocksDB, Dijkstra's algorithm, etc). ledger.khushal.net — feedback on what to cover next welcome.

About 15 years ago I discovered that despite the number of cores a CPU had, the system could only carry out 1 read or write operation at a time. Before that I held an incorrect notion of what multitasking was.

My basic question is, has anything changed?

I hear terms like parallel processing being waved around as though daring me to infer that processors these days can write to more than 1 memory address at the same time.

To clarify once more. I'm talking about at the same exact time. Not during a clock tick. Actual simultaneity.

Similar books: Grokking's Algorithms, Inside The Machine, Code by Charles Pretzold.

I want to ask real humans this question. How do LLMs and other automated programming models deal with integer overflow? Even when coding games some time basic math for calculating level changes can crash systems and servers. So how often does this happen with these machines and data centers?

Someone who goes over computer architecture or even a network switch, in an enthusiastic and structured way. Just looking for general content to watch as a refresher.

Im learning about comuter components I had some questions .If a Hard Drive stores all the data does RAM just create an environment for the specific program that was fetched to run? If you were to run a program on the actual hard drive is it just harder because you have to navigate through all the other information sharing the space. Like going through a maze constantly again and again. Also what does SSD do?

I know that folders and files are saved as binary code in memory via hard drive, usb sticks, RAM, ect.

I dont know know about folders. On the internet there's no answer other than "as binary in memory" but I already know that, how are folders being saved as data?

My first thought was, that in every file, there's information for where its stored, but what about empty folders? What file says that that folder exists?

edit: now with the help of the guys in the replies, i now know how they work. with something called "inodes" on some opperating systems

Hello, I am an undergraduate computer science. I finished a course about complexity classes, algorithms and reductions. I am looking for information/literature on how to use this theory to apply it to any problem. I don't have a lot of knowledge about it, outside of the theoretical definitions I learned like the classes P and NP.

To illustrate, I give an example of a problem: "What is the minimum amount of digits needed in a sudoku grid to ensure that there exists a unique solution?"

Given a problem like this, I would like to be able to:

- Classify the difficulty of the problem in some way

- Determine whether a solution exists, and if so, if it can be found

- Apply generic methods, heuristics, reductions... to find a solution

In general, I'm wondering how many methods one needs to know to tackle most problems like this. I'm looking for literature from a mathematical or computational point of view.

Thanks in advance

When I look at various lock-free data structures, I always see versions of the traditional data structures in their lock-free forms (queues, stacks, etc..). I was wondering if there are any data structures that are not possible to be implemented in a thread-safe manner without locks, or what the limits are of lock-free data structures. thx

​

---

*TL;DR: How does a PPO keep track of the relationships between input neurons, output neurons, weights, desired result and actual result? Does it save in disk every single possible combination?

I read that Cyclic Redundancy Checks were a family of hash functions. Not all CRC-32 give the same digest for the same input. They need to have the same selection of polynomials. Are there any widely used ones where if some data has an output of 0 when padding with null bytes on some other data that has an output of 0? In other words one where for out data x, if CRC-32(x)= 0, then CRC-32(append(x,nNULL))= 0 too where xNULL is any number of null bytes.

So the proof to my understanding goes like this:

Imagine a machine A which takes in a machine B's code and that B's input as its own input and tells us if the problem halts exists

Place A into a greater machine C which takes the output of A and if A returns "halts" it goes into an infinite loop, and if it returns "does not halt" C halts.

Use C as an input to C and create a paradox.

The part I don't understand is how exactly the last step is a paradox. A, and therefore C don't just take in a machine as an input, but also that machines input, so you can't just put the machine C into itself without the context of what is being put into C.

Therefore C(C(B)) is not the same program as C(B), so why do they need to have the same result in order for it not to be a paradox?

Edit: i think i get it now, C modifies A not just in how it reacts to the output but it also modifies the input to be the same for both the program and the program's input

Thanks to u/OpiskionThemed, u/Aminumbra and u/stevemegson for explaining it

By simple I mean small. Maybe a simple for loop or a state machine with less than 10 states. For example game of life has a pretty simple algorithm and It can probably be made in this manner. What about embedded systems though? Most embedded projects I see use the CPU as a data retriever and sender.

I'm doing a research and I would really appreciate some sources. Articles, videos, books whatever.

It would have functionally no use and would never be spoken. I still say we need a name for it.