Picture 300 quiz papers to grade at one minute each. One teacher needs 300 minutes. Three teachers who each take a pile of 100 finish in 100 minutes, because no paper's grade depends on any other paper. That is the core of parallel computing: when the pieces of a job are independent, separate processors can work on them in the same moment.
The real speedup is usually lower than the number of workers, for two reasons. First, coordination costs time. If splitting the stack and merging three score sheets takes 20 minutes, the job takes 120 minutes, a speedup of 300/120=2.5 rather than 3. Second, some work cannot be split at all. If a tenth of a program must run step by step, no number of processors can make it more than 10 times faster, because that tenth alone still takes a tenth of the original time. This ceiling is called Amdahl's law.
Two things look like parallel computing but are not. A running bank balance, where each day's total needs yesterday's, cannot be divided: day 30 has to wait for day 29, however many cores are free. And a computer with a single core that plays music while you type is switching between the two jobs every few milliseconds. It feels simultaneous, but only one instruction runs at a time, so nothing finishes sooner. The difference is physical: more than one processor must be busy in the same instant, each on its own share of the work.
Think of it like this. A kitchen with four cooks chops four piles of vegetables four times as fast, but it can't bake one cake four times faster: the batter must be mixed before it goes in the oven. Someone also has to hand out the piles and collect the bowls, and with too many cooks that handing-out takes longer than the chopping.
Core idea. Parallelism can reduce running time, but only when the work can actually be split and coordinated well.