Science: Where computers prove incapable - Fermat's Last Theorem has been cracked, but Darrel Ince explains how researchers have shown that some problems cannot be solved
Monday 08 November 1993
Proving mathematical statements to be true (or false) is one of the activities mathematicians indulge in most frequently. Two features of the process often surprise the layman. First, how error-prone the business of proving things is. There are plenty of cases of a seemingly straightforward proof being published, only for it to be modified or even proved false a few months later. The second surprising fact about proofs is that they can be very long. The proof of Fermat's theorem should, in full, occupy hundreds of pages of text.
Now research scientists at the University of California, Stanford University and AT & T laboratories have startled the mathematical world by developing a technique capable of proving - or at least certificating - the correctness of a proof. Of obvious importance to mathematicians, this also has major ramifications for computer scientists.
In effect, the researchers have devised the mathematical version of ultrasonic testing, which highlights any flaws in a proof. A series of operations - transformations - are applied to the text of a proof and any errors become more visible.
There are two implications for computer scientists. The first concerns 'formal methods of software development'. This is the generic term used to describe methods that use mathematics both to draw up the specifications for what a piece of software should achieve and to design the software systems themselves to meet the specifications. Such methods are normally used to develop programs for ultra-reliable applications such as the control of nuclear power stations.
A major problem that has dogged this area is that the proof process is long and error-prone. One incorrect step could lead to a serious error - which could result in loss of life. Use of formal methods has been confined largely to projects where the economic loss due to an error would be so great as to justify employing large numbers of highly trained staff to develop the mathematical specifications and then to check the design and the proofs of the code. The new techniques for the certification of proofs promise to reduce substantially the amount of checking and validation needed.
The second effect of the research concerns a class of computer applications known as NP (non-polynomial)-complete problems. The time taken for a program to solve such a problem increases dramatically depending on its complexity, to the point where it would take longer than the life expectancy of the universe. These are not abstract academic problems, but occur, for example, in the design of telecommunications systems or the layout of computer circuits on silicon chips.
Until recently researchers have believed that although an exact solution to these NP-complete problems has not been possible, approximate ones can be found. An archetypal NP-complete problem might involve devising a layout of roads to connect all the cities in an area using the smallest amount of road material. Computer scientists believed that while an optimal solution would never be possible, there could be approximate solutions that came within 99 per cent of the minimum amount of material.
The research in the US has proved that such programs do not exist for large classes of NP-complete problems - and that such problems will almost certainly be incapable of being computerised. This spin-off alone is being claimed as the major computer science discovery of the past two decades.
The writer is professor of computer science at the Open University.
Top Un: North Korean dictator Kim Jong-Un is Maverick as he poses with all-female pilot crew of the Anti-Air Force Unit
Belle Knox: How the porn star student from Duke University became bigger than Justin Bieber
Top 10 most expensive cities in the world: Singapore named costliest place to live – but what about London?
Oscar Pistorius trial: Athlete 'cheated on me' with Reeva Steenkamp, former girlfriend Samantha Taylor tells Pretoria court
Channel 4 announces two-hour TV show to be broadcast 'Live from Space' later this month
Apple's Tim Cook: Business isn’t just about making profit
Thousands of young people forced to go without food after benefits wrongly stopped under 'draconian' new sanctions regime
Ukraine crisis: New navy chief 'defects' and surrenders Crimean HQ as Putin claims ultranationalists forced intervention
Britain's top vet sparks controversy with call for ban on slashing animals' throats in 'ritual' slaughters for halal and kosher meat products
Ukraine crisis: Russia dismisses '3am ultimatum' as 'total nonsense'
If you're horrified by a flame-roasted dog, you should be shocked at a hog roast
- 1 The future of sex: The first female condoms were derided, mistrusted and shunned - but will their modern counterparts catch on?
- 2 South African rhino finally put down after roaming Kruger park for days with horn hacked off and bullet in brain
- 3 Italian pensioner hires an escort who turns out to be his son's girlfriend
- 4 Orgasm machine to deliver climax at the push of a button
- 5 Channel 4 announces two-hour TV show to be broadcast 'Live from Space' later this month
£12000 per annum: Inspiring Interns: A small but growing chain of boutique hot...
£12000 per annum: Inspiring Interns: The company works with Tier 1 FTSE 100 Ba...
£45 - 60k Per Annum: Charter Selection: Highly profitable leisure brand, marke...
£30000 - £50000 per annum + Highly Competitive Salary: Austen Lloyd: Residenti...