User loginNavigation 
Introduction to computability logic
Introduction to computability logic (preprint)
... The intuitive notion of (interactive) computational problems is formalized as a certain new, proceduralrulefree sort of games (called static games) between the machine and the environment, and computability is understood as existence of an interactive Turing machine that wins the game against any possible environment.To all the lovers of games (and Turing machines :) To claim relevance to PLT: computability logic can be seen as an alternative to linear logic (both being resourceaware). Also, interactive programming can be seen as a game between a programmer and PL environment... Actually, I enjoyed the first part of the paper more (before getting to Turing machine). By Andris Birkmanis at 20040820 16:02  LtU Forum  previous forum topic  next forum topic  other blogs  11215 reads

Browse archivesActive forum topics 
Recent comments
17 min 33 sec ago
26 min 47 sec ago
1 hour 26 min ago
1 hour 47 min ago
2 hours 58 min ago
11 hours 31 min ago
12 hours 4 min ago
12 hours 31 min ago
12 hours 53 min ago
13 hours 1 min ago