Related Experiment Video
Updated: Jan 22, 2026

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm
Published on: October 20, 2022
Algorithmic games for full ground references
Andrzej S Murawski1, Nikos Tzevelekos2
11University of Warwick, Coventry, UK.
Abstract:
We present a full classification of decidable and undecidable cases for contextual equivalence in a finitary ML-like language equipped with full ground storage (both integers and reference names can be stored). The simplest undecidable type is . At the technical level, our results marry game semantics with automata-theoretic techniques developed to handle infinite alphabets. On the automata-theoretic front, we show decidability of the emptiness problem for register pushdown automata extended with fresh-symbol generation.
Related Concept Videos
Taping Over Different Ground Profiles
Trial and Error and Algorithm
Inertial Frames of Reference
Non-inertial Frames of Reference
Chemical Shift: Internal References and Solvent Effects
The internal reference compound generally used in NMR spectroscopy is tetramethylsilane (TMS). TMS is preferred because it is chemically inert, soluble in NMR solvents, and easily removable. Also, the highly shielded methyl protons in TMS yield an intense...
Social Foundations of Self I: Play and Game

