As computer scientists this year celebrate the 100th anniversary of the birth of the mathematical genius Alan Turing, who set out the basis for digital computing in the 1930s to anticipate the electronic age, they still quest after a machine as adaptable and intelligent as the human brain.
Now, computer scientist Hava Siegelmann of the University of Massachusetts Amherst, an expert in neural networks, has taken Turing’s work to its next logical step. She is translating her 1993 discovery of what she has dubbed “SuperTuring” computation into an adaptable computational system that learns and evolves, using input from the environment in a way much more like our brains do than classic Turingtype computers. She and her postdoctoral research colleague Jeremie Cabessa report on the advance in the current issue of Neural Computation.
“This model is inspired by the brain,” she says. “It is a mathematical formulation of the brain’s neural networks with their adaptive abilities.” The authors show that when the model is installed in an environment offering constant sensory stimuli like the real world, and when all stimulusresponse pairs are considered over the machine’s lifetime, the Super Turing model yields an exponentially greater repertoire of behaviors than the classical computer or Turing model. They demonstrate that the SuperTuring model is superior for humanlike tasks and learning.
“Each time a SuperTuring machine gets input it literally becomes a different machine,” Siegelmann says. “You don’t want this for your PC. They are fine and fast calculators and we need them to do that. But if you want a robot to accompany a blind person to the grocery store, you’d like one that can navigate in a dynamic environment. If you want a machine to interact successfully with a human partner, you’d like one that can adapt to idiosyncratic speech, recognize facial patterns and allow interactions between partners to evolve just like we do. That’s what this model can offer.”
Classical computers work sequentially and can only operate in the very orchestrated, specific environments for which they were programmed. They can look intelligent if they’ve been told what to expect and how to respond, Siegelmann says. But they can’t take in new information or use it to improve problemsolving, provide richer alternatives or perform other higherintelligence tasks.
In 1948, Turing himself predicted another kind of computation that would mimic life itself, but he died without developing his concept of a machine that could use what he called “adaptive inference.” In 1993, Siegelmann, then at Rutgers, showed independently in her doctoral thesis that a very different kind of computation, vastly different from the “calculating computer” model and more like Turing’s prediction of lifelike intelligence, was possible. She published her findings in Science and in a book shortly after.
“I was young enough to be curious, wanting to understand why the Turing model looked really strong,” she recalls. “I tried to prove the conjecture that neural networks are very weak and instead found that some of the early work was faulty. I was surprised to find out via mathematical analysis that the neural models had some capabilities that surpass the Turing model. So I reread Turing and found that he believed there would be an adaptive model that was stronger based on continuous calculations.”
Each step in Siegelmann’s model starts with a new Turing machine that computes once and then adapts. The size of the set of natural numbers is represented by the notation alephzero, א0, representing also the number of different infinite calculations possible by classical Turing machines in a realworld environment on continuously arriving inputs. By contrast, Siegelmann’s most recent analysis demonstrates that SuperTuring computation has 2א0 possible behaviors. “If the Turing machine had 300 behaviors, the SuperTuring would have 2300, more than the number of atoms in the observable universe,” she explains.
The new SuperTuring machine will not only be flexible and adaptable but economical. This means that when presented with a visual problem, for example, it will act more like our human brains and choose salient features in the environment on which to focus, rather than using its power to visually sample the entire scene as a camera does. This economy of effort, using only as much attention as needed, is another hallmark of high artificial intelligence, Siegelmann says.
“If a Turing machine is like a train on a fixed track, a SuperTuring machine is like an airplane. It can haul a heavy load, but also move in endless directions and vary its destination as needed. The SuperTuring framework allows a stimulus to actually change the computer at each computational step, behaving in a way much closer to that of the constantly adapting and evolving brain,” she adds.
Siegelmann and two colleagues recently were notified that they will receive a grant to make the first ever SuperTuring computer, based on Analog Recurrent Neural Networks. The device is expected to introduce a level of intelligence not seen before in artificial computation.
Source: University of Massachusetts at Amherst
Reference:
Cabessa, J., & Siegelmann, H. (2012). The Computational Power of Interactive Recurrent Neural Networks Neural Computation, 24 (4), 9961019 DOI: 10.1162/NECO_a_00263
Related articles
 How To Build Turing’s Universal Machine (gizmodo.com.au)
 Turing’s Titanic Machine! (computationalcomplexity.org)
 Artificial Intelligence: No Longer Chasing The Human Dream (psfk.com)
 Is there any concrete relation between Gödel’s incompleteness theorem, the halting problem and universal Turing machines? (cs.stackexchange.com)
 AI robot: how machine intelligence is evolving (guardian.co.uk)
 Notions of efficient computation (cs.stackexchange.com)
Share the post "Next Generation Artificial Intelligence"

Carla Jackson