Posted by **arundhati** at April 7, 2017

2008 | ISBN-10: 3764387238 | 202 pages | PDF | 1 MB

Posted by **Specialselection** at June 12, 2012

English | 2008-03-27 | ISBN: 3764387238 | 202 pages | PDF | 12 mb

Posted by **interes** at April 21, 2014

English | 2008-03-27 | ISBN: 3764387238 | 202 pages | PDF | 1,4 mb

Compactly written, but nevertheless very readable, appealing to intuition, this introduction to probability theory is an excellent textbook for a one-semester course for undergraduates in any direction that uses probabilistic ideas. Technical machinery is only introduced when necessary. The route is rigorous but does not use measure theory.

Posted by **libr** at May 5, 2017

English | 1997 | ISBN: 0521556104 | ISBN-13: 9780521556101 | 144 pages | PDF | 5,5 MB

Posted by **libr** at April 8, 2017

English | 2012 | ISBN: 0321816196 , 0321816196 | 432 pages | PDF | 20,6 MB

Posted by **Sangviniy** at March 23, 2017

English | Oct. 14, 1994 | ISBN: 0387943323 | 148 Pages | PDF | 2.26 MB

The aim of this textbook is to present an account of the theory of computation. After introducing the concept of a model of computation and presenting various examples, the author explores the limitations of effective computation via basic recursion theory. Self-reference and other methods are introduced as fundamental and basic tools for constructing and manipulating algorithms.

Posted by **tanas.olesya** at April 2, 2016

English | 19 Feb. 2007 | ISBN: 1852338962 | 484 Pages | PDF | 4 MB

Suitable for self study. Use real examples and real data sets that will be familiar to the audience. Introduction to the bootstrap is included – this is a modern method missing in many other books.

Posted by **nebulae** at March 14, 2016

English | ISBN: 0821813390 | 1998 | 176 pages | PDF | 22 MB

Posted by **ChrisRedfield** at Dec. 27, 2015

Published: 1994-11-01 | ISBN: 0387977104, 3540977104 | PDF | 630 pages | 23.46 MB

Posted by **tanas.olesya** at Dec. 17, 2015

English | 1 Jan. 1968 | ISBN: 0471257087 | 528 Pages | PDF | 61 MB

Major changes in this edition include the substitution of probabilistic arguments for combinatorial artifices, and the addition of new sections on branching processes, Markov chains, and the De Moivre-Laplace theorem.