On Games and Computation

10/31/2019
by   Antti Kuusisto, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2021

Arboreal Categories: An Axiomatic Theory of Resources

We introduce arboreal categories, which have an intrinsic process struct...
research
04/27/2020

Beyond formulas-as-cographs: an extension of Boolean logic to arbitrary graphs

We propose a graph-based extension of Boolean logic called Boolean Graph...
research
06/29/2019

An Overview of the Ludii General Game System

The Digital Ludeme Project (DLP) aims to reconstruct and analyse over 10...
research
01/06/2021

Ludii Game Logic Guide

This technical report outlines the fundamental workings of the game logi...
research
01/26/2019

Credulous Acceptability, Poison Games and Modal Logic

The Poison Game is a two-player game played on a graph in which one play...
research
06/24/2022

Notes on presheaf representations of strategies and cohomological refinements of k-consistency and k-equivalence

In this note, we show how positional strategies for k-pebble games have ...
research
05/06/2022

Defying Gravity: The Complexity of the Hanano Puzzle

Liu and Yang [LY19] recently proved the Hanano Puzzle to be NP-≤_m^p-har...

Please sign up or login with your details

Forgot password? Click here to reset