An enigma machine on display outside the Alan Turing Institute entrance inside the British Library, London.
Credit: Shutterstock/William Barton
Suppose someone asked you to devise the most powerful computer possible. Alan Turing, whose reputation as a central figure in computer science and artificial intelligence has only grown since his untimely death in 1954, applied his genius to problems such as this one in an age before computers as we know them existed. His theoretical work on this problem and others remains a foundation of computing, AI and modern cryptographic standards, including those NIST recommends.
The road from devising the most powerful computer possible to cryptographic standards has a few twists and turns, as does Turings brief life.
Alan Turing
Credit: National Portrait Gallery, London
In Turings time, mathematicians debated whether it was possible to build a single, all-purpose machine that could solve all problems that are computable. For example, we can compute a cars most energy-efficient route to a destination, and (in principle) the most likely way in which a string of amino acids will fold into a three-dimensional protein. Another example of a computable problem, important to modern encryption, is whether or not bigger numbers can be expressed as the product of two smaller numbers. For example, 6 can be expressed as the product of 2 and 3, but 7 cannot be factored into smaller integers and is therefore a prime number.
Some prominent mathematicians proposed elaborate designs for universal computers that would operate by following very complicated mathematical rules. It seemed overwhelmingly difficult to build such machines. It took the genius of Turing to show that a very simple machine could in fact compute all that is computable.
His hypothetical device is now known as a Turing machine. The centerpiece of the machine is a strip of tape, divided into individual boxes. Each box contains a symbol (such as A,C,T, G for the letters of genetic code) or a blank space. The strip of tape is analogous to todays hard drives that store bits of data. Initially, the string of symbols on the tape corresponds to the input, containing the data for the problem to be solved. The string also serves as the memory of the computer. The Turing machine writes onto the tape data that it needs to access later in the computation.
Credit: NIST
The device reads an individual symbol on the tape and follows instructions on whether to change the symbol or leave it alone before moving to another symbol. The instructions depend on the current state of the machine. For example, if the machine needs to decide whether the tape contains the text string TC it can scan the tape in the forward direction while switching among the states previous letter was T and previous letter was not C. If while in state previous letter was T it reads a C, it goes to a state found it and halts. If it encounters the blank symbol at the end of the input, it goes to the state did not find it and halts. Nowadays we would recognize the set of instructions as the machines program.
It took some time, but eventually it became clear to everyone that Turing was right: The Turing machine could indeed compute all that seemed computable. No number of additions or extensions to this machine could extend its computing capability.
To understand what can be computed it is helpful to identify what cannot be computed. Ina previous life as a university professor I had to teach programming a few times. Students often encounter the following problem: My program has been running for a long time; is it stuck? This is called the Halting Problem, and students often wondered why we simply couldnt detect infinite loops without actually getting stuck in them. It turns out a program to do this is an impossibility. Turing showed that there does not exist a machine that detects whether or not another machine halts. From this seminal result followed many other impossibility results. For example, logicians and philosophers had to abandon the dream of an automated way of detecting whether an assertion (such as whether there are infinitely many prime numbers) is true or false, as that is uncomputable. If you could do this, then you could solve the Halting Problem simply by asking whether the statement this machine halts is true or false.
Turing went on to make fundamental contributions to AI, theoretical biology and cryptography. His involvement with this last subject brought him honor and fame during World War II, when he played a very important role in adapting and extending cryptanalytic techniques invented by Polish mathematicians. This work broke the German Enigma machine encryption, making a significant contribution to the war effort.
Turing was gay. After the war, in 1952, the British government convicted him for having sex with a man. He stayed out of jail only by submitting to what is now called chemical castration. He died in 1954 at age 41 by cyanide poisoning, which was initially ruled a suicide but may have been an accident according to subsequent analysis. More than 50 years would pass before the British government apologized and pardoned him (after years of campaigning by scientists around the world). Today, the highest honor in computer sciences is called the Turing Award.
Turings computability work provided the foundation for modern complexity theory. This theory tries to answer the question Among those problems that can be solved by a computer, which ones can be solved efficiently? Here, efficiently means not in billions of years but in milliseconds, seconds, hours or days, depending on the computational problem.
For example, much of the cryptography that currently safeguards our data and communications relies on the belief that certain problems, such as decomposing an integer number into its prime factors, cannot be solved before the Sun turns into a red giant and consumes the Earth (currently forecast for 4 billion to 5 billion years). NIST is responsible for cryptographic standards that are used throughout the world. We could not do this work without complexity theory.
Technology sometimes throws us a curve, such as the discovery that if a sufficiently big and reliable quantum computer is built it would be able to factor integers, thus breaking some of our cryptography. In this situation, NIST scientists must rely on the worlds experts (many of them in-house) in order to update our standards. There are deep reasons to believe that quantum computers will not be able to break the cryptography that NIST is about to roll out. Among these reasons is that Turings machine can simulate quantum computers. This implies that complexity theory gives us limits on what a powerful quantum computer can do.
But that is a topic for another day. For now, we can celebrate how Turing provided the keys to much of todays computing technology and even gave us hints on how to solve looming technological problems.
Read more from the original source:
Alan Turing's Everlasting Contributions to Computing, AI and Cryptography - NIST
- The Quantum Computer Revolution Is Closer Than You May Think - National Review - May 3rd, 2017 [May 3rd, 2017]
- Time Crystals Could be the Key to the First Quantum Computer - TrendinTech - May 3rd, 2017 [May 3rd, 2017]
- quantum computing - WIRED UK - May 3rd, 2017 [May 3rd, 2017]
- Chinese scientists build world's first quantum computing machine - India Today - May 3rd, 2017 [May 3rd, 2017]
- Here's How We Can Achieve Mass-Produced Quantum Computers - ScienceAlert - June 6th, 2017 [June 6th, 2017]
- D-Wave partners with U of T to move quantum computing along - Financial Post - June 6th, 2017 [June 6th, 2017]
- Team develops first blockchain that can't be hacked by quantum computer - Siliconrepublic.com - June 6th, 2017 [June 6th, 2017]
- Telstra just wants a quantum computer to offer as-a-service - ZDNet - June 6th, 2017 [June 6th, 2017]
- Research collaborative pursues advanced quantum computing - Phys.Org - June 6th, 2017 [June 6th, 2017]
- Quantum Computing Market Forecast 2017-2022 | Market ... - June 6th, 2017 [June 6th, 2017]
- Quantum Computing Is Real, and D-Wave Just Open ... - WIRED - June 7th, 2017 [June 7th, 2017]
- FinDEVr London: Preparing for the Dark Side of Quantum Computing - GlobeNewswire (press release) - June 9th, 2017 [June 9th, 2017]
- Purdue, Microsoft to Collaborate on Quantum Computer - Photonics.com - June 9th, 2017 [June 9th, 2017]
- Scientists May Have Found a Way to Combat Quantum Computer Blockchain Hacking - Futurism - June 9th, 2017 [June 9th, 2017]
- Microsoft and Purdue work on scalable topological quantum computer - Next Big Future - June 12th, 2017 [June 12th, 2017]
- HYPRES Expands Efforts in Quantum Computing with Launch of European Subsidiary SeeQC - Business Wire (press release) - June 12th, 2017 [June 12th, 2017]
- From the Abacus to Supercomputers to Quantum Computers - Duke Today - June 13th, 2017 [June 13th, 2017]
- Accenture, Biogen, 1QBit Launch Quantum Computing App to ... - HIT Consultant - June 14th, 2017 [June 14th, 2017]
- The US and China "Quantum Computing Arms Race" Will Change Long-Held Dynamics in Commerce, Intelligence ... - PR Newswire (press release) - June 14th, 2017 [June 14th, 2017]
- Quantum Computing Technologies markets will reach $10.7 billion by 2024 - PR Newswire (press release) - June 14th, 2017 [June 14th, 2017]
- A Hybrid of Quantum Computing and Machine Learning Is Spawning New Ventures - IEEE Spectrum - June 14th, 2017 [June 14th, 2017]
- KPN CISO details Quantum computing attack dangers - Mobile World Live - June 16th, 2017 [June 16th, 2017]
- Get ahead in quantum computing AND attract Goldman Sachs - eFinancialCareers - June 16th, 2017 [June 16th, 2017]
- Accenture, 1QBit partner for drug discovery through quantum ... - ZDNet - June 16th, 2017 [June 16th, 2017]
- Toward optical quantum computing - MIT News - June 17th, 2017 [June 17th, 2017]
- Quantum computing, the machines of tomorrow | The Japan Times - The Japan Times - June 17th, 2017 [June 17th, 2017]
- Its time to decide how quantum computing will help your ... - June 18th, 2017 [June 18th, 2017]
- Israel Enters Quantum Computer Race, Placing Encryption at Ever-Greater Risk - Sputnik International - June 20th, 2017 [June 20th, 2017]
- Prototype device enables photon-photon interactions at room ... - Phys.Org - June 20th, 2017 [June 20th, 2017]
- Dow and 1QBit Announce Collaboration Agreement on Quantum Computing - Business Wire (press release) - June 21st, 2017 [June 21st, 2017]
- Imperfect crystals may be perfect storage method for quantum computing - Digital Trends - June 21st, 2017 [June 21st, 2017]
- Dow Chemical, 1QBit Ink Quantum Computing Development Deal - Zacks.com - June 22nd, 2017 [June 22nd, 2017]
- Google on track for quantum computer breakthrough by end of 2017 - New Scientist - June 22nd, 2017 [June 22nd, 2017]
- USC to lead project to build super-speedy quantum computers - USC News - June 24th, 2017 [June 24th, 2017]
- The Quantum Computer Factory That's Taking on Google and IBM ... - WIRED - June 24th, 2017 [June 24th, 2017]
- The weird science of quantum computing, communications and encryption - C4ISR & Networks - June 27th, 2017 [June 27th, 2017]
- Multi-coloured photons in 100 dimensions may make quantum ... - Cosmos - June 30th, 2017 [June 30th, 2017]
- Global Quantum Computing Market Growth at a CAGR of 35.12 ... - PR Newswire (press release) - June 30th, 2017 [June 30th, 2017]
- Qudits: The Real Future of Quantum Computing? - IEEE Spectrum - IEEE Spectrum - June 30th, 2017 [June 30th, 2017]
- New method could enable more stable and scalable quantum ... - Phys.Org - June 30th, 2017 [June 30th, 2017]
- Quantum computers are about to get real | Science News - Science News Magazine - June 30th, 2017 [June 30th, 2017]
- Quantum Computing - Scientific American - June 30th, 2017 [June 30th, 2017]
- Australia's ambitious plan to win the quantum race - ZDNet - July 3rd, 2017 [July 3rd, 2017]
- How quantum mechanics can change computing - The Conversation - The Conversation US - August 24th, 2017 [August 24th, 2017]
- UNSW joins with government and business to keep quantum computing technology in Australia - The Australian Financial Review - August 24th, 2017 [August 24th, 2017]
- UNSW launches Australia's first hardware quantum computing company with investments from federal and NSW ... - OpenGov Asia - August 24th, 2017 [August 24th, 2017]
- Finns chill out quantum computers with qubit refrigerator to cut out errors - ZDNet - August 24th, 2017 [August 24th, 2017]
- Hype and cash are muddying public understanding of quantum ... - The Conversation AU - August 24th, 2017 [August 24th, 2017]
- IEEE Approves Standards Project for Quantum Computing ... - insideHPC - August 24th, 2017 [August 24th, 2017]
- Silicon Quantum Computing launched to commercialise UNSW ... - ZDNet - August 24th, 2017 [August 24th, 2017]
- The Era of Quantum Computing Is Here. Outlook: Cloudy ... - January 30th, 2018 [January 30th, 2018]
- The Era of Quantum Computing Is Here. Outlook: Cloudy | WIRED - February 6th, 2018 [February 6th, 2018]
- Quantum computing in the NISQ era and beyond - February 6th, 2018 [February 6th, 2018]
- What is quantum computing? - Definition from WhatIs.com - February 6th, 2018 [February 6th, 2018]
- Quantum computers - WIRED UK - February 19th, 2018 [February 19th, 2018]
- Is Quantum Computing an Existential Threat to Blockchain ... - February 21st, 2018 [February 21st, 2018]
- What is Quantum Computing? Webopedia Definition - March 25th, 2018 [March 25th, 2018]
- Quantum Computing Explained - WIRED UK - April 15th, 2018 [April 15th, 2018]
- Quantum computing: A simple introduction - Explain that Stuff - June 2nd, 2018 [June 2nd, 2018]
- What are quantum computers and how do they work? WIRED ... - June 22nd, 2018 [June 22nd, 2018]
- How Quantum Computers Work - July 22nd, 2018 [July 22nd, 2018]
- The reality of quantum computing could be just three years ... - September 12th, 2018 [September 12th, 2018]
- The 3 Types of Quantum Computers and Their Applications - November 24th, 2018 [November 24th, 2018]
- Quantum Computing - VLAB - January 27th, 2019 [January 27th, 2019]
- Quantum Computing | Centre for Quantum Computation and ... - January 27th, 2019 [January 27th, 2019]
- Microsofts quantum computing network takes a giant leap ... - March 7th, 2019 [March 7th, 2019]
- IBM hits quantum computing milestone, may see 'Quantum ... - March 7th, 2019 [March 7th, 2019]
- Quantum technology - Wikipedia - March 13th, 2019 [March 13th, 2019]
- Quantum Computing | D-Wave Systems - April 18th, 2019 [April 18th, 2019]
- Microsoft will open-source parts of Q#, the programming ... - May 7th, 2019 [May 7th, 2019]
- What Is Quantum Computing? The Complete WIRED Guide | WIRED - May 8th, 2019 [May 8th, 2019]
- The five pillars of Edge Computing -- and what is Edge computing anyway? - Information Age - October 1st, 2019 [October 1st, 2019]
- Moore's Law Is Dying. This Brain-Inspired Analogue Chip Is a Glimpse of What's Next - Singularity Hub - October 1st, 2019 [October 1st, 2019]
- Experts Gather at Fermilab for International Workshop on Cryogenic Electronics for Quantum Systems - Quantaneo, the Quantum Computing Source - October 1st, 2019 [October 1st, 2019]
- Princeton announces initiative to propel innovations in quantum science and technology - Princeton University - October 1st, 2019 [October 1st, 2019]
- Detecting Environmental 'Noise' That Can Damage The Quantum State of Qubits - In Compliance - October 1st, 2019 [October 1st, 2019]
- Quantum Computing beginning talks with clients on its quantum asset allocation application - Proactive Investors USA & Canada - October 1st, 2019 [October 1st, 2019]
- What is quantum computing? The next era of computational evolution, explained - Digital Trends - October 1st, 2019 [October 1st, 2019]
- IT sees the Emergence of Quantum Computing as a Looming Threat to Keeping Valuable Information Confidential - Quantaneo, the Quantum Computing Source - October 23rd, 2019 [October 23rd, 2019]
- More wrong answers get quantum computers to find the right one - Futurity: Research News - October 23rd, 2019 [October 23rd, 2019]