Diese Datenbank enthält über 40.000 Dokumente zu Themen aus den Bereichen Formalerschließung – Inhaltserschließung – Information Retrieval.
© 2015 W. Gödert, TH Köln, Institut für Informationswissenschaft / Powered by litecat, BIS Oldenburg (Stand: 28. April 2022)
1Wolfram, S.: ¬A new kind of science.
Champaign Ill. : Wolfram Media, 2002. XIV, 1197 S.
Abstract: Challenging the traditional mathematical model of scientific description, a scientist proposes a new dynamic computational approach that utilizes simple codes to generate patterns of ultimate complexity. - ; Physics and computer science genius Stephen Wolfram, whose Mathematica computer language launched a multimillion-dollar company, now sets his sights on a more daunting goal: understanding the universe. Wolfram lets the world see his work in A New Kind of Science, a gorgeous, 1,280-page tome more than a decade in the making. With patience, insight, and self-confidence to spare, Wolfram outlines a fundamental new way of modeling complex systems. On the frontier of complexity science since he was a boy, Wolfram is a champion of cellular automata--256 "programs" governed by simple nonmathematical rules. He points out that even the most complex equations fail to accurately model biological systems, but the simplest cellular automata can produce results straight out of nature--tree branches, stream eddies, and leopard spots, for instance. The graphics in A New Kind of Science show striking resemblance to the patterns we see in nature every day. Wolfram wrote the book in a distinct style meant to make it easy to read, even for nontechies; a basic familiarity with logic is helpful but not essential. Readers will find themselves swept away by the elegant simplicity of Wolfram's ideas and the accidental artistry of the cellular automaton models. Whether or not Wolfram's revolution ultimately gives us the keys to the universe, his new science is absolutely awe-inspiring. - ; The long-awaited work from one of the world's most respected scientists presents a series of dramatic discoveries never before made public. Starting from a collection of simple computer experiments - illustrated in the book by striking computer graphics - Wolfram shows how their unexpected results force a whole new way of looking at the operation of our universe. Wolfram uses his approach to tackle a remarkable array of fundamental problems in science - from the origin of the Second Law of thermodynamics, to the development of complexity in biology, the computational limitations of mathematics, the possibility of a truly fundamental theory of physics, and the interplay between free will and determinism. Written with exceptional clarity, and illustrated with nearly 1,000 original pictures, this seminal book allows scientists and non-scientists alike to participate in what promises to be a major intellectual revolution.
Anmerkung: Rez. in: c't 2002, H.13, S.234-236 (J. Loviscach)
Wissenschaftsfach: Informatik ; Mathematik ; Wissenschaftstheorie
LCSH: Cellular automata ; Computational complexity
RSWK: Wissenschaftstheorie / Zellularer Automat / Berechnungskomplexität ; Zellularer Automat / Komplexitätstheorie / Naturwissenschaften
BK: 85.20 (Betriebliche Information und Kommunikation) ; 30.20 (Nichtlineare Dynamik) ; 30.02 (Philosophie und Theorie der Naturwissenschaften) ; 54.73 (Computergraphik) ; 31.14 (Zahlentheorie)
GHBS: TVH (DU) ; TUI (FH K) ; TVM (W)
RVK: ST 134 ; CC 3200 ; ST 130 ; SK 130 ; UB 5020
2Chaitin, G.J.: Algorithmic information theory.
Cambridge : Cambridge University Press, 1987. X, 175 S.
(Cambridge tracts in theoretical computer science ; 1)
Abstract: Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.
LCSH: Machine theory ; Computational complexity ; LISP (Computer program language)
RSWK: Algorithmus / Informatik ; Gödelscher Unvollständigkeitssatz ; Metamathematik / LISP
BK: 54.10 (Theoretische Informatik) ; 31.02 (Philosophie und Wissenschaftstheorie der Mathematik)
Eppelsheimer: Mat T 1068 / Informationstheorie
GHBS: TVB (E) ; TVI (HA)
RVK: SK 130