{"id":3098,"date":"2013-03-08T06:07:56","date_gmt":"2013-03-08T06:07:56","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/?p=3098"},"modified":"2013-03-10T06:09:42","modified_gmt":"2013-03-10T06:09:42","slug":"resena-mechanising-turing-machines-and-computability-theory-in-isabellehol","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/resena-mechanising-turing-machines-and-computability-theory-in-isabellehol\/","title":{"rendered":"Rese\u00f1a: Mechanising Turing machines and computability theory in Isabelle\/HOL"},"content":{"rendered":"<p>Se ha publicado un art\u00edculo de razonamiento formalizado en Isabelle\/HOL sobre modelos de computaci\u00f3n titulado <a href=\"http:\/\/goo.gl\/vzvbs\">Mechanising Turing machines and computability theory in Isabelle\/HOL<\/a>.<\/p>\n<p>Sus autores son Jian Xu, <a href=\"http:\/\/goo.gl\/ReG8L\">Xingyuan Zhang<\/a> y <a href=\"http:\/\/goo.gl\/h5nJC\">Christian Urban<\/a>.<\/p>\n<p>Su resumen es <\/p>\n<blockquote><p>\nWe present a formalised theory of computability in the theorem prover <a href=\"http:\/\/www.cl.cam.ac.uk\/research\/hvg\/Isabelle\">Isabelle\/HOL<\/a>. This theorem prover is based on classical logic which precludes direct reasoning about computability: every boolean predicate is either true or false because of the law of excluded middle. The only way to reason about computability in a classical theorem prover is to formalise a concrete model of computation. We formalise <a href=\"http:\/\/en.wikipedia.org\/wiki\/Turing_machine\">Turing machines<\/a> and relate them to abacus machines and recursive functions. We also formalise a universal Turing machine and Hoare-style reasoning techniques that allow us to reason about Turing machine programs. Our theory can be used to formalise other computability results.\n<\/p><\/blockquote>\n<p>Las teor\u00edas desarrolladas en Isabelle\/HOL se encuentran en <a href=\"http:\/\/goo.gl\/3134R\">aqu\u00ed<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Se ha publicado un art\u00edculo de razonamiento formalizado en Isabelle\/HOL sobre modelos de computaci\u00f3n titulado Mechanising Turing machines and computability theory in Isabelle\/HOL. Sus autores son Jian Xu, Xingyuan Zhang y Christian Urban. Su resumen es We present a formalised theory of computability in the theorem prover Isabelle\/HOL. This theorem prover is based on classical&#8230;<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[100],"tags":[144,285],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_likes_enabled":false,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/3098"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/comments?post=3098"}],"version-history":[{"count":5,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/3098\/revisions"}],"predecessor-version":[{"id":3105,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/3098\/revisions\/3105"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/media?parent=3098"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/categories?post=3098"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/tags?post=3098"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}