FreePSXBoot VS CAM6

No need to install a modchip, you can use freepsxboot: https://github.com/brad-lin/FreePSXBoot/

If you your PlayStation doesn't have a modchip you can also use the Memory Card manager in Unirom. Just get the FreePSXBoot version into a different memory card, boot to Unirom and the manager will show all saves, even the deleted ones, if they are still on the card. Then you can put the cursor over them and choose "undelete".

you could use FreePSXBoot to softmod it, here’s the github.

If you don't want to chip your console just get a Memory Card exploit like Unirom+FreePSXBoot or TonyHax+FreePSXBoot, it's basically the modern day replacement for the swap trick. Easier, more reliable and removes some other types of piracy protection from various games.

Most of the SDK has been tested and confirmed to be fully functional on real hardware, but there is some copy protection you will have to get around in order to run arbitrary software on a PS1. The traditional solution is to perform disc swapping or install a modchip, but nowadays we also have softmods [1] that make the process as easy as inserting a specially formatted memory card (which can be prepared using a PS2, or even a PS1 by swapping discs).

You are not required to use CDs either. With the help of some code and linker script magic, you can build an image that can be booted directly from a cheat cartridge (or simply a parallel EEPROM) connected to the console's expansion bus, bypassing the copy protection checks entirely. There are also debugging tools that, once loaded, let you download an executable into RAM for quick testing and manage memory cards using a modified serial cable [2].

[1] https://github.com/brad-lin/FreePSXBoot

[2] https://schnappy.xyz/?building_a_serial_psx_cable

The easiest way is freepsxboot. Amazing thing. https://github.com/brad-lin/FreePSXBoot

FreePSXBoot: https://github.com/brad-lin/FreePSXBoot Unirom: https://github.com/JonathanDotCel/unirom8_bootdisc_and_firmware_for_ps1 TonyHax: https://github.com/socram8888/tonyhax

Github Repo: https://github.com/SimHacker/CAM6/

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

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.

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(

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