000			03933nam a22005295i 4500
001			978-3-540-36874-8
003			DE-He213
005			20161121230530.0
007			cr nn 008mamaa
008			100301s2006 gw | s |||| 0|eng d
020			_a9783540368748 _9978-3-540-36874-8
024	7		_a10.1007/978-3-540-36874-8 _2doi
050		4	_aQA76.9.M35
072		7	_aPBD _2bicssc
072		7	_aUYAM _2bicssc
072		7	_aCOM018000 _2bisacsh
072		7	_aMAT008000 _2bisacsh
082	0	4	_a004.0151 _223
100	1		_aMazzola, Guerino. _eauthor.
245	1	0	_aComprehensive Mathematics for Computer Scientists 1 _h[electronic resource] : _bSets and Numbers, Graphs and Algebra, Logic and Machines, Linear Geometry (Second Edition) / _cby Guerino Mazzola, Gérard Milmeister, Jody Weissmann.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2006.
300			_aXIV, 388 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
505	0		_aSets, Numbers, and Graphs -- Fundamentals–Concepts and Logic -- Axiomatic Set Theory -- Boolean Set Algebra -- Functions and Relations -- Ordinal and Natural Numbers -- Recursion Theorem and Universal Properties -- Natural Arithmetic -- Infinities -- The Classical Number Domains Z, Q, R, and C -- Categories of Graphs -- Construction of Graphs -- Some Special Graphs -- Planarity -- First Advanced Topic -- Algebra, Formal Logic, and Linear Geometry -- Monoids, Groups, Rings, and Fields -- Primes -- Formal Propositional Logic -- Formal Predicate Logic -- Languages, Grammars, and Automata -- Categories of Matrixes -- Modules and Vector Spaces -- Linear Dependence, Bases, and Dimension -- Algorithms in Linear Algebra -- Linear Geometry -- Eigenvalues, the Vector Product, and Quaternions -- Second Advanced Topic.
520			_aThis two-volume textbook Comprehensive Mathematics for Computer Scientists is a self-contained comprehensive presentation of mathematics including sets, numbers, graphs, algebra, logic, grammars, machines, linear geometry, calculus, ODEs, and special themes such as neural networks, Fourier theory, wavelets, numerical issues, statistics, categories, and manifolds. The concept framework is streamlined but defining and proving virtually everything. The style implicitly follows the spirit of recent topos-oriented theoretical computer science. Despite the theoretical soundness, the material stresses a large number of core computer science subjects, such as, for example, a discussion of floating point arithmetic, Backus-Naur normal forms, L-systems, Chomsky hierarchies, algorithms for data encoding, e.g., the Reed-Solomon code. The numerous course examples are motivated by computer science and bear a generic scientific meaning. For the second edition the entire text has been carefully reread, and many examples have been added, as well as illustrations and explications to statements and proofs which were exposed in a too shorthand style. This makes the book more comfortable for instructors as well as for students to handle.
650		0	_aComputer science.
650		0	_aMathematical logic.
650		0	_aComputer science _xMathematics.
650		0	_aApplied mathematics.
650		0	_aEngineering mathematics.
650	1	4	_aComputer Science.
650	2	4	_aDiscrete Mathematics in Computer Science.
650	2	4	_aApplications of Mathematics.
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aMathematics of Computing.
700	1		_aMilmeister, Gérard. _eauthor.
700	1		_aWeissmann, Jody. _eauthor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540368731
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-540-36874-8
912			_aZDB-2-SCS
950			_aComputer Science (Springer-11645)
999			_c500166 _d500166