Parallel scans and full series scans

There is a question, since parallel scans and full series scans are all processed, why is the parallel scan time constant?

I think so: the example given in this article is that parallel scanning should not only process 123456, but should process 123456 other information that enters the short-term memory, such as paper color, screen brightness, and other non-item information but belongs to short-term memory, so that the parallel processing not only processes the item information but also processes other information that enters the sensory memory, because the sensory information processing capacity is limited, so under the change of the length of the item, the overall processed sensory memory information does not change. So the parallel scan time has always been constant, while the full series of scans varies with the length of the project. Isn't that right?

The so-called parallel scans are:

For example, if there is a column of numbers, 123456, parallel scanning is to process these six numbers at the same time. These six numbers are processed in no particular order. If the experiment is to find a certain target number, because these numbers are processed at the same time, no matter how many numbers there are, the time taken to find the target number is constant.

So the expected graph is a flat line.

In addition to parallel scanning, there are series scans, and the so-called series scans are:

For example, if there is a column of numbers, 123456, a series of scans is to process the numbers from 1 to the end of the scanning, and the order of the processed numbers is carried out in the order of a column of numbers. If you want to find a target number, let's say 4. Then start with 1, then 2, then 3, then 4, and you find it.

There are two types of series scans, one is the full series of scans you asked, and the other is the series of scans that automatically stop. Take the example of the target number 4.

If it is a series of scans that stop automatically, then when the number 4 is found, the entire process is automatically stopped and no longer proceeds. If you can't find your target number, you'll keep looking. Therefore, no matter how many numbers there are, if the target number is not included in the expected graph, the reaction time will be relatively long, because it cannot be automatically stopped after finding the target number.

In the case of a full series scan, after finding the number 4, the processing will continue until the entire sequence of numbers has been processed. For example, after finding 4, it will still process until 6 before stopping. At this time, no matter how many digits there are, there are target digits and there are no target digits, the scan time should be exactly the same, that is, the time taken to scan all the digits in a complete series, and the two lines should be parallel on the expected graph.

On the three hypothetical diagrams, he drew two lines, one with a solid line and the other with a dotted line, which should be better understood. In practice, the two lines should coincide (only the auto-stop scan should be at an angle).

In the end, Sternberg's experimental results support the hypothesis of a complete series of scans, and the final results show that the two lines do coincide exactly. Therefore, it proves that the person follows a complete series of scanning rules when machining.

If you use your apple example. If the target is a rotten apple, a parallel scan means that no matter how many apples there are, you will always find the rotten apple right away. A full series of scans means that you will see if the rotten ones are one by one, and when you find the rotten ones, you will look at the rest.

Automatically stop scanning means that when you find a rotten apple, you will automatically stop looking at it.

PS: I forgot if the phrase "auto-stop series scanning" was right, I didn't bring it in the book today, if it's not right, you understand it anyway, it's the other one in addition to parallel scans and full series.