If a parallel algorithm achieves speedup only by employing exponentially many processors relative to input size, there is little hope of building a concrete computing device to implement it
A set of computational steps designed to be executed simultaneously across multiple processors or computers working together, rather than one after another on a single processor.
Processors(as used in computer science)
The computing chips or units that actually do the calculations and execute instructions in a computer.
Speedup(as used in computer science)
How much faster a computation gets done when you use multiple processors working together compared to using just one.
Consider, for instance the following variation on the standard rules of Go: (i) the game is played on an \(n \times n\) board; (ii) the winner of the game is the player with the most stones at the end of \(n^2\) rounds. e. the player who moves first)? [30] What these games have in common is that the definition of a winning strategy for the player who moves first involves the alternation of existential and universal quantifiers in a manner which mimics the definition of the classes \(\Sigma^P_n\)