ConwayLife.com

cgg wrote: ↑

November 16th, 2019, 9:49 pm

Has anyone studied these?

Yep

Koch curve fractal (recommended step 2^30 and above). The apgsembly code is here . I've used this logic golly script: import golly as g def dir2xy(d): if d == 0: return (1,0) if d == 1: return (1, 1) if d == 2: return (0, 1) if d == 3: return (-1, 1) if d == 4: return (-1, 0) if d == 5: return (-1, ...

99 bottles of beer on the wall... A recursive song printed with apgsembly on GPC.

EDIT Recommended golly step 2^34

I might just have the compiler check the length of the program, and move the digitprinter to a safe offset. The whole thing can just move NE any distance, with no other adjustments needed. Just notice if the program is way too long - the printer will jump to unknown place. Say if I have 10M lines o...

@dvgrn - All this looks super great. The SQ addition is very nice and the GPC in general looks amazing. Several notes (maybe before the optimal fit script): 1. We have the two parts - the APGsembly code generated by the script and the static tape interpreter of GPC. But they're located in different ...

For a while now I'm thinking about a *WSS based mechanism to use static tape, It's way faster. I wonder if some hybrid of T unit and *WSS based coding might solve the problem. Another option is to use something like zip mechanism, that stores a table of conversion from abstract codes to most common ...

and another read-only one that uses eaters. Yes read only is enough for self replication - but not enough for computation. I also saw there is no glider guns in this design - would you implement it this way in the new calculator or with the guns? But the behavior of the circuit would change, so it ...

@dvgrn May I ask for at least T binary unit to have a slow salvo friendly version? I've thought of self replicating design. And although the other components are imaginary for now (maybe can be added to the challenge) but the design is based on T0 so if you already redesign all the components...

Self replication design based on the calculator: We need only three units: 1. T0 2. BUILD. It has 3 commands: INIT - place the block in correct (x, y) + Build initial reading head. BUILD0 - builds Boat0 as in T0 tape and moves the construction block BUILD1 - builds Boat1 as in T0 tape and moves the ...

More APGsembly examples: Binary adder in binary format print: APGsembly = """INITIAL; Z; AD; READ T0 AD; Z; D; SET T0, DEC T0 AD; NZ; AD1; RESET T0, INC T0 AD1; Z; AD2; READ T0, INC R0, NOP AD2; Z; D; SET T0, DEC T0 AD1; NZ; AD; READ T0 D; NZ; D; DEC T0 D; Z; PRStart; TDEC R0 PRStart; Z; PR; READ T0...

I want to cover the computational model for broader audience. These calculators are basically finite-state machines, where each line in a program corresponds to a state, and you have JUMP instructions for every state. Each line can trigger one or more actions -- INC R0, TDEC R2, NOP, etc. -- and you...

I've analyzed all the operations again after all the bugs were fixed. MUL: It works up to 01010 (including) and not further. MUL0 + (xyz): z -> Z/NZ xyz -> xy MUL1 + (xyz): z -> Z/NZ xyz -> xy + 5 ADD: A1 + (xyz) + b: Z/NZ -> NONE xyz = x(~y)z b -> ~b B1 + (xyz) + b: b -> NZ/Z (xyz) -> {0, 1} = (000...

As currently configured, the script emulates the phi calculator, figures out where to expect blocks and boats in all the registers (simple and binary), and stops when reality fails to match the model. The next step would be to check out that particular case. There could be two options that I see: 1...

I've written a simple debugger for pi calculator. It adds listeners to some areas and every 2^20 records lifehistory status. #Pi calculator debugger. Written by Michael Simkin 2019. #Records all input-output code line activity into pi-run.txt #Use pi calculator from here: http://pentadecathlon.com/l...

@Complexity If you manage to pull something like this off even in some simplistic rules like loops with computational tapes having them being able to parallelize any computation by being able to split and unite after the computation is complete - it would be pretty crazy. I mean you can start from s...

@dvgrn Sounds fair enough. If you see you need a help with the deeper dive, it sounds to me not so deep of a dive and I can help if you don't manage to find fast fix in the next day or two. It's just a listener in some places (I know a lot of listeners) and toggle of life rule i.e. deleting history ...

Another way to get to have variable precision integers is to use c2 spark reactions on aligned still life Definitely I even prefer this approach. I've recently built unbounded binary adder with this design (didn't have the incentive to add a self destruct nor a gun to make it completely valid circu...

Here is my attempt to make more sense of the operations: The best way to think about it as A1, B1 and B0 are operation which are done on the state. Each operation is doing something else. The bit1/0 is output correlate (unless A1 operation is switching it without producing output). ADD A1: bit(x)->b...

It means "if you send in a MUL1... you'll get a Z output, and there will now be boats... Yeah now I get the notation. This is a good starting exercise for me in making sense of the operations. Let me state what I figured out in the table of MUL component. what would be a simpler way of describing t...

To write the emulator I just placed boats in each of the 32 technically possible combinations, and fed in MUL 0 and MUL 1 for each such arrangement, and recorded whether a Z or an NZ came out in each case. Let me see if I'm getting it correctly. We have 32 options of the reading head state (the boa...

so one can easily monitor the state of the memory without having to pan the around large still lifes This sounds like visualization problem i.e. you would like to have a better tool that shows you what happens other than what native to golly. This is not flaw in the design. The execution speed is a...

It is indeed possible, the bit-depth can be arbitrarily large, one only need to stack more glider loops vertically (blue), and the rakes and static guns can be scaled accordingly. Think I want a program that prints all the prime numbers. With the technology you're suggesting one would need to have ...

Here some 64 byte RAM prototype I have two questions here: 1. How this thing works? I mean how would you read or write into this RAM circuit an information? 2. I think stable circuitry is one of the things which allows any amount of bits. For example I can have two integers of 128 bits and two inte...

I don't think we have any 3d CA geminoid implementation. So the challenge is (1) to find a 3d rule that has reflectors, duplicators and construction arms, and then (2) to build 3d geminoid that moves in (dx, dy, dz).

I can share my failed attempt at back propagator. I've tried to make automated back propagator in several ways, one of the ways was to use the same mechanics lifesrc uses, but teach the network to guess the next 0,1 of the previous gen given the current gen partial as well. As there is exponentially...