[+] Undecidability & Pcompleteness. Bounded team games with private information are NEXPTIMEcomplete: bounded Team Private Constraint Logic (TPCL). Unbounded team games with private information are undecidable: Team Computation Game, Team Formula Game, TPCL. Pcompleteness: NC, Pcomplete, machine simulation, Circuit Value Problem, SAM2CVP, bounded DCL, lexically first maximal independent set (greedy).  
This lecture completes our coverage of games, explaining how it can be undecidable to determine winning strategies in games with bounded “resources”, when those games have private information and teams. Essentially, we can exploit the player's “heads” to store an arbitrarily large amount of information, and perform an arbitrarily complex computation in a long sequence of moves, even though the game's memory is itself small. In particular, the natural version of Constraint Logic is undecidable. (If the game has polynomially bounded length, however, the game is “only” NEXPTIMEcomplete.) This lecture also covers the notion of Pcompleteness (a frequent request from the survey), which is about the limits of parallel computation. Pcomplete problems are likely not in NC, meaning that they cannot be solved in polylogarithmic time even given a polynomial number of processors/gates. Constraint logic can be adapted here too, with bounded DCL. One detail here is that reductions need to be parallel algorithms, but this is pretty easy in gadgetbased reductions. 
Handwritten notes, page 1/9 •
[previous page] •
[next page] •
[PDF]
Handwritten notes, page 1/9 • [previous page] • [next page] • [PDF] 

Slides, page 1/10 •
[previous page] •
[next page] •
[PDF]
Slide from Lecture 1. http://erikdemaine.org/papers/GPC/ Slides, page 1/10 • [previous page] • [next page] • [PDF] 