Search

Planet Earth

Sunday, 24-October-2021
....

Login form

Aryanblood

Most popular

  • शिव चालीसा, मंत्र Shiva mantra / Chalisa (40)
  • श्री गणेश मन्त्र Shri Ganesha mantra / chalisa (35)
  • दुर्गा माँ मन्त्र Durga Maa Mantra / chalisa (33)
  • काली माँ महाकाली भद्रकाली मंत्र Kali Maa Mantra (26)
  • Maha लक्ष्मी मन्त्र Lakshmi mantra (23)
  • free TAROT/Iching/Numerology/Astro readings links (23)
  • vegetarian diet - pictures - information - guide thread (21)
  • Vedic Physics - What ancient Indians did for us (18)
  • funny video compilation (17)
  • श्री हनुमान Hanuman chalisa / mantra (16)
  • Best of just for laughs (16)
  • Battlefield V gameplay HD (15)
  • श्री विष्णु मंत्र Sri Vishnu mantra / chalisa (15)
  • Warhammer 40,000 Inquisitor - Martyr gameplay HD (14)
  • Chakra Meditation / Kundalini Yoga/ healing कुण्डलिनी योग (13)
  • Astrology Yoga, bhava - Garga Hora by Sage Gargacharya (12)
  • All Zodiac signs explained (11)
  • Aryanblood

    ad


    world’s most complex math riddle solved by computerscientist - Forum

    [ New messages · Forum rules · Search · RSS ]
    • Page 1 of 1
    • 1
    Forum moderator: arya, dethalternate  
    Forum » Main » Science, Astronomy, Nature » world’s most complex math riddle solved by computerscientist
    world’s most complex math riddle solved by computerscientist
    dethalternateDate: Saturday, 14-August-2010, 10:50 AM | Message # 1
    -- dragon lord--
    Group: Users
    Messages: 3374
    Status: Offline
    Computer scientist Vinay Deolalikar claims to have solved maths riddle of P vs NP

    Vinay Deolalikar, who works at the research arm of Hewlett-Packard in Palo Alto, California, believes he has solved the riddle of P vs NP in a move that could transform mankind’s use of computers as well as earn him a $1m (£650,000) prize.

    P vs NP is one of the seven millennium problems set out by the Massachusetts-based Clay Mathematical Institute as being the “most difficult” to solve.

    Many mathematical calculations involve checking such a large number of possible solutions that they are beyond the current capability of any computer. However, the answers to some are quick and easy to verify as correct. P vs NP considers if there is a way of arriving at the answers to the calculations more quickly in the first place.

    Mr Deolalikar claims to have proven that P, which refers to problems whose solutions are easy to find and verify, is not the same as NP, which refers to problems whose solutions are almost impossible to find but easy to verify.

    Full article/source - http://www.telegraph.co.uk/science....NP.html


     
    Forum » Main » Science, Astronomy, Nature » world’s most complex math riddle solved by computerscientist
    • Page 1 of 1
    • 1
    Search: