Celebrating 50 Years of Computing’s Greatest Achievements
Articles,  Blog

Celebrating 50 Years of Computing’s Greatest Achievements


Long before many could envision the concept
of computers, Alan Mathison Turing saw their tremendous potential to alter our world for
the better. In the coming months ACM will celebrate 50
years of the ACM A.M. Turing Award, as well as many of computing’s
greatest achievements. Turing’s role in computing… Turing’s role was the visionary. From the rudiments of computing at the time
he was able to extrapolate the immensity of what a “computer” could do. There is a new giant around. And that is computation. Computation is the glue that keeps the world
together. Forty odd years after we did our original
work on internet protocols and the fact of the matter is people are still stuck at looking
at screens and keyboards and many people are 7/24 stuck to them. Early ideas become mainstream… To realize that these early ideas, data abstraction
and specifications and programming language and so forth, to understand that they had
moved so into the mainstream that everybody knew them and they were the basis of how you
wrote programs, I mean that was just a remarkable thing to understand. To distill what is of lasting interest… Now what I’m trying to do is to distill off
what parts of the things that people are doing today are people going to be interested in
50 years from now. What’s next… Today we have all this tremendous amount of
data out there, a tremendous amount of connectivity, and there’s really pressing question. Now What? So there are all kinds of concerns that people
have about safety, about reliability of these devices, about their security and whether
or not they preserve privacy. Everything we do is already known and knowable… Everything we do is already known and knowable. I don’t think we have any privacy at all. Every science is beholden to computing Because this space of computing is exploding. It touches so much of everything we do in
all the sciences. Now every science is beholden to our ability
to compute.

2 Comments

  • Pedro Alejandro Jaramillo Huenuman

    Hello,
    This is Pedro Alejandro Jaramillo Huenuman
    My mission is colaborate
    I do not understand how to postulate, better I post it.
    I will like to postulate but Don't know how….

    So;
    Computational complexity theory (P=NP);
    Answer:
    ∀ (P = NP) <=> ( ( ( ( ( P ≠ ( P = NP ) ) ∧ ( ( NP ≠ ( P = NP ) ) ) ∨ ( ( ( P = ( P ≠ NP ) ) ∧ ( ( NP = ( P ≠ NP ) ) ) ) ∧ ( ( ( ( P ≠ ( P ≠ NP ) ) ∧ ( ( NP = ( P = NP ) ) ) ∨ ( ( ( P = ( P = NP ) ) ∧ ( ( NP ≠ ( P ≠ NP ) ) ) ) )

    Example:
    defense = mock; P=NP
    impotence = injustice; P=P
    injustice = injury; NP=NP
    law = defense; P=P
    justice = law; P=P

    that is:
    law = impotence; P=NP
    law = injury; P=NP
    law = injustice; P=NP
    law = mock; P=NP

    This is Pedro Alejandro Jaramillo Huenuman from Chile (CL)

Leave a Reply

Your email address will not be published. Required fields are marked *