Skip to content

The most basic Rule30 pseudo randomness algorithm visualised using GoLang

Notifications You must be signed in to change notification settings

adi-code22/cellular-automata-rule30

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Cellular Automata Rule30

What if I told you that "randomness" in computer systems are real gimmick!

Computer Systems are not skilled enough to produce real random numbers, they use deterministic algorithms to produce numbers which look random but follows an order which is derived from a seed value.

I've seen that most of the time new Date() (which is the current datetime) is given as the seed.

These pseudorandom numbers are prone to repeat the same pattern if provided with the same seed value.


Rule30

Rule30 is a similar deterministic pseudorandom number generator algorithm used for a long time by Stephen Wolfram.


Below I've attached the outputs for Rule30 algorithm programmed in GoLang

The most basic Rule30 pseudo randomness algorithm visualized using GoLang

Screenshot 2024-12-18 at 01 09 18 Screenshot 2024-12-18 at 01 04 36

About

The most basic Rule30 pseudo randomness algorithm visualised using GoLang

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages