1
Fractl (fractl.art)
submitted 4 days ago by to c/mathematics@lemmy.ml
2
3
4
5
submitted 2 months ago* (last edited 2 months ago) by to c/mathematics@lemmy.ml
6
Squares in Squares (kingbird.myphotos.cc)
submitted 2 months ago by to c/mathematics@lemmy.ml
7
8
 
 

This paper discovered the continuous math equivalent of the digital NAND gate. It turns out that a single binary operation paired with the constant 1 can generate every single standard elementary function. That operation is defined as eml(x,y)=exp(x)-ln(y). You can reconstruct constants like pi and the imaginary unit alongside basic addition and complex calculus tools using nothing but this one function.

The implications for machine learning and symbolic regression are massive. Normally when artificial intelligence tries to discover mathematical formulas from data it has to search through a chaotic space of different operators and syntax rules. Because the EML operator turns every mathematical expression into a uniform binary tree of identical nodes the search space becomes perfectly regular. You can basically treat a mathematical formula like a neural network circuit. The paper shows that when you train these EML trees using standard gradient optimizers like Adam the weights can actually snap to exact closed-form symbolic expressions instead of just giving fuzzy numerical approximations.

This finding could change how we design analog circuits and specialized computing hardware. If you only need a single instruction to execute any complex mathematical function you could build physical hardware or single instruction stack machines optimized purely for the EML operation. The fact that this was discovered by computationally stripping down a calculator rather than through purely theoretical derivation highlights how much structural beauty is still hiding in basic math.

9
10
11
 
 

To saturate the inequality, we need something wigglier. The heavyweight champions for polynomial wiggliness are the Chebyshev polynomials T_n, which are motivated and described at length in this previous post.

12
13
submitted 6 months ago by to c/mathematics@lemmy.ml
14
submitted 8 months ago by to c/mathematics@lemmy.ml
15
Randomness Testing Guide (random.tastemaker.design)
 
 

cross-posted from: https://discuss.tchncs.de/post/48838525

Statistical Tests to determine whether a bit-stream can be considered "random"

If we were to flip a coin 10 times, we would expect to see roughly 5 heads and 5 tails. Let's assign 00 to heads and 11 to tails. Therefore, we might see a sequence like this...

16
17
18
19
20
21
22
23
24
25
view more: next ›