Soft cover. Condizione: Near Fine. Small corner clipped from front end paper (probably to remove an owner name) no other marks. A monograph on the artist, 134 pages, images mostly in color. Near fine in French-fold wraps.
Da: preigu, Osnabrück, Germania
EUR 43,30
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Computing Exact Approximations of a Chaitin Omega Number | A Glimpse of Randomness | Chi-Kou Shu | Taschenbuch | Englisch | VDM Verlag Dr. Müller | EAN 9783639135077 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
Lingua: Cinese
Editore: China Literature and History Publishing House, 2023
ISBN 10: 7520541495 ISBN 13: 9787520541497
Da: Rarewaves.com UK, London, Regno Unito
EUR 20,01
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Editore: Unknown, 2000
ISBN 10: 7802146224 ISBN 13: 9787802146228
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 215,62
Quantità: 1 disponibili
Aggiungi al carrellopaperback. Condizione: Acceptable. Acceptable. Dust Jacket NOT present. CD WILL BE MISSING. SHIPS FROM MULTIPLE LOCATIONS. book.
Da: moluna, Greven, Germania
EUR 39,24
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Shu Chi-KouChi-Kou Shu is a professor in the computer science college at nChina University of Technology. Formerly,he was an researcher atnthe CSIST,a national research organization in Taiwan. Dr. Shu nearned the B.S. degree at Chung.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 49,59
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In this monograph,the research aimed to compute some exact bits of a Chaitin Omega number. A Chaitin Omega numbers are halting probabilities of a specificmathematical model of the ubiquitous PC called 'self-delimiting Turing machine'. In 1936,Turing showed that no mechanical procedure and therefore no formal axiomatic theory can solve Turing's halting problem,the question of whether a given computer program willeventually halt. An Omega number combines allinstances of Turing's halting problem into aparadoxical real number. Its binary digits or bitsare algorithmically random and cannot bedistinguished from the the result of independent tossof a fair coin. Omega has a simple mathematical definition,but itdoes not enable us to determine more than finitelymany of its digits and no other definition can do itbetter. Furthermore,as nobody before was able tocompute any exact bit of a natural Omega number,the carrying on the computation is much moredemanding than solving Turing's halting problem.We reviewed the properties of Omega numbers leadingto the computation of approximations to obtaininitial exact 64 bits of a Chaitin Omega number.