Is chess recursive?

Reply Thu 24 Jun, 2010 03:38 pm
Chess is a formal system. Here is why:
initial positions<====> axioms
Any configuration on the board is easily checked if it is a valid arrengement, so, there is formation rules.
Any configuration derivable from the initial position <===> theorems

But, can it describe itself, or made statements about it self? No, or yes?

Godel uses godel numbering to map theorem in a formal system to numeral relations. Can this be done with chess? Could the godel number for such confirguration be a proof of that configuration?
  • Topic Stats
  • Top Replies
  • Link to this Topic
Type: Discussion • Score: 0 • Views: 2,286 • Replies: 0
No top replies


Related Topics

Anybody want to play me? - Discussion by mister kitten
Engineer (w) vs Cycloptichorn (b) - Discussion by engineer
Notation For Using A2K Chess Widget - Discussion by wandeljw
A2K Chess Game Test: Anyone vs. Anyone - Discussion by Robert Gentel
Play chess? - Question by Homomorph
A chess video - Discussion by lmur
Chinese games? Confused... - Discussion by water
the kings position - Question by jvfoste
A2K Chess - Cyclo(w) v. Robert (b) - Discussion by Cycloptichorn
  1. Forums
  2. » Is chess recursive?
Copyright © 2024 MadLab, LLC :: Terms of Service :: Privacy Policy :: Page generated in 0.03 seconds on 07/24/2024 at 04:23:12