See this document in CiteSeerX!

Computability and Complexity in Games  (Make Corrections)  
K. (Vela) Velupillai Department of Economics The Queen's University of...



  Home/Search   Context   Related

 
View or download:
ucla.edu/papers/vela/comp...complexy.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ucla.edu/papers/vela/complexit... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper I aim to discuss the question of effective playability and the computational and diophantine complexity of Rabin-type games (Update)

Active bibliography (related documents):   More   All
0.5:   Combinatorial Game Theory Foundations Applied to Digraph Kernels - Fraenkel (1997)   (Correct)
0.3:   Information-theoretic Limitations of Formal Systems - Chaitin (1974)   (Correct)
0.3:   Uncomputably Large Integral Points On Algebraic Plane Curves? - Rojas (1998)   (Correct)

Similar documents based on text:   More   All
0.1:   Reducing the Elliptic Curve Cryptosystem of Meyer-Müller to.. - Joye, Quisquater (1996)   (Correct)
0.1:   On Exponentiation - A Solution to Tarski's High School Algebra.. - Wilkie (2001)   (Correct)
0.1:   Rabin Measures - Klarlund, Kozen (1995)   (Correct)

BibTeX entry:   (Update)

@misc{ velupillai-computability,
  author = "Vela Velupillai",
  title = "Computability and Complexity in Games",
  url = "citeseer.ist.psu.edu/111045.html" }
Citations (may not include all citations):
105   Computability and Logic (context) - Boolos, Jeffrey - 1989
20   Computational Models of Games (context) - Condon - 1989
9   On Play by Means of Computing Machines (context) - Megiddo, Wigderson - 1986
6   Hilbert's Tenth Problem. Diophantine Equations: Positive Asp.. (context) - Davis, Matijasevic et al. - 1976
3   Classification of Quantifier Prefixes over Diophantine Equat.. (context) - Jones - 1981
3   Computer Studies of Turing Machine Problems (context) - Lin, Rado - 1965
2   Effective Computability of Winning Strategies (context) - Rabin - 1957
1   Three Universal Representations of Recursively Enumerable Se.. (context) - Jones - 1978
1   On Non-Computable Functions (context) - Tucker, Wolfe et al. - 1962
1   Modelling Rational Players: Pt (context) - Binmore - 1987
1   Computable Economics: The Fourth Arne Ryde Lectures (context) - Velupillai - 1995
1   Complexity in Economic Theory - An Automata Theoretical Appr.. (context) - Holm - 1993
1   Recursive Undecidability-An Exposition (context) - Jones - 1974
1   Hilbert's Tenth Problem (context) - Matiyasevic - 1994

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC