A game-semantic model of computation

The present paper introduces a novel notion of ‘(effective) computability,’ called viability , of strategies in game semantics in an intrinsic (i.e., without recourse to the standard Church – Turing computability ), non-inductive , non-axiomatic manner and shows, as a main technical achievement, tha...

Full description

Bibliographic Details

Published in:	Research in the mathematical sciences Vol. 6; no. 1; pp. 1 - 79
Main Author:	Yamada, Norihiro
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.01.2019 Springer Nature B.V
Subjects:	Applications of Mathematics Computation Computational Mathematics and Numerical Analysis Game theory Mathematical analysis Mathematics Mathematics and Statistics Number theory Semantics Theorems Turing machines Viability Secondary 68Q05 Primary 03D10
ISSN:	2522-0144, 2197-9847
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!