ComputationA New way of science
Peter Denning, Craig Martell
Publikationsdatum:
|
|
Diese Seite wurde seit 5 Jahren inhaltlich nicht mehr aktualisiert.
Unter Umständen ist sie nicht mehr aktuell.
Zusammenfassungen
Less than a generation ago, mathematicians and technologists were
the only serious users of the word algorithm. Today, algorithms are
part of everyday conversation in many fields including engineering,
science, commerce, literature, art, and music. They are even the
subject of a political jibe: "What did Bill Clinton play on his sax? Al
Gore rhythms."
Algorithms not only describe and control what computers do, they have become a way of thinking. The algorithmic interpretation sees worldly phenomena as manifestations of information and seeks algorithmic solutions for problems. But there are limitations. Despite their awesome power, computing machines cannot do many things that humans can do such as recognize faces, label images, or create new interpretations. Those who have devoted many years trying to make computers behave like brains have succeeded mainly in cultivating brains that think like computers!
What’s behind the transformation of computation from the work of esoteric electronics to the thought of everyday persons?
Von Peter Denning, Craig Martell im Text Computation (2007) Algorithms not only describe and control what computers do, they have become a way of thinking. The algorithmic interpretation sees worldly phenomena as manifestations of information and seeks algorithmic solutions for problems. But there are limitations. Despite their awesome power, computing machines cannot do many things that humans can do such as recognize faces, label images, or create new interpretations. Those who have devoted many years trying to make computers behave like brains have succeeded mainly in cultivating brains that think like computers!
What’s behind the transformation of computation from the work of esoteric electronics to the thought of everyday persons?
Dieser Text erwähnt ...
Personen KB IB clear | Alan Turing | ||||||||||||||||||
Fragen KB IB clear | P=NP ? | ||||||||||||||||||
Begriffe KB IB clear | Algorithmusalgorithm , BerechenbarkeitComputability , Church-Turing-These , Computation (GPoC) , Computercomputer , Formform , Great principles of Computing (GPoC) , Informatikcomputer science , Informationinformation , NP , NP-completeNP-complete , Turing-Maschineturing machine | ||||||||||||||||||
Bücher |
| ||||||||||||||||||
Texte |
|
Dieser Text erwähnt vermutlich nicht ...
Tagcloud
Zitationsgraph
Volltext dieses Dokuments
Computation: Artikel als Volltext (: , 62 kByte; : Link unterbrochen? Letzte Überprüfung: 2020-11-28 Letzte erfolgreiche Überprüfung: 2015-02-28) |
Anderswo suchen
Beat und dieser Text
Beat hat Dieser Text während seiner Zeit am Institut für Medien und Schule (IMS) ins Biblionetz aufgenommen. Beat besitzt kein physisches, aber ein digitales Exemplar. Eine digitale Version ist auf dem Internet verfügbar (s.o.). Es gibt bisher nur wenige Objekte im Biblionetz, die dieses Werk zitieren.