CAM6
solid
CAM6 | solid | |
---|---|---|
6 | 117 | |
32 | 8,173 | |
- | 0.0% | |
2.1 | 0.0 | |
9 months ago | over 1 year ago | |
JavaScript | HTML | |
Apache License 2.0 | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
CAM6
-
Programming the CAM-6 Cellular Automata Machine Hardware in Forth (CAM6 Simulator demo)
Github Repo: https://github.com/SimHacker/CAM6/
-
Ask HN: What weird technical scene are you fond/part of?
https://www.youtube.com
I hate it when a program I wrote mocks me. In Lex Fridman's interview of Steven Wolfram, he demonstrates the machine learning functions in Mathematica by taking a photo of himself, which identifies him as a .... (I won't give it away):
https://www.youtube.com/watch?v=ez773teNFYA&t=2h20m05s
Here's a video I recently recorded of the CAM-6 simulator I implemented decades ago, and rewrote in JavaScript a few years ago.
https://www.youtube.com/watch?v=LyLMHxRNuck
I recorded that demo to show to Norman Margolus, who co-wrote the book and wrote the CAM6 PC Forth code and many rules, so it's pretty long and technical and starts out showing lots of code, but I'm sure you'll totally get and appreciate it. I linked to a pdf copy of the book in the comments, as well as the source code and playable app.
Demo of Don Hopkins' CAM6 Cellular Automata Machine simulator.
Live App: https://donhopkins.com/home/CAM6
Github Repo: https://github.com/SimHacker/CAM6/
Javacript Source Code: https://github.com/SimHacker/CAM6/blob/master/javascript/CAM...
PDF of CAM6 Book: https://donhopkins.com/home/cam-book.pdf
Comments from the code:
// This code originally started life as a CAM6 simulator written in C
-
Theory of Self Reproducing Automata [pdf]
https://news.ycombinator.com/item?id=22738268
DonHopkins on March 31, 2020 | parent | context | favorite | on: Von Neumann Universal Constructor
Here's some stuff about that I posted in an earlier discussion, and transcribed from his book, "Theory of Self-Reproducing Automata".
His concept of self-reproducing mutating probabilistic quantum mechanical machine evolution is quite fascinating and terrifying at the same time (or outside of time), potentially much more powerful and dangerous than mere physical nanotechnology "gray goo" and universe-infesting self replicating von Neumann probes:
Can Programming Be Liberated from the von Neumann Style? (1977) [pdf] (thocp.net)
https://news.ycombinator.com/item?id=21855249
https://news.ycombinator.com/item?id=21858465
John von Neuman's 29 state cellular automata machine is (ironically) a classical decidedly "non von Neumann architecture".
https://en.wikipedia.org/wiki/Von_Neumann_cellular_automaton
He wrote the book on "Theory of Self-Reproducing Automata":
https://archive.org/details/theoryofselfrepr00vonn_0
He designed a 29 state cellular automata architecture to implement a universal constructor that could reproduce itself (which he worked out on paper, amazingly):
https://en.wikipedia.org/wiki/Von_Neumann_universal_construc...
He actually philosophized about three different kinds of universal constructors at different levels of reality:
First, the purely deterministic and relatively harmless mathematical kind referenced above, an idealized abstract 29 state cellular automata, which could reproduce itself with a Universal Constructor, but was quite brittle, synchronous, and intolerant of errors. These have been digitally implemented in the real world on modern computing machinery, and they make great virtual pets, kind of like digital tribbles, but not as cute and fuzzy.
https://github.com/SimHacker/CAM6/blob/master/javascript/CAM...
Second, the physical mechanical and potentially dangerous kind, which is robust and error tolerant enough to work in the real world (given enough resources), and is now a popular theme in sci-fi: the self reproducing robot swarms called "Von Neumann Probes" on the astronomical scale, or "Gray Goo" on the nanotech scale.
https://en.wikipedia.org/wiki/Self-replicating_spacecraft#Vo...
https://grey-goo.fandom.com/wiki/Von_Neumann_probe
>The von Neumann probe, nicknamed the Goo, was a self-replicating nanomass capable of traversing through keyholes, which are wormholes in space. The probe was named after Hungarian-American scientist John von Neumann, who popularized the idea of self-replicating machines.
Third, the probabilistic quantum mechanical kind, which could mutate and model evolutionary processes, and rip holes in the space-time continuum, which he unfortunately (or fortunately, the the sake of humanity) didn't have time to fully explore before his tragic death.
p. 99 of "Theory of Self-Reproducing Automata":
>Von Neumann had been interested in the applications of probability theory throughout his career; his work on the foundations of quantum mechanics and his theory of games are examples. When he became interested in automata, it was natural for him to apply probability theory here also. The Third Lecture of Part I of the present work is devoted to this subject. His "Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components" is the first work on probabilistic automata, that is, automata in which the transitions between states are probabilistic rather than deterministic. Whenever he discussed self-reproduction, he mentioned mutations, which are random changes of elements (cf. p. 86 above and Sec. 1.7.4.2 below). In Section 1.1.2.1 above and Section 1.8 below he posed the problems of modeling evolutionary processes in the framework of automata theory, of quantizing natural selection, and of explaining how highly efficient, complex, powerful automata can evolve from inefficient, simple, weak automata. A complete solution to these problems would give us a probabilistic model of self-reproduction and evolution. [9]
[9] For some related work, see J. H. Holland, "Outline for a Logical Theory of Adaptive Systems", and "Concerning Efficient Adaptive Systems".
https://www.deepdyve.com/lp/association-for-computing-machin...
https://deepblue.lib.umich.edu/bitstream/handle/2027.42/5578...
https://www.worldscientific.com/worldscibooks/10.1142/10841
Ericson2314 3 months ago [-]
> Although I refer to conventional languages as "von Neumann languages" to take note of their origin and style, I do not, of course, blame the great mathematician for their complexity. In fact, some might say that I bear some responsibility for that problem.
From the paper. Whew.
-
Show HN: Making a Falling Sand Simulator
Typically a cellular automata simulation will have some edge condition like wrapping or mirroring an adjacent cell.
A nice optimization trick is to make the cell buffers 2 cells wider and taller (or two times whatever the neighborhood radius is), and then before each generation you update the "gutter" by copying just the wrapped (or mirrored) pixels. Then your run the rule on the inset rectangle, and the code (in the inner loop) doesn't have to do bounds checking, and can assume there's a valid cell to read in all directions. That saves a hell of a lot of tests and branches in the inner loop.
Also, the Margolus neighborhood can be defined in terms of the Moore neighborhood + vertical phase (even/odd row) + horizontal phase (even/odd column) + time phase (even/odd time). Then you can tell if you're at an even or odd step, and which of the four squares of the grid you're in, to know what to do.
That's how the CAM6 worked in hardware: it used the x/y/time phases as additional bits of the index table lookup.
https://github.com/SimHacker/CAM6/blob/master/javascript/CAM...
Here's how my CAM6 emulator computes the Margolus lookup table index, based on the 9 Moore neighbors + phaseTime, phaseX, and phaseY:
function getTableIndexUnrotated(
- Ask HN: What book changed your life?
-
It's always been you, Canvas2D
Oh, nicely done! Trying to code up cellular automata simulations are pretty much guaranteed to push my brains through my nostrils - I've never progressed far beyond classic Conway. Your CAM6 library[1] may be about to steal my weekend from me!
[1] - https://github.com/SimHacker/CAM6
solid
-
Simple Lasts Longer
This doesn't support the various consumer cloud storage APIs, but you've just reminded me of a project I ran into years ago that seems to still be around: https://remotestorage.io/
There's also Solid which attempts to do something similar: https://solidproject.org/
-
The current state of the Web and what is the next step in its evolution.
It is surprising to me this is not talked about more. I see little to none online news, podcasts, YouTube videos or anything else where this is discussed. I only found out about it because of research I did on Tim Berners-Lee in preparation for a Career Day talk at my kids middle school. Otherwise I would have probably not known about it still today. And even after I found out and started watching YouTube videos on the topic, YouTube won't even suggest any related videos about it even after already watching multiple videos on the subject (Web 3.0, Solid Project, Decentralized Web...etc).. is Big Tech trying to keep the web from evolving into what Sir Tim Berners-Lee is proposing?
-
Write libraries instead of services, where possible
It's only an unreasonable amount of work if you assume that the user is managing a separate storage backend for each library. If you take the Tim Berners-Lee approach (re: https://solidproject.org/) then each user is only managing one storage backend: the one that stores their data. The marginal cost of hooking in one more library low.
We just have to get a little more fed up with all of these services and then the initial cost of setting it up in the first place will be worth it. Any day now...
-
Manas: Storage servers confirming to Solid protocol
Solid is a web native protocol to enable interoperable, read-write, collaborative, and decentralized web, truer to web's original vision.
-
Manas: Solid protocol storage server in Rust for decentralized web
Manas project(https://github.com/manomayam/manas/tree/main) aims to create a modular framework and ecosystem to create correct, robust storage servers adhering to Solid protocol in rust.
[Solid](https://solidproject.org/) is a web native protocol to enable interoperable, read-write, collaborative, and decentralized web, truer to web's original vision.
Solid adds to existing Web standards to realise a space where individuals can maintain their autonomy, control their data and privacy, and choose applications and services to fulfil their needs.
-
My vision of the semantic web...correct me if I'm wrong.
You're describing Solid, not the Semantic Web. Granted, Solid uses Semantic technologies to achieve it. https://solidproject.org/
- Threads : à peine lancé, le concurrent de Twitter crée par Facebook compte 10 millions de membres
-
The problem with federated web apps
Tim Berners-Lee's Solid project is working on that. Put data in "pods" that are stored on pod servers, which are federated. You can self-host.
It could be a federated layer of identity & personal content decoupled from social platforms.
https://solidproject.org/
-
Update of the RDF and SPARQL (RDF star) families of specifications
Check out https://solidproject.org (If you want a short intro I recently gave a ~30min talk about it: https://noeldemartin.com/fosdem)
- Solid, a spec that lets people store their data securely in decentralized Pods
What are some alternatives?
BezierInfo-2 - The development repo for the Primer on Bézier curves, https://pomax.github.io/bezierinfo
Mastodon - Your self-hosted, globally interconnected microblogging community
SVM-Face-and-Object-Detection-Shader - SVM using HOG descriptors implemented in fragment shaders
logseq - A local-first, non-linear, outliner notebook for organizing and sharing your personal knowledge base. Use it to organize your todo list, to write your journals, or to record your unique life.
GoJS, a JavaScript Library for HTML Diagrams - JavaScript diagramming library for interactive flowcharts, org charts, design tools, planning tools, visual languages.
orbitdb - Peer-to-Peer Databases for the Decentralized Web
uBlock - uBlock Origin - An efficient blocker for Chromium and Firefox. Fast and lean.
Peergos - A p2p, secure file storage, social network and application protocol
new-wave - Stack Computer Bytecode Interpreters: The New Wave
kanidm - Kanidm: A simple, secure and fast identity management platform
virtualagc - Virtual Apollo Guidance Computer (AGC) software
Nullboard - Nullboard is a minimalist kanban board, focused on compactness and readability.