<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Máquina De Turing on Karpoke - Just Another Blog</title><link>http://karpoke.ignaciocano.com/tags/m%C3%A1quina-de-turing/</link><description>Recent content in Máquina De Turing on Karpoke - Just Another Blog</description><generator>Hugo -- 0.159.0</generator><language>es</language><lastBuildDate>Tue, 17 Jul 2012 13:08:00 +0100</lastBuildDate><atom:link href="http://karpoke.ignaciocano.com/tags/m%C3%A1quina-de-turing/index.xml" rel="self" type="application/rss+xml"/><item><title>A Turing Complete Puzzle Game</title><link>http://karpoke.ignaciocano.com/2012/07/17/a-turing-complete-puzzle-game/</link><pubDate>Tue, 17 Jul 2012 13:08:00 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2012/07/17/a-turing-complete-puzzle-game/</guid><description>&lt;blockquote&gt;
&lt;p&gt;The code behind the Google doodle celebrating Alan Turing’s 100th birthday is
now up on Google code. This animated logic puzzle game appeared on the Google
homepage on June 23, 2012. If you missed it, you can still play it in the
doodle archives.&lt;/p&gt;
&lt;p&gt;Our doodle for Turing’s 100th birthday showed a live action Turing Machine
with twelve interactive programming puzzles. Turing Machines are theoretical
objects in formal logic, not physical things, so we walked a fine line
between technical accuracy and accessibility. We focused on finding a good
representation for programs and choosing puzzles of appropriate complexity.
We did considerable user testing and iteration, more than for any past
doodle.&lt;/p&gt;</description></item><item><title>sed es Turing completo</title><link>http://karpoke.ignaciocano.com/2012/04/22/sed-es-turing-completo/</link><pubDate>Sun, 22 Apr 2012 00:32:00 +0100</pubDate><guid>http://karpoke.ignaciocano.com/2012/04/22/sed-es-turing-completo/</guid><description>&lt;p&gt;¿Cómo puede ser un editor de flujo, una utilidad para el tratamiento de
texto, un lenguaje Turing completo? &lt;code&gt;sed&lt;/code&gt; permite saltos condiciones e
incondicionales y utiliza un &lt;em&gt;buffer&lt;/em&gt; temporal, lo que permite
&lt;a href="http://www.catonmat.net/blog/proof-that-sed-is-turing-complete/"&gt;construir una máquina de Turing con él&lt;/a&gt;, y cualquier lenguaje que
pueda construir una máquina de Turing es Turing completo.&lt;/p&gt;
&lt;p&gt;Una implementación de una máquina de Turing con &lt;code&gt;sed&lt;/code&gt; es &lt;a href="http://www.catonmat.net/ftp/sed/turing.sed"&gt;turing.sed&lt;/a&gt;.&lt;/p&gt;
&lt;p&gt;Un ejemplo de programa que realiza el incremento de un número binario es
el siguiente:&lt;/p&gt;</description></item></channel></rss>