On Games and Computation
Abstract
We introduce and investigate a range of general notions of a game. Our principal notion is based on a set of agents modifying a relational structure in a discrete evolution sequence. We also introduce and study a variety of ways to model partial and erroneous information in the setting. We discuss the connection of the related general setting to logic and computation formalisms, with emphasis on the recently introduced Turing-complete logic based on game-theoretic semantics.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.