{"id":27598060,"url":"https://github.com/lucasmmg1/elementarycellularautomata","last_synced_at":"2026-05-15T11:35:19.735Z","repository":{"id":289011164,"uuid":"969802008","full_name":"lucasmmg1/elementarycellularautomata","owner":"lucasmmg1","description":"This is a elementary cellular automata theory representation made in processing!","archived":false,"fork":false,"pushed_at":"2025-04-21T02:20:47.000Z","size":30,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-22T14:10:39.235Z","etag":null,"topics":["automata","ca","cellular","elementary","java","processing","wolfram"],"latest_commit_sha":null,"homepage":"","language":"Processing","has_issues":false,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/lucasmmg1.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2025-04-21T00:34:03.000Z","updated_at":"2025-04-21T02:20:56.000Z","dependencies_parsed_at":"2025-04-21T03:35:05.834Z","dependency_job_id":"c0406a51-ff97-416a-a5e3-49fdcf675034","html_url":"https://github.com/lucasmmg1/elementarycellularautomata","commit_stats":null,"previous_names":["lucasmmg1/elementarycellularautomata"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/lucasmmg1/elementarycellularautomata","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lucasmmg1%2Felementarycellularautomata","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lucasmmg1%2Felementarycellularautomata/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lucasmmg1%2Felementarycellularautomata/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lucasmmg1%2Felementarycellularautomata/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lucasmmg1","download_url":"https://codeload.github.com/lucasmmg1/elementarycellularautomata/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lucasmmg1%2Felementarycellularautomata/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33065614,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-13T13:14:54.681Z","status":"online","status_checked_at":"2026-05-15T02:00:06.351Z","response_time":103,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["automata","ca","cellular","elementary","java","processing","wolfram"],"created_at":"2025-04-22T14:10:06.308Z","updated_at":"2026-05-15T11:35:19.718Z","avatar_url":"https://github.com/lucasmmg1.png","language":"Processing","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Elementary cellular automata\nThis is a visual representation of Wolfram's CA rules.\n\n\u003ch2\u003e Theory \u003c/h2\u003e\n\u003cp\u003e\n  Elementary cellular automata (ECAs) are a class of simple mathematical models used to study complex systems and patterns. They consist of a grid of cells, where each cell can be in one of two states (typically 0 or 1). The state of a cell in the next time step depends on its current state and the states of its two neighboring cells, according to a set of rules. There are 256 possible rule sets in ECAs, and despite their simplicity, these automata can generate a wide variety of complex and interesting patterns, making them a valuable tool in the study of self-organization and emergent behavior.\n\u003c/p\u003e\n\n\u003ch2\u003e How to use \u003c/h2\u003e\n\u003cp\u003e\n  In order to change the current CA, just change the RULESET_ID variable to a value between 0 and 256.\n\u003c/p\u003e\n\n\u003cbr\u003e\n\u003cimg src=\"data/example.png\"\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flucasmmg1%2Felementarycellularautomata","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flucasmmg1%2Felementarycellularautomata","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flucasmmg1%2Felementarycellularautomata/lists"}