Computability Logic
(Sprache: Englisch)
Introduced by Giorgi Japaridze in 2003, computability logic is a research programme and mathematical framework for redeveloping logic as a systematic formal theory of computability, as opposed to classical logic which is a formal theory of truth. In this...
Leider schon ausverkauft
versandkostenfrei
Buch
29.00 €
Produktdetails
Produktinformationen zu „Computability Logic “
Klappentext zu „Computability Logic “
Introduced by Giorgi Japaridze in 2003, computability logic is a research programme and mathematical framework for redeveloping logic as a systematic formal theory of computability, as opposed to classical logic which is a formal theory of truth. In this approach logical formulas represent computational problems and their validity means being "always computable". Computational problems and resources are understood in their most general - interactive sense. They are formalized as games played by a machine against its environment, and computability means existence of a machine that wins the game against any possible behavior by the environment. Defining what such game-playing machines mean, computability logic provides a generalization of the Church-Turing thesis to the interactive level.
Bibliographische Angaben
- 2010, 72 Seiten, Maße: 15 x 22 cm, Kartoniert (TB), Englisch
- Herausgegeben von Miller, Frederic P.; Vandome, Agnes F.; McBrewster, John
- Verlag: Alphascript Publishing
- ISBN-10: 6130821352
- ISBN-13: 9786130821357
Sprache:
Englisch
Kommentar zu "Computability Logic"
0 Gebrauchte Artikel zu „Computability Logic“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Computability Logic".
Kommentar verfassen