Explore >> Select a destination
|
You are here 
|
www.reedbeta.com | ||
| | | | |
www.hillelwayne.com
|
|
| | | | | Have a tweet: img {border-style: groove;} I have no idea if Pony is making the right choice here, I don't know Pony, and I don't have any interest in learning Pony.1 But this tweet raised my hackles for two reasons: It's pretty smug. I have very strong opinions about programming, but one rule I try to follow is do not mock other programmers.2 Programming is too big and I'm too small to understand everything. | |
| | | | |
almostsuremath.com
|
|
| | | | | The aim of this post is to motivate the idea of representing probability spaces as states on a commutative algebra. We will consider how this abstract construction relates directly to classical probabilities. In the standard axiomatization of probability theory, due to Kolmogorov, the central construct is a probability space $latex {(\Omega,\mathcal F,{\mathbb P})}&fg=000000$. This consists... | |
| | | | |
thenumb.at
|
|
| | | | | [AI summary] The text discusses the representation of functions as vectors and their applications in various domains such as signal processing, geometry, and physics. It explains how functions can be treated as vectors in a vector space, leading to the concept of eigenfunctions and eigenvalues, which are crucial for understanding and manipulating signals and geometries. The text also covers different types of Laplacians, including the standard Laplacian, higher-dimensional Laplacians, and the Laplace-Beltrami operator, and their applications in fields like image compression, computer graphics, and quantum mechanics. The discussion includes spherical harmonics, which are used in representing functions on spheres, and their applications in game engines and glo... | |
| | | | |
mfbmina.dev
|
|
| | | Introdução RSA is a public/private encryption algorithm and it is based on the difficulty of the factorization of the product of two large prime numbers. It was named after its creators Rivest, Shamir, and Adleman. It is an expensive algorithm, computationally speaking, and because of this, it is not common to use it directly, but it is still widely used in the market and is one of the most important encryption algorithms. As an example, OpenSSL implements this algorithm for generating keys and it is com... | ||
