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...

Celý popis

Podrobná bibliografia

Vydané v:	Research in the mathematical sciences Ročník 6; číslo 1; s. 1 - 79
Hlavný autor:	Yamada, Norihiro
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.01.2019 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!