|
|
|||
|
||||
OverviewFull Product DetailsAuthor: Armin P. BarthPublisher: Springer Fachmedien Wiesbaden Imprint: Springer Spektrum Edition: 2., überarb. Aufl. 2014 Dimensions: Width: 16.80cm , Height: 1.50cm , Length: 24.00cm Weight: 0.454kg ISBN: 9783658022815ISBN 10: 3658022817 Pages: 241 Publication Date: 24 October 2013 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Language: German Table of ContentsWas ist ein Algorithmus - Eine erste Antwort.- Algorithmen auf dem Laufsteg.- Effizienz von Algorithmen.- Turing-Maschinen.- Grenzen der Formalisierens.ReviewsThis book presents a pleasant and informative introduction to algorithms as well as a short tour on computability and complexity theory. a book that is nice to read. It is indeed what it is supposed to be a gentle introduction to algorithmics. (Joost-Pieter Katoen, zbMATH 1311.68002, 2015) This book presents a pleasant and informative introduction to algorithms as well as a short tour on computability and complexity theory. a book that is nice to read. It is indeed what it is supposed to be a gentle introduction to algorithmics. (Joost-Pieter Katoen, zbMATH 1311.68002, 2015)</p> This book presents a pleasant and informative introduction to algorithms as well as a short tour on computability and complexity theory. a book that is nice to read. It is indeed what it is supposed to be a gentle introduction to algorithmics. (Joost-Pieter Katoen, zbMATH 1311.68002, 2015) This book presents a pleasant and informative introduction to algorithms as well as a short tour on computability and complexity theory. a book that is nice to read. It is indeed what it is supposed to be a gentle introduction to algorithmics. (Joost-Pieter Katoen, zbMATH 1311.68002, 2015) This book presents a pleasant and informative introduction to algorithms as well as a short tour on computability and complexity theory. ... a book that is nice to read. It is indeed what it is supposed to be - a gentle introduction to algorithmics. (Joost-Pieter Katoen, zbMATH 1311.68002, 2015) This book presents a pleasant and informative introduction to algorithms as well as a short tour on computability and complexity theory. a book that is nice to read. It is indeed what it is supposed to be a gentle introduction to algorithmics. (Joost-Pieter Katoen, zbMATH 1311.68002, 2015) This book presents a pleasant and informative introduction to algorithms as well as a short tour on computability and complexity theory. a book that is nice to read. It is indeed what it is supposed to be a gentle introduction to algorithmics. (Joost-Pieter Katoen, zbMATH 1311.68002, 2015) Author InformationArmin P. Barth unterrichtet Mathematik an der Kantonsschule Baden in der Schweiz und arbeitet am MINT-Lernzentrum der ETH Zürich (Institut für Lehr- und Lernforschung). Herr Barth hat diverse Artikel und Bücher publiziert zu den Themen Mathematik und Didaktik. Er hatte sich während seines Mathematikstudiums auf die Algorithmik spezialisiert, hat dieses Thema in zahlreichen Volkshochschulvorlesungen Laien nahe gebracht und in den letzten Jahren reiche Erfahrungen in Bezug auf den Einsatz dieses Gebietes im Gymnasium gemacht. Tab Content 6Author Website:Countries AvailableAll regions |
||||