Science 28 April 1995: Vol. 268 no. 5210 pp. 545-548 DOI: 10.1126/science.268.5210.545 Article Computation Beyond the Turing Limit Hava T. Siegelmann + Author Affiliations Department of Information Systems Engineering, Faculty of Industrial Engineering, Technion, Haifa 32000, Israel. E-mail: iehava@ie.technion.ac.il Abstract Extensive efforts have been made to prove the Church-Turing thesis, which suggests that all realizable dynamical and physical systems cannot be more powerful than classical models of computation. A simply described but highly chaotic dynamical system called the analog shift map is presented here, which has computational power beyond the Turing limit (super-Turing); it computes exactly like neural networks and analog machines. This dynamical system is conjectured to describe natural physical phenomena.
a neoclassical turing machine is a machine that also halts if its tape state repeats itself. i dont understand why this cant be emulated by a Turing machine
A TV Shop themed demonstration of a Turing Machine made in LEGO Mindstorms. It was made as part of a project at computer science at Aarhus University. A blog...
On February 13, 1946, J. Presper Eckert and John Mauchly introduced Electronic Numerical Integrator and Computer, or ENIAC, the first general purpose, electronic computer. ENIAC was a giant step forward in computing technology.
The last 20 years of Internet policy have been dominated by the copyright war, but the war turns out only to have been a skirmish. The coming century will be dominated by war against the general purpose computer, and the stakes are the freedom, fortune and privacy of the entire human race.
Diesen Talk von Cory Doctorow auf dem 28C3 habe ich neulich quasi-live in der Internetglotze gesehen und fand ihn sehr inspirierend. Als Cory heute bloggte, dass es ein Transkript gebe, hab ich mir das gleich in ein gedit-Fensterchen kopiert und in der U-Bahn nach Hause losgelegt.
EDA is more a manifestation of finite state machines going all the way back to Alan Turing. Old_State + Event = Some_Action + New_State. It is the simplest, yet most powerful way to design robust systems. I only wish more people would give it due consideration.
A very old implementation example is I/O interrupts (hardware events) for asynchronous I/O - real time event handling which enabled multitasking operating systems.
Many want to use web services for everything now and at times it is hard to convince people that other messaging schemes and standards are a better fit for some problems.