No label defined (Q4040235)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 193424
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 193424

      Statements

      5 June 1993
      0 references
      elementary mathematical structures
      0 references
      discrete mathematics
      0 references
      0 references
      Since from a mathematical point of view nothing special can be reported on this book the main emphasis of the review is of a didactic character. The book presents a vast number of concepts and methods but very many of them occur just once and nowhere further on any use is made of them. In some parts it is thus more a collection of definitions some of which remain completely isolated. This is one aspect of a rather condensed style of presentation which will make it difficult for students to study the presented material on their own. This possibly reflects the source of the book, a so called ``Intensivkurs''. There are very rarely motivations or applications, the mathematics is presented in a pure and polished form which raises some doubts on the intended reader. Some parts could address mathematics students, others those of computer science. Might be the best characterisation of the book is its very first sentence: ``A mathematical theory in our times is built axiomatically''. For the sake of completeness I include the chapter headings (in German): Axiomatik und Mengen, Vollständige Induktion, Teiler und Reste, Kombinatorik, Graphen, Codierungen, Polynome und Fractale, Lineare Optimierung, Sprachen und Maschinen, Formale Begriffsanalyse, Taxonomie, Kybernetik. For twelve of the algorithms presented in the text, in an appendix Pascal-programs are presented which have been written by 12th grade students (high school) under the supervision by tutors from the university. Such, these programs are not optimal implementations but they are rather interesting as student work. As a final remark: The classification of discrete mathematics as consisting of finite or countable structures and of algorithms which can be run on a computer appears not to match the common practice.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references