lunes, 23 de abril de 2012

Máquina de Turing



LUNES, 23 DE ABRIL DE 2012 - Alan Turing, pionero de las ciencias de la computación y padre de la inteligencia artificial




ALGORITMOS Y MÁQUINAS DE TURING
http://www.youtube.com/watch?v=2Lxpr8r3TV8

<iframe width="640" height="360" src="http://www.youtube.com/embed/2Lxpr8r3TV8?rel=0" frameborder="0" allowfullscreen></iframe>
6:28  de Sergio Jair Cerezo Vallejo·4 vídeos  Subido el 10/02/2011 4903 reproducciones
Video elaborado por alumnos de "Inteligencia Artificial" en ESCOM, donde se explica el concepto de algoritmo y la maquina de turing, asi como los avances logrados por Adan Turing y otros personajes relacionados.
Conceptos tomados del libro: "La nueva mente del emperador" de Roger Penrose



<iframe width="640" height="480" src="http://www.youtube.com/embed/Is_nGiTAoDE?rel=0" frameborder="0" allowfullscreen></iframe>
3:23
  
de Alejandro60929·2 vídeos 10598 reproducciones


---lllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll---

aturingmachine.com
http://aturingmachine.com/index.php

FAQs& Comments
A Turing Machine
Quick Introduction
Video Overview
In Alan Turing’s 1936 paper on computable numbers, he presented a thought experiment. Turing describes a machine that has an infinitely long tape upon which it writes, reads and alters symbols. He further shows that a machine with the correct minimal set of operations can calculate anything that is computable, no matter the complexity.


My goal in building this project was to create a machine that embodied the classic look and feel of the machine presented in Turing’s paper. I wanted to build a machine that would be immediately recognizable as a Turing machine to someone familiar with Turing's work.
Although this Turing machine is controlled by a Parallax Propeller microcontroller, its operation while running is based only on a set of state transformations loaded from an SD card and what is written to and read from the tape. While it may seem as if the tape is merely the input and output of the machine, it is not! Nor is the tape just the memory of the machine. In a way the tape is the computer. As the symbols on the tape are manipulated by simple rules, the computing happens. The output is really more of an artifact of the machine using the tape as the computer.
The heart of the turing machine is the read-write head. The read-write head transports the tape and positions cells of the tape appropriately. It can read a cell determining what, if any, symbol is written there. The machine works on, and knows about, only one cell at a time. The tape in my machine is a 1000’ roll of white 35mm film leader. The characters, ones and zeros, are written by the machine with a black dry erase marker.
The following video is an overview of the machine and its components. There is a lot more information in other parts of the site including hardware and software details, as well as video examples of it running some common Turing machine code.
While I have taken some liberty with a number of terms and concepts, I hope you can see just how simple the rules that drive a Turing machine are. Changing ones to zeros, moving one cell to the left or right, these concepts are simple, yet they can compute anything that is computable. And from these simple concepts, the most complex computers of today are born.


<iframe width="640" height="360" src="http://www.youtube.com/embed/E3keLeMwfHY?rel=0" frameborder="0" allowfullscreen></iframe>
5:09
 
de Mike Davey·16 vídeos  Subido el 07/03/2010 376397 reproducciones
A Turing machine is a math concept that show that a few simple rules can be used to solve any computable computation. It is the basis for all of today's computers. My goal in building this project was to create a machine that embodied the classic look and feel of the machine presented in Alan Turings 1937 paper on computable numbers. More information can be found at: http://aturingmachine.com
Software Block Diagram

Turing Machine Loop Block Diagram

Turing Machine Counting


Counting is one of the first math skills we learn. It's really not that much different for a computer or a Turing machine except they normally use binary numbers, so they count in binary. In this Turing machine example, you can see the machine following a simple set of steps to count in binary.

Turing Machine Doing Subtraction

A Turing Machine - Subtraction
http://www.youtube.com/watch?v=aBToqFJLrl4

2:20  de Mike Davey Subido el 07/03/2010 8295 reproducciones Need to know the answer to 3 minus 2, well let the Turing machine help. More information can be found at: http://aturingmachine.com
Although there are a number of Turing state machines that will accomplish subtraction, this method uses only ones, zeros, and blank cells. It's not that difficult to understand how a Turing machine does subtraction.






----------------llllllllllllllllllllllllllllllllllllllllllllllllllllllllll-----------------

Mod-05 Lec-26 TURING MACHINES
http://www.youtube.com/watch?v=IhyEGNn-7Uo

<iframe width="640" height="480" src="http://www.youtube.com/embed/IhyEGNn-7Uo?rel=0" frameborder="0" allowfullscreen></iframe>
58:41
 
de nptelhrd·10962 vídeos Subido el 05/10/2011 19314 reproducciones
Theory of Computation by Prof.Kamala Krithivasan,Department of Computer Science and Engineering,IIT Madras. For more details on NPTEL visit http://nptel.iitm.ac.in


Mod-05 Lec-27 TURING MACHINES (Contd)
http://www.youtube.com/watch?v=1SOi9Zp4X3c

<iframe width="640" height="480" src="http://www.youtube.com/embed/1SOi9Zp4X3c?rel=0" frameborder="0" allowfullscreen></iframe>
52:53
 
de nptelhrd·10962 vídeos Subido el 05/10/2011 5910 reproducciones
Theory of Computation by Prof.Kamala Krithivasan,Department of Computer Science and Engineering,IIT Madras. For more details on NPTEL visit http://nptel.iitm.ac.in


-----------------------------------------------------------------



Piloting Computing - Alan Turing's Automatic Computing Engine
10:27  de NPLdigital 2445 reproducciones

LEGO Turing Machine
<iframe width="640" height="360" src="http://www.youtube.com/embed/FTSAiF9AHN4?rel=0" frameborder="0" allowfullscreen></iframe>2:23  de Andre Theelen Destacados 45972 
Publicado el 18/06/2012 
This is a short documentary about the LEGO Turing Machine built by Jeroen van den Bos and Davy Landman at Centrum Wiskunde & Informatica (CWI), Amsterdam (Netherlands). They built it for CWI's exposition "Turings Erfenis" in honor of Alan Turings one hundredth birthday this year.
Alan Turing was a brilliant mathematician who helped define the theoretical model of the computer as we know it today. He was a visionary, one of the few people of his time who recognized the role the computer would play for humanity.
The Turing Machine (1936) is an adequate model of a computer. It can do anything the computers of today or tomorrow can do.
More on the LEGO Turing Machine here: http://www.legoturingmachine.org/
More info on the exposition here: http://www.cwi.nl/2012-alan-turing-year (in Dutch)
More info on the making of this video here: http://www.ecalpemos.nl/2012/06/18/lego-turing-machine-video/

Machine de Turing en Lego, présentation du projet Rubens
23:42  de ProjetRubens·7 vídeos Subido el 15/01/2012  870 reproducciones 
Un semestre de fini. Voilà, on a présenté la machine "devant nos pairs"
Ce que vous voyez là, c'est ce qu'on projetait en direct sur l'écran. Je mettrais peut-être à l'occasion les slides associés
Bon la présentation est faite à l'arrachée, ça se sent, on n'a pas passé assez de temps sur ce sur quoi on aurait du passer du temps^^
Néanmoins ce qui marche marche ^^
N'hésitez pas à désactiver les commentaires que j'ai disséminé tout au long de la video, s'il vous enquiquine^^
Enjoy
Performance :  horloge, 0,05Hz, soit 0,000 000 000 05GHZ :D  consommation, 34W pneumatiques
Si les annotations vous dérangent, désactivez les^^


History Channel La Primera Computadora del mundo COMPLETO
http://www.youtube.com/watch?v=qK_N8un67ss
53:40
  
de C vazquez martvaz 14231 reproducciones


Alan Turing y la computadora (History Channel)
<iframe width="640" height="480" src="http://www.youtube.com/embed/8fglRhM9pkU?rel=0" frameborder="0" allowfullscreen></iframe>
3:17
  
de Ciencias Cognoscitivas 5563 reproducciones
Subido el 24/08/2011 Canal H
Alan Mathison Turing, OBE (23 de junio de 1912 en Maida Vale, Londres - 7 de junio de 1954 en Wilmslow, Cheshire) fue un matemático, informático teórico, criptógrafo y filósofo inglés. Es considerado uno de los padres de la Ciencia de la computación siendo el precursor de la informática moderna. Proporcionó una influyente formalización de los conceptos de algoritmo y computación: la máquina de Turing. Formuló su propia versión de la hoy ampliamente aceptada Tesis de Church-Turing, la cual postula que cualquier modelo computacional existente tiene las mismas capacidades algorítmicas, o un subconjunto, de las que tiene una máquina de Turing. Durante la Segunda Guerra Mundial, trabajó en romper los códigos nazis, particularmente los de la máquina Enigma; durante un tiempo fue el director de la sección Naval Enigma del Bletchley Park. Tras la guerra diseñó uno de los primeros computadores electrónicos programables digitales en el Laboratorio Nacional de Física del Reino Unido y poco tiempo después construyó otra de las primeras máquinas en la Universidad de Mánchester. Entre otras muchas cosas, también contribuyó de forma particular e incluso provocativa al enigma de si las máquinas pueden pensar, es decir a la Inteligencia Artificial.
La carrera de Turing terminó súbitamente cuando fue procesado por su condición de homosexual. No se defendió de los cargos y se le dio a escoger entre la castración química o ir a la cárcel. Eligió lo primero y sufrió importantes consecuencias físicas, entre ellas la impotencia. Dos años después del juicio, en 1954, se suicidó.
The Turing Archive: http://www.turingarchive.org/

http://www.youtube.com/watch?v=cCdbZqI1r7I
1:13:17
  
de Calit2ube·859 vídeos  Subido el 08/05/2008 22714 reproducciones
Coaxing computers to perform basic acts of perception and robotics, let alone high-level thought, has been difficult. No existing computer can recognize pictures, understand language, or navigate through a cluttered room with anywhere near the facility of a child. Hawkins and his colleagues have developed a model of how the neocortex performs these and other tasks. The theory, call Hierarchical Temporal Memory, explains how the hierarchical structure of the neocortex builds a model of its world and uses this model for inference and prediction. To turn this theory into a useful technology, Hawkins has created a company called Numenta. In this talk, Hawkins will describe the theory, its biological basis, and a software platform created by Numenta that allows anyone to apply this theory to a variety of problems. Part of this theory was described in Hawkins' 2004 book, "On Intelligence".

This talk is by the Chairman of the Redwood Neuroscience Institute and co-founder of Palm Computing and Handspring, and is co-sponsored by Calit2 at UCSD, the Jacobs School's Computer Science and Engineering (CSE)department, and the Institute for Neural Computation (INC).



<iframe width="640" height="360" src="http://www.youtube.com/embed/6KUn9v-Y78Q?rel=0" frameborder="0" allowfullscreen></iframe>
princetonacademics·115 vídeos Publicado el 24/08/2012
Richard Karp, a professor at the University of California at Berkeley, discusses "Theory of Computation as an Enabling Tool for the Sciences" in a lecture given on the occasion of Princeton University's centennial celebration of Alan Turing. Learn more at www.princeton.edu/turing







lllllllllllllllllllllllllllllllllllllllllllllll





<iframe width="640" height="360" src="http://www.youtube.com/embed/hF9VsUxHM9U?rel=0" frameborder="0" allowfullscreen></iframe>
1:23:13
  
de ComputerHistory·184 vídeos  Publicado el 19/03/2012 2986 reproducciones [Recorded: March 7, 2012]
I am thinking about something much more important than bombs. I am thinking about computers.
John von Neumann, 1946
The most powerful technology of the last century was not the atomic bomb, but software—and both were invented by the same folks. Even as they were inventing it, the original geniuses imagined almost everything software has become since. At long last, George Dyson delivers the untold story of software's creation. It is an amazing tale brilliantly deciphered.
Kevin Kelly, cofounder of WIRED magazine, author of What Technology Wants
Legendary historian George Dyson vividly re-creates the scenes of focused experimentation, incredible mathematical insight, and pure creative genius that gave us computers, digital television, modern genetics, models of stellar evolution—in other words, computer code.
In the 1940s and '50s, a group of eccentric geniuses—led by John von Neumann—gathered at the newly created Institute for Advanced Study in Princeton, New Jersey. Their joint project was the realization of the theoretical universal machine, an idea that had been put forth by mathematician Alan Turing. This group of brilliant engineers worked in isolation, almost entirely independent from industry and the traditional academic community. But because they relied exclusively on government funding, the government wanted its share of the results: the computer that they built also led directly to the hydrogen bomb. George Dyson has uncovered a wealth of new material about this project, and in bringing the story of these men and women and their ideas to life, he shows how the crucial advancements that dominated twentieth-century technology emerged from one computer in one laboratory, where the digital universe as we know it was born.
Join John Hollar for a captivating conversation with Dyson about John von Neumann and the beginnings of the digital universe.
This event is part of our 2012 Revolutionaries series, featuring conversations with some of the most distinguished minds in the computing field.
Revolution: The First 2000 Years of Computing.
Everyone uses computers. Few know the story of how they came to be. Revolution chronicles the evolution and impact of modern computing from the abacus to the smart phone. This 25,000 sq. ft multimedia experience is a technological wonderland that immerses visitors in the sights, sounds, and stories of the computer revolution. Be sure to visit the Birth of the Computer gallery, where you can learn more about early computers and the people involved in creating them.

“It is possible to invent a single machine which can be used to compute any computable sequence,” twenty-four-year-old Alan Turing announced in 1936. In Turing’s Cathedral, George Dyson focuses on a small group of men and women, led by John von Neumann at the Institute for Advanced Study in Princeton, New Jersey, who built one of the first computers to realize Alan Turing’s vision of a Universal Machine. Their work would break the distinction between numbers that mean things and numbers that do things—and our universe would never be the same. Using five kilobytes of memory (the amount allocated to displaying the cursor on a computer desktop of today), they achieved unprecedented success in both weather prediction and nuclear weapons design, while tackling, in their spare time, problems ranging from the evolution of viruses to the evolution of stars. Dyson’s account, both historic and prophetic, sheds important new light on how the digital universe exploded in the aftermath of World War II. The proliferation of both codes and machines was paralleled by two historic developments: the decoding of self-replicating sequences in biology and the invention of the hydrogen bomb. It’s no coincidence that the most destructive and the most constructive of human inventions appeared at exactly the same time.  How did code take over the world? In retracing how Alan Turing’s one-dimensional model became John von Neumann’s two-dimensional implementation, Turing’s Cathedral offers a series of provocative suggestions as to where the digital universe, now fully three-dimensional, may be heading next.


“It is possible to invent a single machine which can be used to compute any computable sequence,” twenty-four-year-old Alan Turing announced in 1936. In Turing’s Cathedral, George Dyson focuses on a small group of men and women, led by John von Neumann at the Institute for Advanced Study in Princeton, New Jersey, who built one of the first computers to realize Alan Turing’s vision of a Universal Machine. Their work would break the distinction between numbers that mean things and numbers that do things—and our universe would never be the same. Using five kilobytes of memory (the amount allocated to displaying the cursor on a computer desktop of today), they achieved unprecedented success in both weather prediction and nuclear weapons design, while tackling, in their spare time, problems ranging from the evolution of viruses to the evolution of stars. Dyson’s account, both historic and prophetic, sheds important new light on how the digital universe exploded in the aftermath of World War II. The proliferation of both codes and machines was paralleled by two historic developments: the decoding of self-replicating sequences in biology and the invention of the hydrogen bomb. It’s no coincidence that the most destructive and the most constructive of human inventions appeared at exactly the same time.  How did code take over the world? In retracing how Alan Turing’s one-dimensional model became John von Neumann’s two-dimensional implementation, Turing’s Cathedral offers a series of provocative suggestions as to where the digital universe, now fully three-dimensional, may be heading next.
 http://www.scribd.com/doc/93981184/Turing-s-Cathedral-The-Origins-of-the-Digital-Universe
600x800 html

-

-----------------------------------


http://www.youtube.com/playlist?list=PL601FC994BDD963E4
<iframe width="640" height="360" src="http://www.youtube.com/embed/videoseries?list=PL601FC994BDD963E4" frameborder="0" allowfullscreen></iframe>
Tutorials by Instructor: Shai Simonson. http://www.stonehill.edu/compsci/shai.htm

Subido el 07/05/2010
Shai Simonson NEW BOOK: http://web.stonehill.edu/compsci/RediscoveringMath/RM.html Change the way you think about math!
All rights reserved for http://www.aduni.org/
Published under the Creative Commons Attribution-ShareAlike license http://creativecommons.org/licenses/by-sa/2.0/
Tutorials by Instructor: Shai Simonson. http://www.stonehill.edu/compsci/shai.htm

-----------------------------------------





No hay comentarios:

Publicar un comentario