We showed that Exponentiation is Diophantine, completing the proof of the Davis-Matiyasevich-Putnam-Robinson theorem. The result follows from a careful examination of certain second order linear recurrence relations.
We showed that Exponentiation is Diophantine, completing the proof of the Davis-Matiyasevich-Putnam-Robinson theorem. The result follows from a careful examination of certain second order linear recurrence relations.
This entry was posted on Tuesday, March 11th, 2008 at 3:04 pm and is filed under 116b: Computability and incompleteness. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.