Probability on Finite and Discrete Set and Uniform Distribution

Pole DC	Wartość	Język
dc.contributor.author	Okazaki, Hiroyuki	-
dc.date.accessioned	2015-12-01T19:26:35Z	-
dc.date.available	2015-12-01T19:26:35Z	-
dc.date.issued	2009	-
dc.identifier.citation	Formalized Mathematics, Volume 17, Issue 2, 2009, Pages 173-178	-
dc.identifier.issn	1426-2630	-
dc.identifier.issn	1898-9934	-
dc.identifier.uri	http://hdl.handle.net/11320/3534	-
dc.description.abstract	A pseudorandom number generator plays an important role in practice in computer science. For example: computer simulations, cryptology, and so on. A pseudorandom number generator is an algorithm to generate a sequence of numbers that is indistinguishable from the true random number sequence. In this article, we shall formalize the "Uniform Distribution" that is the idealized set of true random number sequences. The basic idea of our formalization is due to [15].	-
dc.language.iso	en	-
dc.publisher	De Gruyter Open	-
dc.title	Probability on Finite and Discrete Set and Uniform Distribution	-
dc.type	Article	-
dc.identifier.doi	10.2478/v10037-009-0020-z	-
dc.description.Affiliation	Shinshu University, Nagano, Japan	-
dc.description.references	Grzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.	-
dc.description.references	Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.	-
dc.description.references	Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.	-
dc.description.references	Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.	-
dc.description.references	Czesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 1990.	-
dc.description.references	Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.	-
dc.description.references	Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.	-
dc.description.references	Czesław Byliński. Partial functions. Formalized Mathematics, 1(2):357-367, 1990.	-
dc.description.references	Czesław Byliński. The sum and product of finite sequences of real numbers. Formalized Mathematics, 1(4):661-668, 1990.	-
dc.description.references	Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.	-
dc.description.references	Jarosław Kotowicz. Real sequences and basic operations on them. Formalized Mathematics, 1(2):269-272, 1990.	-
dc.description.references	Andrzej Nędzusiak. Probability. Formalized Mathematics, 1(4):745-749, 1990.	-
dc.description.references	Jan Popiołek. Introduction to probability. Formalized Mathematics, 1(4):755-760, 1990.	-
dc.description.references	Piotr Rudnicki. Little Bezout theorem (factor theorem). Formalized Mathematics, 12(1):49-58, 2004.	-
dc.description.references	Victor Shoup. A computational introduction to number theory and algebra. Cambridge University Press, 2008.	-
dc.description.references	Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.	-
dc.description.references	Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.	-
dc.description.references	Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990.	-
dc.description.references	Bo Zhang and Yatsuka Nakamura. The definition of finite sequences and matrices of probability, and addition of matrices of real elements. Formalized Mathematics, 14(3):101-108, 2006, doi:10.2478/v10037-006-0012-1.	-
Występuje w kolekcji(ach):	Formalized Mathematics, 2009, Volume 17, Issue 2

Pliki w tej pozycji:

Plik	Opis	Rozmiar	Format
v10037-009-0020-z.pdf		259,94 kB	Adobe PDF	Otwórz

Pokaż uproszczony widok rekordu Zobacz statystyki

Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL