Particular parallel models (grammars, automata), Models of computation in the 2nd class, mutual simulations, Parallel computation theses., Complexity classes and problems efficiently solvable in parallel (NC, P-complete problems), Limitations of parallel computations.

Type of methodology: Combination of lecture and hands-on

Participants receive the certificate of attendance: Yes

Paid training activity for participants: Yes, for all

Participants prerequisite knowledge: Numerical methods (linear algebra, statistics) Domain-specific background knowledge