Computational Contextuality - Classical automata-based memory models can simulate specific examples of quantum contextuality. However, there also exist single qubit quantum automata that cannot be simulated by any fixed memory classical computational model. We investigate the possible role contextuality serves in these models by introducing the notion of computational contextuality. In return, the model provides fertile ground for developing a generic notion of quantum contextuality.

Simulation Bounds on Nonlocality - We construct a non-adaptive protocol that minimizes the error for simulating nonlocal correlations of n-bit threshold functions using at max n-1 partite resources. The majority function is shown to have an asymptotic error bound of 1/6, which matches the bound that needs to be violated for non-trivial communication complexity, while the maximum error bound is achieved for threshold 7n/12.