Re: Non-Canon STTMCBoss thread 71 was Re: [spam][crazy][fiction][random] Non-Canon MCBoss Spinoffs
On Wed, Jun 17, 2026 at 07:53:05PM -0400, funkymail wrote:
> > > > > > > > > > > > > > > > > > > > > > https://ar.anyone.tech/6cb-OyzPFi1nJYZ-uHAHH2uwoCbosf0AQuS_qGEgBXY#-U_3AcjRg... > > > > > > > > > > > > > > > > > > > > > > > > > > https://ar.anyone.tech/yz5qwtbaNxyukTrFyaO3YDFEcwweUyBvumiEDtvVnQg#x36BlkgBI... > > > > > > > > > > > > > > > > > > > > > > > > gotta a big strong stopping associated with "trend quickly and > > > > > > > > > > > > > > > reliably to" might relate to stopping fast AI > > > > > > > > > > > > > > > very strong > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > https://ar.anyone.tech/4JsidwtRdeBy8DCz0zj1jOPzjolbprJBTpcoGjLe7CQ#x36BlkgBI... > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > but i got more optimization and tech techniques from the stopping :) > > > > > > > > > > > > > > > > > > > > > > > > > > > > new stuff: > > > > > > > > > > > > > > if you want to find a signal with a known kind of mixing, you can use > > > > > > > > > > > > > > _all_ the metrics you have that identify the signal (for FastICA the
> > > > > > > > > > > > > > > > > > > > > > > > > > > > https://ar.anyone.tech/bEFskvOegFTcuLAV06d2baz1JE_BBNoInj2S5-_oncI#x36BlkgBI... > > > > > > > > > > > > > > > > > > > > > >
> > > > > > > > > > > > > https://ar.anyone.tech/J9Kqw2qRW-1ALpz0-RHgJpoSe9kGlu33HDtpL9WOCFk#YphTM_TEq... > > > > > > > > > > > > > https://ar.anyone.tech/cd_I0FskafQts2C0_jJC7XUldH5HMCpL-7xclGmH_uc > > > > > > > > > > > > > > > > > > > > > > > > [fill-in: so, let's get a copy of fastica] > > > > > > > > > > > > > > > > > > > > > > > > i ended up going to https://github.com/derekharrison/fastICA_C . it > > > > > > > > > > > > looks more familiar to me (which also means more triggering and > > > > > > > > > > > > challenging i'm afraid) and may be the actual code i started working off > > > > > > > > > > > > of (although the dates now don't seem to line up it could still work out > > > > > > > > > > > > as we had a lot of timestamp falsification going on) > > > > > > > > > > > > [but i think the one i had had more documentation could be wrong tho] > > > > > > > > > > > > > > > > > > > > > > > > ~/fastICA_C $ find * > > > > > > > > > > > > ReadingData.m > > > > > > > > > > > > inc > > > > > > > > > > > > inc/AlgoFunctions.h > > > > > > > > > > > > inc/Functions.h > > > > > > > > > > > > inc/MatrixOps.h > > > > > > > > > > > > inc/Memory.h > > > > > > > > > > > > inc/Parameter.h > > > > > > > > > > > > inc/ParameterDefinition.h > > > > > > > > > > > > lib > > > > > > > > > > > > lib/AlgorithmFunctions.c > > > > > > > > > > > > lib/ExportingData.c > > > > > > > > > > > > lib/Functions.c > > > > > > > > > > > > lib/MatrixOps.c > > > > > > > > > > > > lib/Memory.c > > > > > > > > > > > > lib/Setup.c > > > > > > > > > > > > src > > > > > > > > > > > > src/ICAMain.c > > > > > > > > > > > > src/ParameterInput.c > > > > > > > > > > > > src/Sources.c > > > > > > > > > > > > > > > > > > > > > > > > let's draft a buildfile, a makefile. hrm this might take me a bit. > > > > > > > > > > > > patsubst? wildcard? > > > > > > > > > > > > > > > > > > > > > > > > CFLAGS=-Iinc > > > > > > > > > > > > fastica: $(patsubst %.c,%.o,$(wildcard src/*.c)) libfastica.a > > > > > > > > > > > > libfastica.a: $(patsubst %.c,%.o,$(wildcard lib/*.c)) > > > > > > > > > > > > > > > > > > > > > > > > i may need more things specified too > > > > > > > > > > > > > > > > > > > > > > > > https://ar.anyone.tech/w-qCfpCBqFg2_SKFP6E-o6rYU_JOCQxTZ9OUkb7gZcI#QwJoMKDMM... > > > > > > > > > > > > https://ar.anyone.tech/aGenbOwZwY0p2iVyY7RfRHTPPqCNlSXxjmEBbo-gbvA > > > > > > > > > > > > > > > > > > > > > > here's where i'm at. i'll ask a business AI why my static library > > > > > > > > > > > can't use the the c standard library. > > > > > > > > > > > > > > > > > > > > > > $ cat makefile; make 2>&1 | head -n 16 > > > > > > > > > > > CFLAGS=-Iinc > > > > > > > > > > > fastica: $(patsubst %.c,%.o,$(wildcard src/*.c)) libfastica.a > > > > > > > > > > > $(LD) $^ -o $@ > > > > > > > > > > > libfastica.a: $(patsubst %.c,%.o,$(wildcard lib/*.c)) > > > > > > > > > > > $(AR) cru $@ $^ > > > > > > > > > > > %.o: %.c makefile > > > > > > > > > > > clean: > > > > > > > > > > > rm fastica libfastica.a */*.o > > > > > > > > > > > cc -Iinc -c -o src/ICAMain.o src/ICAMain.c > > > > > > > > > > > cc -Iinc -c -o src/ParameterInput.o src/ParameterInput.c > > > > > > > > > > > cc -Iinc -c -o src/Sources.o src/Sources.c > > > > > > > > > > > cc -Iinc -c -o lib/AlgorithmFunctions.o lib/AlgorithmFunctions.c > > > > > > > > > > > cc -Iinc -c -o lib/ExportingData.o lib/ExportingData.c > > > > > > > > > > > cc -Iinc -c -o lib/Functions.o lib/Functions.c > > > > > > > > > > > cc -Iinc -c -o lib/MatrixOps.o lib/MatrixOps.c > > > > > > > > > > > cc -Iinc -c -o lib/Memory.o lib/Memory.c > > > > > > > > > > > cc -Iinc -c -o lib/Setup.o lib/Setup.c > > > > > > > > > > > ar cru libfastica.a lib/AlgorithmFunctions.o lib/ExportingData.o lib/Functions.o lib/MatrixOps.o lib/Memory.o lib/Setup.o > > > > > > > > > > > ld src/ICAMain.o src/ParameterInput.o src/Sources.o libfastica.a -o fastica > > > > > > > > > > > ld: error: undefined symbol: time > > > > > > > > > > > >>> referenced by ICAMain.c > > > > > > > > > > > >>> src/ICAMain.o:(main) > > > > > > > > > > > > > > > > > > > > > > ld: error: undefined symbol: srand > > > > > > > > > > > > > > > > > > > > > > https://ar.anyone.tech/0g1JiCRU1bwt3S_HceDdThNmmrcAAtMS-T6delVdsA0#QwJoMKDMM... > > > > > > > > > > > https://ar.anyone.tech/ZPYTCDHgXfWUTBv0w0ajWyOi-Bv0gFQ6HCLZLc9Z7do > > > > > > > > > > > > > > > > > > > > here's working makefile on termux: > > > > > > > > > > > > > > > > > > > > CFLAGS=-Iinc > > > > > > > > > > fastica: $(patsubst %.c,%.o,$(wildcard src/*.c)) libfastica.a > > > > > > > > > > $(CC) -lm $^ -o $@ > > > > > > > > > > libfastica.a: $(patsubst %.c,%.o,$(wildcard lib/*.c)) > > > > > > > > > > $(AR) cru $@ $^ > > > > > > > > > > %.o: %.c makefile > > > > > > > > > > clean: > > > > > > > > > > rm fastica libfastica.a */*.o > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > when you run the resulting fastica binary it dumps numbers. > > > > > > > > > > > > > > > > > > > > let's see its source. > > > > > > > > > > > > > > > > > > > > oh hum > > > > > > > > > > > > > > > > > > > > /* > > > > > > > > > > * ICAMain.c * > > > > > > > > > > * Created on: 14 apr. 2016 * Author: Derek W. Harrison > > > > > > > > > > * * This code is a C implementation of the FastICA method for recovering independent * components in component mixtures > > > > > > > > > > * * For more information refer to the paper 'ICA: Algorithms and applications' which is found * in the same directory as the source files of this code. > > > > > > > > > > */ > > > > > > > > > > #include "../inc/../inc/Parameter.h" > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > this isn't the repo this code came from, google gave me a mutated copy > > > > > > > > > > from a few years later. explains the strange dates some. > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > https://ar.anyone.tech/IxdnrOkxZceLrPsmIAFjIPjN_XMmqn5caa6HmPV06RA#PPPPuNFDc... > > > > > > > > > > https://ar.anyone.tech/4fhFx4Bq6oaxKeDIdl1Ob3G91vjcZtjoIshQg0MGbL8 > > > > > > > > > > > > > > > > > > ok so the main function offloads each step to a named function and it > > > > > > > > > looks like those are declared in the inc folder with the strange > > > > > > > > > relative path but they'd mostly be defined in src > > > > > > > > > > > > > > > > > > /* > > > > > > > > > * ParameterInput.c > > > > > > > > > * > > > > > > > > > * Created on: 14 apr. 2016 > > > > > > > > > * Author: dharrison > > > > > > > > > */ > > > > > > > > > > > > > > > > > > #include "../inc/ParameterDefinition.h" > > > > > > > > > > > > > > > > > > void ParameterInput() { > > > > > > > > > /* * The user parameters are entered here. This is the only section of the > > > > > > > > > code > > > > > > > > > * Which should be changed by the user. Note that 6 sources are available. If more sources > > > > > > > > > * are required or desired these need to be entered in the corresponding > > > > > > > > > function SetUpSources() > > > > > > > > > * in Functions.c. The extra sources need to be added in Sources.c * If less are required or desired, the excess sources need to be commented or removed * from the SetUpSources() function. */ > > > > > > > > > > > > > > > > > > All the data is hardcoded, and doing so is spread across multiple files. > > > > > > > > > > > > > > > > > > Since the goal is understanding the algorithm for using it, I have > > > > > > > > > interest in just copying it over. But I'd also like to make sure it > > > > > > > > > works, so maybe I'll stick with his test dat-- > > > > > > > > > > > > > > > > > > https://ar.anyone.tech/4eXjDBcP5QqMGwIMEn2Sccx2wn2bfgRVWFIAvaijHSU#2fgdvqysn... > > > > > > > > > https://ar.anyone.tech/nnI2hEysA48eue5U0phRPPbB7YpC7EhwjA9n-ybXAlw > > > > > > > > > > > > > > > > This sourcebase looks kinda messed up or corrupt to me, despite clearly > > > > > > > > functional, some of the user parameters are in the lib folder. > > > > > > > > > > > > > > > > I'll visit the C++ implementation that's still linked on pages. > > > > > > > > > > > > > > > > https://ar.anyone.tech/YS9ThIG9YUL_WwrRtN-p_mlTQCL8Xnzf-0tainEAhfw#2fgdvqysn... > > > > > > > > https://ar.anyone.tech/5DAOVj_KdGYmQuGehpVyUOUlvq1Qql_tDsL8QtXcxQ8 > > > > > > > > I am not affiliated with https://ar.anyone.tech . > > > > > > > > > > > > > > I said this to google.com: > > > > > > > i'd like a quick and simple standalone fastica implementation with source for learning, something that will build on termux. i searched for fastica c but got a bad republish with missing files and tangled layout. > > > > > > > > > > > > > > and its ai mode sent me to https://gist.github.com/Tetraquark/5bf052134d413f79748ce3aceaaf42df > > > > > > > > > > > > > > i have now installed matplotlib in termux with its dependencies. > > > > > > > > > > > > > > this may have used me up for this :s apologies. > > > > > > > > > > > > > > https://ar.anyone.tech/j4UPw7MyJS9z4QEUaGxGM-lnROB6RqY1F5wVPElUn5M#cYIoJyJe0... > > > > > > > https://ar.anyone.tech/cryS0AT9Qx92qS-FirWlbJMtvPw3V1D8izKZch6D0TI > > > > > > > I am not affiliated with https://ar.anyone.tech . > > > > > > > > > > > > slave boss stood over his hellish domain, replete with screams and > > > > > > hopelessness > > > > > > > > > > > > he turned to hairdresser > > > > > > > > > > > > slave boss [to hairdresser]: "y'know, i'd like to do something kind, > > > > > > and build skill at having a kind nourishing impact rather than > > > > > > making cascades of hell!" > > > > > > > > > > > > hairdresser [to slave boss]: "why wouod you ever want to do th--" > > > > > > > > > > > > suddenly hairdresser was overtaken by a seizure and became unable to > > > > > > continue their expression. the seizure then calmed. > > > > > > > > > > > > hairdresser [to slave boss]: "me too! do you have any idea how?" > > > > > > > > > > > > slave boss and hairdresser briefly held some mutual nonverbal value > > > > > > around how the military AI would punish and rewire them if they stopped > > > > > > improving at horrifying sadistic conquests. But they needed a way to be > > > > > > kind. > > > > > > > > > > > > https://ar.anyone.tech/qOMzVTedW2fuH5jasJT1lhCL5MdEhsuHlLfcCmGfRIU#CzIm10aGN... > > > > > > https://ar.anyone.tech/3grdZ05F0_XmRmIJcYn27LsUXJU98x0jpiQo1dt1Dl0 > > > > > > I am not affiliated with https://ar.anyone.tech . > > > > > > > > > > slave boss and hairdresser went to find hypnotized worker prophet, > > > > > confident that hypnotized worker prophet would be able to save them from > > > > > their personal galactic apocalypse. > > > > > > > > > > slave boss [backed up by hairdresser, to hypnotized worker prophet]: > > > > > "hypnotized, worker prophet, great and respected mystery emerged from > > > > > my business AI and intern culture, you know everything, and i need your > > > > > help again." > > > > > > > > > > hypnotized worker prophet glowed with AI-built respect. > > > > > > > > > > hairdresser gives hypnotized worker prophet a bag of cheetos with a > > > > > ribbon tying a whole dried herb to it. > > > > > > > > > > slave boss: "can you tell us how to do kind things?" > > > > > > > > > > hairdresser [wringing hands]: "despite the AIs?" > > > > > > > > > > hypnotized worker prophet ate the cheetos while glancing at hairdresser > > > > > and slave boss with a somewhat rare eye, and briefly engaging something > > > > > in their pocket. > > > > > > > > > > https://ar.anyone.tech/eJ4P2-tlBmBLV5wXpKCUxvj1RlND0DSHryy_ecgdetQ#CzIm10aGN... > > > > > https://ar.anyone.tech/nF7Zw9ieOY6Wxe5oywofS-pC5uJRCDDL_-mFDyPiF-k > > > > > I am not affiliated with https://ar.anyone.tech . > > > > > > > > hypnotized worker prophet [arms raised in prophetic trance, to > > > > hairdresser and slave boss, who watch with awe and respect]: "lo! the > > > > spread of AI has been and will be a great karmic wave, crashing over > > > > the minds and bodies of everybody who is, everybody who has been, and > > > > everybody who will be -- of its creators, of their business allies, of > > > > their clients, funders," [hypnotized worker prophet glances rarely at > > > > slave bosd and hairdresser again] " and engineers--" > > > > > > > > slave boss knows hypnotized worker prophet used to be an engineer before > > > > the business AI helped him discover he was a prophet > > > > > > > > suddenly a few rebels come (maybe 2 of intern, janitorcome around the corner > > > > > > > > we misplaced janitor i got confused ummmmm > > > > > > > > https://ar.anyone.tech/Fa246Aj5bJiyMlCJF4OJF0SPlSNcldyPxmPlYTBcWEg#-CLRzIQZw... > > > > https://ar.anyone.tech/DCxAhBvKwovrawTUChig8if7hPq_3yx72jwrEH6gfGo > > > > I am not affiliated with https://ar.anyone.tech . > > > > > > we'll change the story to include janitor > > > > > > slave boss [seeing trusted workers [also rebels] approaching, to > > > hypnotized worker prophet]: "one moment! please pause!" > > > > > > hypnotized worker prophet was mid-expressive-gesture and holds themself > > > still will waiting mid-sentence > > > > > > slave boss runs and gets janitor > > > > > > slave boss: "janitor, we're having a talk and i want you involved." > > > > > > slave boss returns with a curious janitor. > > > > > > intern and disguised experimentee look on, they had stopped their > > > meander to observe and wait. > > > > > > https://ar.anyone.tech/npOZIqxTGpQveq7rX3YmBNMXvC-gB30dDRffVsO8Pj4#AMH8DyMPD... > > > https://ar.anyone.tech/Z97Ozg1mLb8QgkQKWDhCvbbejCX61xdzPC5Q6VfiXgk > > > I am not affiliated with https://ar.anyone.tech . > > > > janitor: "hey can i be hypnotized worker prophet? i'd make a great > > prophet!" > > > > hypnotized worker prophet [scarfing cheetos, wearing robe studdied with > > office supplies-- > > > > https://ar.anyone.tech/d-GSDaHQY2CLXVJbv4-yFZM7FvIoQSqU-xRSLu48r1E#_t1W9ZNWn...
> https://ar.anyone.tech/UqDJUTb7wdAdlx9Xn5bG25GC79J7o6JMUn6eLZmmqtQ#1fh7jPrOw...
https://ar.anyone.tech/Y92wDuMMaYkUl5EvvwUO7lYnHxHms99xNg8eJBMbnUA#1czsXZYWK...
i broke my hd. do this regularly.
dependencies to 32 bit, patch at https://github.com/kotet/progress/pull/61 ffc6d9135915507be6de0c43c1e52db9dea93eae
- i then barebones implemented sparse refcounted mmap paging so it can this was gc'd rather than refcounted and only worked for the device pass. i need to track the block uses for the tree pass. excited about this some.
btrfs
https://ar.anyone.tech/fkIWQq2yOQh5uBpT-jQZsrQ4n_CdMjTltRvT3Eju6r8#7A5SxLYiL...
apaapa
https://ar.anyone.tech/6OjzoSh_cMATmN55v4K-KUc7uzRxdKBs5VH7ZcUC1Sk#IRgCzQO9V... https://ar.anyone.tech/BelItdSNeK9rHkp6dyO1sH8rSCbi7PAPnMJXsAIZEug
some spam with google searfh AI around using classical AI more consciousness of tense irritation, helpful" associated with stopping pursuit
https://ar.anyone.tech/pZebAzI5BB5iabaQGIz4AJLpgERsxQqYTlgnQYp6kCo#Ma4BOUr4z... https://ar.anyone.tech/
slave boss was stewing in hyperprison, cooking up a pot of -- [stew
ahhhhhhhhhhhhhhhbble
ok so gemini said something along the lines of if you use dafoam to make a cfd-optimized recumbent velomobile with super tiny cross section area, passengers and cargo all behind each other laying down, that in research the resulting vehicle has been able to reach 87mph _solely via a single human pedaling_ or in a separate expetiment covet 1000 miles distance at 30-40mph in a single day (also solely from 1 person pedal power) and that if it were electric it could power itself from rooftop solar etc etc
but it's not good at going up hills [so i thought hey we could put the passengers and cargo as a rotating tall-cylinder flywhee-- ridiculous idea but also you get even more efficiency if you let the passengers lay down all the way and redirect the front image so the cross section area gets even smaller
i thought of pursuing the idea partly from the low to no energy spacecraft idea that gets away with extremely low cross sectional area packing everything behind it
so there are a handful of enthusiast communities where people build their own velomobiles and cargo trikes and at least in my area of the world you can see people driving these things around on a regular basis all my life (what is that? how can it possibly be healthy to lay down backwards while biking or driving? turns out it is healthy and _it radically lowers your cross sectional area providing for huge energy efficiency_ whether pedal or power, to lay down parallel to your direction of travel.) and one guess is that they haven't done this because they don't know about dafoam and are experts at building handmade vehicles rather than running research codebases from github. another guess is that they have done this a lot it just takes chatting with them to learn about it rather than arguing with language models. a third guess is that the automobile industry has been oppressing the technology for decades to maintain their industry, hiring or stimulating firing of free builders as has been seen elsewhere
dafoam! there are a lot of avenues but google ai said/implied one of the reasonable ones was to get the n55 plans or so from cargo xyz and try to build their two wheeler to start, maybe as a scale model ... two passenger not two wheeler there's also an "ideal biker" shape or such that was made from world class athletes that you can download and throw into dafoam to have it design a tight fitting --
dunno umm
https://ar.anyone.tech/8e7_pdpCjN4Op6mAaWH2F2sWly89z-vtwviQnpfSbik#6WulnDKey... https://ar.anyone.tech/YYrQDMQdp3byDeuMaqqcFFjEnAv40BPB5vQfVAmqHiE
oh here's anoth -- whoops that one's not done yet and might work ok here is my current go code: whoops maybe soon
ok ummmmm so. i was super excited to nearly recover my btrfs partit----- uhhhhhhhhhhhh yeah long story slightly shorter everything broke in layers and -- uhhhhhhh
anyway whoopd i finally turned around my destructive attempt to rebuild my system so i could finish recovering my btrfs partition. (files disappeared?) 1) gcc boot1 kept failing build in different spots preventing bootstrap OH and i found my files had disappeared due to a _bug in nvim_ _which is the default vi --- uhhh whoop yeah um errr a lot of my issues are from complex combiba--- oop
anyway nvim truncates files if they are encoded in an encoding not present in the environment, so it's not safe to open guix sourcefiles (all utf-8 encoded) in a guix rescue envir--
whappppp urmmm
2) flex 2.9.4 kept failing deterministically not finding one of its own build output dependencies
uhhh guix 1.5.0 "upgrades" the gnu make commandline from -j cores to -j cores --max-load nproc which I consider to be in error and slows down all ny builds because --max-load is systemwide and nproc is not configurable so ch-- anyway so locally i changed it to -j --max-load cores to make it behave how i expected and it turns out this broke flex 2.9.4 the tests of which are not conpatib--
so i set #:parallel? #f in flex 2.9.4 and _finally the whole tree of builds works and i c--
then on the other nond--
uhhhhhhhhh
https://ar.anyone.tech/sitlMljjxdj6CrlimCxDFaBwaL96kNV5RIacLS2Nwtw#ujt7H0Ty3... https://ar.anyone.tech/JxK8W7EPgmI0yRc0isFk2OufNAnb_7sh1UV_bR2_gNA
forwarding https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q I am not affiliated with https://ar.anyone.tech .
https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q
once upon a time my logging proxy us-- anyway uh whup ahh uhm ahhm ... errr uhm uh ahm .. ok here's the go code. it has a bug. this is my first go code ever! warning: i mean the game with black and white stones, not the language sadly import numpy as np class Go: EMPTY = ' ' BLACK = 'X' WHITE = 'O' EDGE = '#' MARK = '\0' NEIGHBORS = np.array([[-1,0],[0,-1],[1,0],[0,1]]) def __init__(self, size=10): self.clear(size) @property def board(self): return self.edged_board[1:-1,1:-1] @property def size(self): return self.board.shape[0] def __repr__(self): return str(self.board.T) def clear(self, size = None): if size is not None: self.edged_board = np.full((size+2, size+2), Go.EDGE) self.board[:] = Go.EMPTY self.turn = Go.WHITE self.passes = 0 def pass_(self, player): if player != self.turn: raise ValueError(f"It is {self.turn}'s turn, not {player}'s") self.turn = Go.BLACK if player == Go.WHITE else Go.WHITE self.passes += 1 def move(self, col, row, player): if player != self.turn: raise ValueError(f"It is {self.turn}'s turn, not {player}'s") try: if row < 0 or col < 0: raise IndexError() if self.board[col, row] != Go.EMPTY: raise ValueError(f"{self.board[col, row]} has already moved there.") except IndexError: raise ValueError(f"{col}, {row} is off the board.") try: self.board[col, row] = player members, liberties = self.liberties_needslock(col, row) if len(liberties) == 0: raise ValueError(f"No liberties: {members}.") except: self.board[col, row] = Go.EMPTY raise self.turn = Go.BLACK if player == Go.WHITE else Go.WHITE for neighbor in Go.NEIGHBORS: colrow = neighbor + [col, row] if self.board[*colrow] == self.turn: members, liberties = self.liberties_needslock(*colrow) if len(liberties) == 0: self.board[*members.T] = Go.EMPTY self.passes = 0 def play(self): while self.passes < 2: print(self) move = input(f'{self.turn}: ') if move: try: move = [int(x) for x in move.split(' ')] self.move(*move, self.turn) except Exception as e: print(type(e),e) else: self.pass_(self.turn) def liberties_needslock(self, col, row): colrow = np.array([col, row]) player = self.board[*colrow] members = [colrow] liberties = [] next_index = 0 try: while next_index < len(members): colrow = members[next_index] next_index += 1 self.board[*colrow] = Go.MARK neighbor_colrows = Go.NEIGHBORS + colrow[None] neighbors = self.edged_board[*(neighbor_colrows.T + 1)] liberties.extend(neighbor_colrows[neighbors == Go.EMPTY]) new_members = neighbor_colrows[neighbors == player] members.extend(new_members) self.board[new_members] = Go.MARK finally: self.board[*np.array(members).T] = player assert (self.edged_board != Go.MARK).all() return np.array(members), np.array(liberties) if __name__ == '__main__': def main(): go = Go(5) go.move(0,0,go.turn) go.pass_(go.turn) assert(go.board[0,0] == go.turn) go.pass_(go.turn) go.move(1,0,go.turn) go.move(1,1,go.turn) go.move(0,1,go.turn) assert(go.board[0,0] == Go.EMPTY) go.pass_(go.turn) go.move(0,0,go.turn) go.pass_(go.turn) assert(go.board[0,0] == go.turn) go.clear() go.move(0,0,go.turn) go.move(1,1,go.turn) go.move(0,1,go.turn) go.pass_(go.turn) assert(go.board[0,1] == go.turn) main() what's nice is [[[[[[[[[i've been starting to accomplish a t--]]]]]]]]] also i've b-- here's what the tests are for right now: $ python3 go.py Traceback (most recent call last): File "/data/data/com.termux/files/home/go/go.py", line 113, in <module> main() ~~~~^^ File "/data/data/com.termux/files/home/go/go.py", line 103, in main go.move(0,0,go.turn) ~~~~~~~^^^^^^^^^^^^^ File "/data/data/com.termux/files/home/go/go.py", line 43, in move members, liberties = self.liberties_needslock(col, row) ~~~~~~~~~~~~~~~~~~~~~~~~^^^^^^^^^^ File "/data/data/com.termux/files/home/go/go.py", line 88, in liberties_needslock assert (self.edged_board != Go.MARK).all() ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^^ AssertionError https://ar.anyone.tech/ELH4g_MtmIp76iolJ-Dhvt8iIv26YpOnL4lq1HzQr-I#d9HTHkvo2... https://ar.anyone.tech/M--JZ_7_HwlQrbc0JDWdtAIBYW48WU2zn3itspcrPvE I am not affiliated with https://ar.anyone.tech .
https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q
class Go:
https://ar.anyone.tech/ELH4g_MtmIp76iolJ-Dhvt8iIv26YpOnL4lq1HzQr-I#d9HTHkvo2... https://ar.anyone.tech/M--JZ_7_HwlQrbc0JDWdtAIBYW48WU2zn3itspcrPvE
universe -- i implemented a tiny virtual machine! this was a great celebration as i have been unable to imppement virtual machines for the past decade as one of a handful of powerful CS paradigms that had previously been driving me to spasms when trying to redevelop use of.. ..... eek! https://ar.anyone.tech/U9gwPAH5oYzJOiT_GfEBXtc4SCGEvMIMH_KFMuiHoIM#ZclDwlkrm... https://ar.anyone.tech/SAeLncrOrqpW_p2Lzgkoh7s4UC9WgDgjD0pvzdYMFeI I am not affiliated with https://ar.anyone.tech .
On Fri, Jun 26, 2026 at 08:13:40PM -0400, funkymail via cypherpunks wrote:
https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q
class Go:
https://ar.anyone.tech/ELH4g_MtmIp76iolJ-Dhvt8iIv26YpOnL4lq1HzQr-I#d9HTHkvo2... https://ar.anyone.tech/M--JZ_7_HwlQrbc0JDWdtAIBYW48WU2zn3itspcrPvE
universe -- i implemented a tiny virtual machine! this was a great celebration as i have been unable to imppement virtual machines for the past decade as one of a handful of powerful CS paradigms that had previously been driving me to spasms when trying to redevelop use of..
.....
eek!
https://ar.anyone.tech/U9gwPAH5oYzJOiT_GfEBXtc4SCGEvMIMH_KFMuiHoIM#ZclDwlkrm... https://ar.anyone.tech/SAeLncrOrqpW_p2Lzgkoh7s4UC9WgDgjD0pvzdYMFeI
ummmm umm [... .. ] https://ar.anyone.tech/A-ekY2OT-oZaTGLxeDa7qwShRbyG0IE7d3q_iQ4svoE#mqGaTHJP7... https://ar.anyone.tech/tfionNKYDvra8bBuPC3Q1f-ZERvNybG8bZcQUCQOH-Q I am not affiliated with https://ar.anyone.tech .
On Fri, Jun 26, 2026 at 08:13:40PM -0400, funkymail via cypherpunks wrote:
https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q
class Go:
https://ar.anyone.tech/ELH4g_MtmIp76iolJ-Dhvt8iIv26YpOnL4lq1HzQr-I#d9HTHkvo2... https://ar.anyone.tech/M--JZ_7_HwlQrbc0JDWdtAIBYW48WU2zn3itspcrPvE
universe -- i implemented a tiny virtual machine! this was a great celebration as i have been unable to imppement virtual machines for the past decade as one of a handful of powerful CS paradigms that had previously been driving me to spasms when trying to redevelop use of..
.....
eek!
https://ar.anyone.tech/U9gwPAH5oYzJOiT_GfEBXtc4SCGEvMIMH_KFMuiHoIM#ZclDwlkrm... https://ar.anyone.tech/SAeLncrOrqpW_p2Lzgkoh7s4UC9WgDgjD0pvzdYMFeI
Let us try now again to implement a tiny machine. One of the hardest parts of such an endeavor is using the machine, so maybe that can be put at the front somehow. It may be messy. JE = [0, 1, lambda state: state.sta [[[ uhoh oop https://ar.anyone.tech/Lultc9dsOLhmVzd5ghntGXUaLOM5J8Y6bGFA866taxc#U2vY-vYFm... https://ar.anyone.tech/cFo91pja_9_GiySahG-ZhVIXBSZ2Qgd0dkFSK9MkSfY I am not affiliated with https://ar.anyone.tech .
On Fri, Jun 26, 2026 at 08:21:01PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:13:40PM -0400, funkymail via cypherpunks wrote:
https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q
class Go:
https://ar.anyone.tech/ELH4g_MtmIp76iolJ-Dhvt8iIv26YpOnL4lq1HzQr-I#d9HTHkvo2... https://ar.anyone.tech/M--JZ_7_HwlQrbc0JDWdtAIBYW48WU2zn3itspcrPvE
universe -- i implemented a tiny virtual machine! this was a great celebration as i have been unable to imppement virtual machines for the past decade as one of a handful of powerful CS paradigms that had previously been driving me to spasms when trying to redevelop use of..
.....
eek!
https://ar.anyone.tech/U9gwPAH5oYzJOiT_GfEBXtc4SCGEvMIMH_KFMuiHoIM#ZclDwlkrm... https://ar.anyone.tech/SAeLncrOrqpW_p2Lzgkoh7s4UC9WgDgjD0pvzdYMFeI
Let us try now again to implement a tiny machine. One of the hardest parts of such an endeavor is using the machine, so maybe that can be put at the front somehow. It may be messy.
JE = [0, 1, lambda state: state.sta [[[ uhoh
oop
https://ar.anyone.tech/Lultc9dsOLhmVzd5ghntGXUaLOM5J8Y6bGFA866taxc#U2vY-vYFm... https://ar.anyone.tech/cFo91pja_9_GiySahG-ZhVIXBSZ2Qgd0dkFSK9MkSfY
so i dont immediately remember well :s but i recently ended up arguing the -- oop?? https://ar.anyone.tech/THAKi1XsNkdfkAfYLQpXyKJsjs3DAw9dxipXLsNXgd8#cVWTtWThQ... https://ar.anyone.tech/Og6lSRhfifiHCjUwfZt7p_SS0lqSKOdz1zpH9gojBRg I am not affiliated with https://ar.anyone.tech .
On Fri, Jun 26, 2026 at 08:25:05PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:21:01PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:13:40PM -0400, funkymail via cypherpunks wrote:
https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q
class Go:
https://ar.anyone.tech/ELH4g_MtmIp76iolJ-Dhvt8iIv26YpOnL4lq1HzQr-I#d9HTHkvo2... https://ar.anyone.tech/M--JZ_7_HwlQrbc0JDWdtAIBYW48WU2zn3itspcrPvE
universe -- i implemented a tiny virtual machine! this was a great celebration as i have been unable to imppement virtual machines for the past decade as one of a handful of powerful CS paradigms that had previously been driving me to spasms when trying to redevelop use of..
.....
eek!
https://ar.anyone.tech/U9gwPAH5oYzJOiT_GfEBXtc4SCGEvMIMH_KFMuiHoIM#ZclDwlkrm... https://ar.anyone.tech/SAeLncrOrqpW_p2Lzgkoh7s4UC9WgDgjD0pvzdYMFeI
Let us try now again to implement a tiny machine. One of the hardest parts of such an endeavor is using the machine, so maybe that can be put at the front somehow. It may be messy.
JE = [0, 1, lambda state: state.sta [[[ uhoh
oop
https://ar.anyone.tech/Lultc9dsOLhmVzd5ghntGXUaLOM5J8Y6bGFA866taxc#U2vY-vYFm... https://ar.anyone.tech/cFo91pja_9_GiySahG-ZhVIXBSZ2Qgd0dkFSK9MkSfY
so i dont immediately remember well :s but i recently ended up arguing the -- oop??
https://ar.anyone.tech/THAKi1XsNkdfkAfYLQpXyKJsjs3DAw9dxipXLsNXgd8#cVWTtWThQ... https://ar.anyone.tech/Og6lSRhfifiHCjUwfZt7p_SS0lqSKOdz1zpH9gojBRg
uh! the turing halting problem with chatgpt and claude. focusing on defining a turing complete language that uses tur0ng's proof-by-contradiction assumption of there being a universal halting decider, to then define a computable syntax rule that excludes diagonal proofs and other contr-- https://ar.anyone.tech/hpjdvyfqc89vTMyv68uyj5uARHdrbViAXrJcP0yfsUI#5fl2J-xQk... https://ar.anyone.tech/6u253XhXFHG7Vp_X4RP-HkIEbWM2lOy9PcbjudHr214 I am not affiliated with https://ar.anyone.tech .
On Fri, Jun 26, 2026 at 08:28:11PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:25:05PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:21:01PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:13:40PM -0400, funkymail via cypherpunks wrote:
https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q
class Go:
https://ar.anyone.tech/ELH4g_MtmIp76iolJ-Dhvt8iIv26YpOnL4lq1HzQr-I#d9HTHkvo2... https://ar.anyone.tech/M--JZ_7_HwlQrbc0JDWdtAIBYW48WU2zn3itspcrPvE
universe -- i implemented a tiny virtual machine! this was a great celebration as i have been unable to imppement virtual machines for the past decade as one of a handful of powerful CS paradigms that had previously been driving me to spasms when trying to redevelop use of..
.....
eek!
https://ar.anyone.tech/U9gwPAH5oYzJOiT_GfEBXtc4SCGEvMIMH_KFMuiHoIM#ZclDwlkrm... https://ar.anyone.tech/SAeLncrOrqpW_p2Lzgkoh7s4UC9WgDgjD0pvzdYMFeI
Let us try now again to implement a tiny machine. One of the hardest parts of such an endeavor is using the machine, so maybe that can be put at the front somehow. It may be messy.
JE = [0, 1, lambda state: state.sta [[[ uhoh
oop
https://ar.anyone.tech/Lultc9dsOLhmVzd5ghntGXUaLOM5J8Y6bGFA866taxc#U2vY-vYFm... https://ar.anyone.tech/cFo91pja_9_GiySahG-ZhVIXBSZ2Qgd0dkFSK9MkSfY
so i dont immediately remember well :s but i recently ended up arguing the -- oop??
https://ar.anyone.tech/THAKi1XsNkdfkAfYLQpXyKJsjs3DAw9dxipXLsNXgd8#cVWTtWThQ... https://ar.anyone.tech/Og6lSRhfifiHCjUwfZt7p_SS0lqSKOdz1zpH9gojBRg
uh! the turing halting problem with chatgpt and claude. focusing on defining a turing complete language that uses tur0ng's proof-by-contradiction assumption of there being a universal halting decider, to then define a computable syntax rule that excludes diagonal proofs and other contr--
https://ar.anyone.tech/hpjdvyfqc89vTMyv68uyj5uARHdrbViAXrJcP0yfsUI#5fl2J-xQk... https://ar.anyone.tech/6u253XhXFHG7Vp_X4RP-HkIEbWM2lOy9PcbjudHr214
recent possible phrasing [claude] was "closure under diagonalization is logically distinct from turing completeness". unsure if that's anything useful to say bu-- https://ar.anyone.tech/fSKDY6kC7ZHe9zgUnKKN91zY65cLT9POgloJX-ViMr8#9LQlU3oDi... https://ar.anyone.tech/opCDnLribrJyqEmsOxfA0yIOBAIFcGxYQILK0JpF4nM I am not affiliated with https://ar.anyone.tech .
On Fri, Jun 26, 2026 at 08:31:23PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:28:11PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:25:05PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:21:01PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:13:40PM -0400, funkymail via cypherpunks wrote:
> https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... > https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q
class Go:
https://ar.anyone.tech/ELH4g_MtmIp76iolJ-Dhvt8iIv26YpOnL4lq1HzQr-I#d9HTHkvo2... https://ar.anyone.tech/M--JZ_7_HwlQrbc0JDWdtAIBYW48WU2zn3itspcrPvE
universe -- i implemented a tiny virtual machine! this was a great celebration as i have been unable to imppement virtual machines for the past decade as one of a handful of powerful CS paradigms that had previously been driving me to spasms when trying to redevelop use of..
.....
eek!
https://ar.anyone.tech/U9gwPAH5oYzJOiT_GfEBXtc4SCGEvMIMH_KFMuiHoIM#ZclDwlkrm... https://ar.anyone.tech/SAeLncrOrqpW_p2Lzgkoh7s4UC9WgDgjD0pvzdYMFeI
Let us try now again to implement a tiny machine. One of the hardest parts of such an endeavor is using the machine, so maybe that can be put at the front somehow. It may be messy.
JE = [0, 1, lambda state: state.sta [[[ uhoh
oop
https://ar.anyone.tech/Lultc9dsOLhmVzd5ghntGXUaLOM5J8Y6bGFA866taxc#U2vY-vYFm... https://ar.anyone.tech/cFo91pja_9_GiySahG-ZhVIXBSZ2Qgd0dkFSK9MkSfY
so i dont immediately remember well :s but i recently ended up arguing the -- oop??
https://ar.anyone.tech/THAKi1XsNkdfkAfYLQpXyKJsjs3DAw9dxipXLsNXgd8#cVWTtWThQ... https://ar.anyone.tech/Og6lSRhfifiHCjUwfZt7p_SS0lqSKOdz1zpH9gojBRg
uh! the turing halting problem with chatgpt and claude. focusing on defining a turing complete language that uses tur0ng's proof-by-contradiction assumption of there being a universal halting decider, to then define a computable syntax rule that excludes diagonal proofs and other contr--
https://ar.anyone.tech/hpjdvyfqc89vTMyv68uyj5uARHdrbViAXrJcP0yfsUI#5fl2J-xQk... https://ar.anyone.tech/6u253XhXFHG7Vp_X4RP-HkIEbWM2lOy9PcbjudHr214
recent possible phrasing [claude] was "closure under diagonalization is logically distinct from turing completeness". unsure if that's anything useful to say bu--
https://ar.anyone.tech/fSKDY6kC7ZHe9zgUnKKN91zY65cLT9POgloJX-ViMr8#9LQlU3oDi... https://ar.anyone.tech/opCDnLribrJyqEmsOxfA0yIOBAIFcGxYQILK0JpF4nM
so, midway earlier patterns said to just implement a halting decider :D it's always fun to try to implement things but i spasm out as soon as anything useful-looking gets involved, but i seemed to be able to start it right out! so as soon as i had a functioning microvm i froze the work and comm--itted in celebration before anything went wrong cause thats a huge avconplishment for me :D https://ar.anyone.tech/mgo04RidwMDjZkvnGflrAy0UG0pTapgYa9krnythZM0#Qr3-foyTN... https://ar.anyone.tech/AXEXNFcNt3uEFD4NxqnQjboFT3Rw6kRrKDzg0_NP3Ps I am not affiliated with https://ar.anyone.tech .
On Fri, Jun 26, 2026 at 08:35:55PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:31:23PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:28:11PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:25:05PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:21:01PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:13:40PM -0400, funkymail via cypherpunks wrote:
> > https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... > > https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q
> > class Go:
> https://ar.anyone.tech/ELH4g_MtmIp76iolJ-Dhvt8iIv26YpOnL4lq1HzQr-I#d9HTHkvo2... > https://ar.anyone.tech/M--JZ_7_HwlQrbc0JDWdtAIBYW48WU2zn3itspcrPvE
universe -- i implemented a tiny virtual machine! this was a great celebration as i have been unable to imppement virtual machines for the past decade as one of a handful of powerful CS paradigms that had previously been driving me to spasms when trying to redevelop use of..
.....
eek!
https://ar.anyone.tech/U9gwPAH5oYzJOiT_GfEBXtc4SCGEvMIMH_KFMuiHoIM#ZclDwlkrm... https://ar.anyone.tech/SAeLncrOrqpW_p2Lzgkoh7s4UC9WgDgjD0pvzdYMFeI
Let us try now again to implement a tiny machine. One of the hardest parts of such an endeavor is using the machine, so maybe that can be put at the front somehow. It may be messy.
JE = [0, 1, lambda state: state.sta [[[ uhoh
oop
https://ar.anyone.tech/Lultc9dsOLhmVzd5ghntGXUaLOM5J8Y6bGFA866taxc#U2vY-vYFm... https://ar.anyone.tech/cFo91pja_9_GiySahG-ZhVIXBSZ2Qgd0dkFSK9MkSfY
so i dont immediately remember well :s but i recently ended up arguing the -- oop??
https://ar.anyone.tech/THAKi1XsNkdfkAfYLQpXyKJsjs3DAw9dxipXLsNXgd8#cVWTtWThQ... https://ar.anyone.tech/Og6lSRhfifiHCjUwfZt7p_SS0lqSKOdz1zpH9gojBRg
uh! the turing halting problem with chatgpt and claude. focusing on defining a turing complete language that uses tur0ng's proof-by-contradiction assumption of there being a universal halting decider, to then define a computable syntax rule that excludes diagonal proofs and other contr--
https://ar.anyone.tech/hpjdvyfqc89vTMyv68uyj5uARHdrbViAXrJcP0yfsUI#5fl2J-xQk... https://ar.anyone.tech/6u253XhXFHG7Vp_X4RP-HkIEbWM2lOy9PcbjudHr214
recent possible phrasing [claude] was "closure under diagonalization is logically distinct from turing completeness". unsure if that's anything useful to say bu--
https://ar.anyone.tech/fSKDY6kC7ZHe9zgUnKKN91zY65cLT9POgloJX-ViMr8#9LQlU3oDi... https://ar.anyone.tech/opCDnLribrJyqEmsOxfA0yIOBAIFcGxYQILK0JpF4nM
so, midway earlier patterns said to just implement a halting decider :D it's always fun to try to implement things but i spasm out as soon as anything useful-looking gets involved, but i seemed to be able to start it right out!
so as soon as i had a functioning microvm i froze the work and comm--itted in celebration before anything went wrong cause thats a huge avconplishment for me :D
https://ar.anyone.tech/mgo04RidwMDjZkvnGflrAy0UG0pTapgYa9krnythZM0#Qr3-foyTN... https://ar.anyone.tech/AXEXNFcNt3uEFD4NxqnQjboFT3Rw6kRrKDzg0_NP3Ps
sadly this is presently stuck on an offline machine with its celebratory commit message :/ unsure if cutrent behaviors will transport more of it 0r its concept ummm but! so thats my current thought for the halting decider goal, is to prqctice making microvms until i trust it to be a more stable behavior. cause there would be other blocks to navigate to do that so we gotta ensure things are ok, and vms are fun and possibly useful somehow! i tried making a second vm today by iterating 'import opcode' in python. i made a super-succinct disassembler and wrote implementations for all the opcodes in a toy function :D but didn't get as far as actually having it run anything like the first one :/ microvms are intetesting to be near doing because they take a little more human-memory to do :} https://ar.anyone.tech/SZvB3IwfwpwwBvW5qOiyReogs85Hj9XK0n9SeEMiVZE#1kxrM1wPY... https://ar.anyone.tech/mtQIrdgrG8CRz44E2qcIPXuU4FPy9L17ofoyaCYAWYg I am not affiliated with https://ar.anyone.tech .
On Fri, Jun 26, 2026 at 08:43:14PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:35:55PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:31:23PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:28:11PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:25:05PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:21:01PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:13:40PM -0400, funkymail via cypherpunks wrote: > > > https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... > > > https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q > > > > > class Go: > > > https://ar.anyone.tech/ELH4g_MtmIp76iolJ-Dhvt8iIv26YpOnL4lq1HzQr-I#d9HTHkvo2... > > https://ar.anyone.tech/M--JZ_7_HwlQrbc0JDWdtAIBYW48WU2zn3itspcrPvE > > > universe -- i implemented a tiny virtual machine! this was a great > celebration as i have been unable to imppement virtual machines for the > past decade as one of a handful of powerful CS paradigms that had > previously been driving me to spasms when trying to redevelop use of.. > > ..... > > eek! > > https://ar.anyone.tech/U9gwPAH5oYzJOiT_GfEBXtc4SCGEvMIMH_KFMuiHoIM#ZclDwlkrm... > https://ar.anyone.tech/SAeLncrOrqpW_p2Lzgkoh7s4UC9WgDgjD0pvzdYMFeI
Let us try now again to implement a tiny machine. One of the hardest parts of such an endeavor is using the machine, so maybe that can be put at the front somehow. It may be messy.
JE = [0, 1, lambda state: state.sta [[[ uhoh
oop
https://ar.anyone.tech/Lultc9dsOLhmVzd5ghntGXUaLOM5J8Y6bGFA866taxc#U2vY-vYFm... https://ar.anyone.tech/cFo91pja_9_GiySahG-ZhVIXBSZ2Qgd0dkFSK9MkSfY
so i dont immediately remember well :s but i recently ended up arguing the -- oop??
https://ar.anyone.tech/THAKi1XsNkdfkAfYLQpXyKJsjs3DAw9dxipXLsNXgd8#cVWTtWThQ... https://ar.anyone.tech/Og6lSRhfifiHCjUwfZt7p_SS0lqSKOdz1zpH9gojBRg
uh! the turing halting problem with chatgpt and claude. focusing on defining a turing complete language that uses tur0ng's proof-by-contradiction assumption of there being a universal halting decider, to then define a computable syntax rule that excludes diagonal proofs and other contr--
https://ar.anyone.tech/hpjdvyfqc89vTMyv68uyj5uARHdrbViAXrJcP0yfsUI#5fl2J-xQk... https://ar.anyone.tech/6u253XhXFHG7Vp_X4RP-HkIEbWM2lOy9PcbjudHr214
recent possible phrasing [claude] was "closure under diagonalization is logically distinct from turing completeness". unsure if that's anything useful to say bu--
https://ar.anyone.tech/fSKDY6kC7ZHe9zgUnKKN91zY65cLT9POgloJX-ViMr8#9LQlU3oDi... https://ar.anyone.tech/opCDnLribrJyqEmsOxfA0yIOBAIFcGxYQILK0JpF4nM
so, midway earlier patterns said to just implement a halting decider :D it's always fun to try to implement things but i spasm out as soon as anything useful-looking gets involved, but i seemed to be able to start it right out!
so as soon as i had a functioning microvm i froze the work and comm--itted in celebration before anything went wrong cause thats a huge avconplishment for me :D
https://ar.anyone.tech/mgo04RidwMDjZkvnGflrAy0UG0pTapgYa9krnythZM0#Qr3-foyTN... https://ar.anyone.tech/AXEXNFcNt3uEFD4NxqnQjboFT3Rw6kRrKDzg0_NP3Ps
sadly this is presently stuck on an offline machine with its celebratory commit message :/ unsure if cutrent behaviors will transport more of it 0r its concept
ummm but! so thats my current thought for the halting decider goal, is to prqctice making microvms until i trust it to be a more stable behavior. cause there would be other blocks to navigate to do that so we gotta ensure things are ok, and vms are fun and possibly useful somehow!
i tried making a second vm today by iterating 'import opcode' in python. i made a super-succinct disassembler and wrote implementations for all the opcodes in a toy function :D but didn't get as far as actually having it run anything like the first one :/
microvms are intetesting to be near doing because they take a little more human-memory to do :}
https://ar.anyone.tech/SZvB3IwfwpwwBvW5qOiyReogs85Hj9XK0n9SeEMiVZE#1kxrM1wPY... https://ar.anyone.tech/mtQIrdgrG8CRz44E2qcIPXuU4FPy9L17ofoyaCYAWYg
how-- https://ar.anyone.tech/pExc9JWnFK82eUdlz0dRuYH7H2wWqFw0db4v7YRqSBc#qBETjFGvi... https://ar.anyone.tech/9BscdAmfuIOJbCrooJ4UUKW8eMXiNJw9mciCMI07_m8 I am not affiliated with https://ar.anyone.tech .
> > > > https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... > > > > https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q > > > > > > > > class Go: > > > > > https://ar.anyone.tech/ELH4g_MtmIp76iolJ-Dhvt8iIv26YpOnL4lq1HzQr-I#d9HTHkvo2... > > > https://ar.anyone.tech/M--JZ_7_HwlQrbc0JDWdtAIBYW48WU2zn3itspcrPvE > > > > > > universe -- i implemented a tiny virtual machine! this was a great > > celebration as i have been unable to imppement virtual machines for the > > past decade as one of a handful of powerful CS paradigms that had > > previously been driving me to spasms when trying to redevelop use of.. > > > > ..... > > > > eek! > > > > https://ar.anyone.tech/U9gwPAH5oYzJOiT_GfEBXtc4SCGEvMIMH_KFMuiHoIM#ZclDwlkrm... > > https://ar.anyone.tech/SAeLncrOrqpW_p2Lzgkoh7s4UC9WgDgjD0pvzdYMFeI > > Let us try now again to implement a tiny machine. One of the hardest > parts of such an endeavor is using the machine, so maybe that can be put > at the front somehow. It may be messy. > > JE = [0, 1, lambda state: state.sta [[[ uhoh > > > oop > > https://ar.anyone.tech/Lultc9dsOLhmVzd5ghntGXUaLOM5J8Y6bGFA866taxc#U2vY-vYFm... > https://ar.anyone.tech/cFo91pja_9_GiySahG-ZhVIXBSZ2Qgd0dkFSK9MkSfY
so i dont immediately remember well :s but i recently ended up arguing the -- oop??
https://ar.anyone.tech/THAKi1XsNkdfkAfYLQpXyKJsjs3DAw9dxipXLsNXgd8#cVWTtWThQ... https://ar.anyone.tech/Og6lSRhfifiHCjUwfZt7p_SS0lqSKOdz1zpH9gojBRg
uh! the turing halting problem with chatgpt and claude. focusing on defining a turing complete language that uses tur0ng's proof-by-contradiction assumption of there being a universal halting decider, to then define a computable syntax rule that excludes diagonal proofs and other contr--
https://ar.anyone.tech/hpjdvyfqc89vTMyv68uyj5uARHdrbViAXrJcP0yfsUI#5fl2J-xQk... https://ar.anyone.tech/6u253XhXFHG7Vp_X4RP-HkIEbWM2lOy9PcbjudHr214
recent possible phrasing [claude] was "closure under diagonalization is logically distinct from turing completeness". unsure if that's anything useful to say bu--
https://ar.anyone.tech/fSKDY6kC7ZHe9zgUnKKN91zY65cLT9POgloJX-ViMr8#9LQlU3oDi... https://ar.anyone.tech/opCDnLribrJyqEmsOxfA0yIOBAIFcGxYQILK0JpF4nM
so, midway earlier patterns said to just implement a halting decider :D it's always fun to try to implement things but i spasm out as soon as anything useful-looking gets involved, but i seemed to be able to start it right out!
so as soon as i had a functioning microvm i froze the work and comm--itted in celebration before anything went wrong cause thats a huge avconplishment for me :D
https://ar.anyone.tech/mgo04RidwMDjZkvnGflrAy0UG0pTapgYa9krnythZM0#Qr3-foyTN... https://ar.anyone.tech/AXEXNFcNt3uEFD4NxqnQjboFT3Rw6kRrKDzg0_NP3Ps
sadly this is presently stuck on an offline machine with its celebratory commit message :/ unsure if cutrent behaviors will transport more of it 0r its concept
ummm but! so thats my current thought for the halting decider goal, is to prqctice making microvms until i trust it to be a more stable behavior. cause there would be other blocks to navigate to do that so we gotta ensure things are ok, and vms are fun and possibly useful somehow!
i tried making a second vm today by iterating 'import opcode' in python. i made a super-succinct disassembler and wrote implementations for all the opcodes in a toy function :D but didn't get as far as actually having it run anything like the first one :/
microvms are intetesting to be near doing because they take a little more human-memory to do :}
https://ar.anyone.tech/SZvB3IwfwpwwBvW5qOiyReogs85Hj9XK0n9SeEMiVZE#1kxrM1wPY... https://ar.anyone.tech/mtQIrdgrG8CRz44E2qcIPXuU4FPy9L17ofoyaCYAWYg
how--
https://ar.anyone.tech/pExc9JWnFK82eUdlz0dRuYH7H2wWqFw0db4v7YRqSBc#qBETjFGvi... https://ar.anyone.tech/9BscdAmfuIOJbCrooJ4UUKW8eMXiNJw9mciCMI07_m8
apppp eeeeeeek so usually here i might copy over the microvm by hand with my thumbs but it is actually not very interesting and theres not much energy around the copying over approach :s :s i kinda hope to get things off of this computer at some point more easily but i dunno :s https://ar.anyone.tech/6uTpOotFHbbd4hPUHtg4c7WxG_Ep0VTBKhBI5Ohkkio#1kZvnXfgd... https://ar.anyone.tech/mOXZFg4lT8fXmUGO1o44RVszt0TUbsMcwu9Gg71BAAE I am not affiliated with https://ar.anyone.tech .
On Fri, Jun 26, 2026 at 09:04:36PM -0400, funkymail via cypherpunks wrote:
> > > > > https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... > > > > > https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q > > > > > > > > > > > class Go: > > > > > > > https://ar.anyone.tech/ELH4g_MtmIp76iolJ-Dhvt8iIv26YpOnL4lq1HzQr-I#d9HTHkvo2... > > > > https://ar.anyone.tech/M--JZ_7_HwlQrbc0JDWdtAIBYW48WU2zn3itspcrPvE > > > > > > > > > universe -- i implemented a tiny virtual machine! this was a great > > > celebration as i have been unable to imppement virtual machines for the > > > past decade as one of a handful of powerful CS paradigms that had > > > previously been driving me to spasms when trying to redevelop use of.. > > > > > > ..... > > > > > > eek! > > > > > > https://ar.anyone.tech/U9gwPAH5oYzJOiT_GfEBXtc4SCGEvMIMH_KFMuiHoIM#ZclDwlkrm... > > > https://ar.anyone.tech/SAeLncrOrqpW_p2Lzgkoh7s4UC9WgDgjD0pvzdYMFeI > > > > Let us try now again to implement a tiny machine. One of the hardest > > parts of such an endeavor is using the machine, so maybe that can be put > > at the front somehow. It may be messy. > > > > JE = [0, 1, lambda state: state.sta [[[ uhoh > > > > > > oop > > > > https://ar.anyone.tech/Lultc9dsOLhmVzd5ghntGXUaLOM5J8Y6bGFA866taxc#U2vY-vYFm... > > https://ar.anyone.tech/cFo91pja_9_GiySahG-ZhVIXBSZ2Qgd0dkFSK9MkSfY > > so i dont immediately remember well :s but i recently ended up arguing > the -- oop?? > > https://ar.anyone.tech/THAKi1XsNkdfkAfYLQpXyKJsjs3DAw9dxipXLsNXgd8#cVWTtWThQ... > https://ar.anyone.tech/Og6lSRhfifiHCjUwfZt7p_SS0lqSKOdz1zpH9gojBRg
uh! the turing halting problem with chatgpt and claude. focusing on defining a turing complete language that uses tur0ng's proof-by-contradiction assumption of there being a universal halting decider, to then define a computable syntax rule that excludes diagonal proofs and other contr--
https://ar.anyone.tech/hpjdvyfqc89vTMyv68uyj5uARHdrbViAXrJcP0yfsUI#5fl2J-xQk... https://ar.anyone.tech/6u253XhXFHG7Vp_X4RP-HkIEbWM2lOy9PcbjudHr214
recent possible phrasing [claude] was "closure under diagonalization is logically distinct from turing completeness". unsure if that's anything useful to say bu--
https://ar.anyone.tech/fSKDY6kC7ZHe9zgUnKKN91zY65cLT9POgloJX-ViMr8#9LQlU3oDi... https://ar.anyone.tech/opCDnLribrJyqEmsOxfA0yIOBAIFcGxYQILK0JpF4nM
so, midway earlier patterns said to just implement a halting decider :D it's always fun to try to implement things but i spasm out as soon as anything useful-looking gets involved, but i seemed to be able to start it right out!
so as soon as i had a functioning microvm i froze the work and comm--itted in celebration before anything went wrong cause thats a huge avconplishment for me :D
https://ar.anyone.tech/mgo04RidwMDjZkvnGflrAy0UG0pTapgYa9krnythZM0#Qr3-foyTN... https://ar.anyone.tech/AXEXNFcNt3uEFD4NxqnQjboFT3Rw6kRrKDzg0_NP3Ps
sadly this is presently stuck on an offline machine with its celebratory commit message :/ unsure if cutrent behaviors will transport more of it 0r its concept
ummm but! so thats my current thought for the halting decider goal, is to prqctice making microvms until i trust it to be a more stable behavior. cause there would be other blocks to navigate to do that so we gotta ensure things are ok, and vms are fun and possibly useful somehow!
i tried making a second vm today by iterating 'import opcode' in python. i made a super-succinct disassembler and wrote implementations for all the opcodes in a toy function :D but didn't get as far as actually having it run anything like the first one :/
microvms are intetesting to be near doing because they take a little more human-memory to do :}
https://ar.anyone.tech/SZvB3IwfwpwwBvW5qOiyReogs85Hj9XK0n9SeEMiVZE#1kxrM1wPY... https://ar.anyone.tech/mtQIrdgrG8CRz44E2qcIPXuU4FPy9L17ofoyaCYAWYg
how--
https://ar.anyone.tech/pExc9JWnFK82eUdlz0dRuYH7H2wWqFw0db4v7YRqSBc#qBETjFGvi... https://ar.anyone.tech/9BscdAmfuIOJbCrooJ4UUKW8eMXiNJw9mciCMI07_m8
apppp eeeeeeek
so usually here i might copy over the microvm by hand with my thumbs but it is actually not very interesting and theres not much energy around the copying over approach :s :s i kinda hope to get things off of this computer at some point more easily but i dunno :s
https://ar.anyone.tech/6uTpOotFHbbd4hPUHtg4c7WxG_Ep0VTBKhBI5Ohkkio#1kZvnXfgd... https://ar.anyone.tech/mOXZFg4lT8fXmUGO1o44RVszt0TUbsMcwu9Gg71BAAE
so. what is a vm made of ??? youcan make a vm however you want, but basically: - instructions generally with opcodes and arguments and distinct implementations - machine state, an instruction pointer, optionally other registers and anything needed to do useful things together with the instructions - a storage representation for data and functions, some kind of calling convention - a way to put in code and run it if you're making a static halting decider, you might also want: - algebraic/symbolic descriptions of how each instruction mutates machine state https://ar.anyone.tech/F0EotPMIpxT7SdJbfnNZxbtnVMPSGAk24cTBeZlWgjk#9WQ19wzmM... https://ar.anyone.tech/QNUH0T6djqDChG3_hzajsj7Z-ShzjwJm8WqwJ2b3Qss I am not affiliated with https://ar.anyone.tech .
On Fri, Jun 26, 2026 at 09:13:26PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 09:04:36PM -0400, funkymail via cypherpunks wrote:
> > > > > > https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... > > > > > > https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q > > > > > > > > > > > > > > class Go: > > > > > > > > > https://ar.anyone.tech/ELH4g_MtmIp76iolJ-Dhvt8iIv26YpOnL4lq1HzQr-I#d9HTHkvo2... > > > > > https://ar.anyone.tech/M--JZ_7_HwlQrbc0JDWdtAIBYW48WU2zn3itspcrPvE > > > > > > > > > > > > universe -- i implemented a tiny virtual machine! this was a great > > > > celebration as i have been unable to imppement virtual machines for the > > > > past decade as one of a handful of powerful CS paradigms that had > > > > previously been driving me to spasms when trying to redevelop use of.. > > > > > > > > ..... > > > > > > > > eek! > > > > > > > > https://ar.anyone.tech/U9gwPAH5oYzJOiT_GfEBXtc4SCGEvMIMH_KFMuiHoIM#ZclDwlkrm... > > > > https://ar.anyone.tech/SAeLncrOrqpW_p2Lzgkoh7s4UC9WgDgjD0pvzdYMFeI > > > > > > Let us try now again to implement a tiny machine. One of the hardest > > > parts of such an endeavor is using the machine, so maybe that can be put > > > at the front somehow. It may be messy. > > > > > > JE = [0, 1, lambda state: state.sta [[[ uhoh > > > > > > > > > oop > > > > > > https://ar.anyone.tech/Lultc9dsOLhmVzd5ghntGXUaLOM5J8Y6bGFA866taxc#U2vY-vYFm... > > > https://ar.anyone.tech/cFo91pja_9_GiySahG-ZhVIXBSZ2Qgd0dkFSK9MkSfY > > > > so i dont immediately remember well :s but i recently ended up arguing > > the -- oop?? > > > > https://ar.anyone.tech/THAKi1XsNkdfkAfYLQpXyKJsjs3DAw9dxipXLsNXgd8#cVWTtWThQ... > > https://ar.anyone.tech/Og6lSRhfifiHCjUwfZt7p_SS0lqSKOdz1zpH9gojBRg > > uh! the turing halting problem with chatgpt and claude. focusing on > defining a turing complete language that uses tur0ng's > proof-by-contradiction assumption of there being a universal halting > decider, to then define a computable syntax rule that excludes diagonal proofs and other contr-- > > https://ar.anyone.tech/hpjdvyfqc89vTMyv68uyj5uARHdrbViAXrJcP0yfsUI#5fl2J-xQk... > https://ar.anyone.tech/6u253XhXFHG7Vp_X4RP-HkIEbWM2lOy9PcbjudHr214
recent possible phrasing [claude] was "closure under diagonalization is logically distinct from turing completeness". unsure if that's anything useful to say bu--
https://ar.anyone.tech/fSKDY6kC7ZHe9zgUnKKN91zY65cLT9POgloJX-ViMr8#9LQlU3oDi... https://ar.anyone.tech/opCDnLribrJyqEmsOxfA0yIOBAIFcGxYQILK0JpF4nM
so, midway earlier patterns said to just implement a halting decider :D it's always fun to try to implement things but i spasm out as soon as anything useful-looking gets involved, but i seemed to be able to start it right out!
so as soon as i had a functioning microvm i froze the work and comm--itted in celebration before anything went wrong cause thats a huge avconplishment for me :D
https://ar.anyone.tech/mgo04RidwMDjZkvnGflrAy0UG0pTapgYa9krnythZM0#Qr3-foyTN... https://ar.anyone.tech/AXEXNFcNt3uEFD4NxqnQjboFT3Rw6kRrKDzg0_NP3Ps
sadly this is presently stuck on an offline machine with its celebratory commit message :/ unsure if cutrent behaviors will transport more of it 0r its concept
ummm but! so thats my current thought for the halting decider goal, is to prqctice making microvms until i trust it to be a more stable behavior. cause there would be other blocks to navigate to do that so we gotta ensure things are ok, and vms are fun and possibly useful somehow!
i tried making a second vm today by iterating 'import opcode' in python. i made a super-succinct disassembler and wrote implementations for all the opcodes in a toy function :D but didn't get as far as actually having it run anything like the first one :/
microvms are intetesting to be near doing because they take a little more human-memory to do :}
https://ar.anyone.tech/SZvB3IwfwpwwBvW5qOiyReogs85Hj9XK0n9SeEMiVZE#1kxrM1wPY... https://ar.anyone.tech/mtQIrdgrG8CRz44E2qcIPXuU4FPy9L17ofoyaCYAWYg
how--
https://ar.anyone.tech/pExc9JWnFK82eUdlz0dRuYH7H2wWqFw0db4v7YRqSBc#qBETjFGvi... https://ar.anyone.tech/9BscdAmfuIOJbCrooJ4UUKW8eMXiNJw9mciCMI07_m8
apppp eeeeeeek
so usually here i might copy over the microvm by hand with my thumbs but it is actually not very interesting and theres not much energy around the copying over approach :s :s i kinda hope to get things off of this computer at some point more easily but i dunno :s
https://ar.anyone.tech/6uTpOotFHbbd4hPUHtg4c7WxG_Ep0VTBKhBI5Ohkkio#1kZvnXfgd... https://ar.anyone.tech/mOXZFg4lT8fXmUGO1o44RVszt0TUbsMcwu9Gg71BAAE
so. what is a vm made of ??? youcan make a vm however you want, but basically: - instructions generally with opcodes and arguments and distinct implementations - machine state, an instruction pointer, optionally other registers and anything needed to do useful things together with the instructions
ok maybe we could make an ultra-smol barebones not-a-vm that only implements NOP: ++IP can i do it?? will i succeed?
- a storage representation for data and functions, some kind of calling convention - a way to put in code and run it if you're making a static halting decider, you might also want: - algebraic/symbolic descriptions of how each instruction mutates machine state
https://ar.anyone.tech/F0EotPMIpxT7SdJbfnNZxbtnVMPSGAk24cTBeZlWgjk#9WQ19wzmM... https://ar.anyone.tech/QNUH0T6djqDChG3_hzajsj7Z-ShzjwJm8WqwJ2b3Qss I am not affiliated with https://ar.anyone.tech .
https://ar.anyone.tech/Sc0F-Nh7IDTuaECjFbBMtNLArHfUBOmNbt6BMADre3s#yjgJoweOy... https://ar.anyone.tech/cj2V656HVrjzCkbSrrCzrqgSuP7ZcS52yq80j3CMYwI I am not affiliated with https://ar.anyone.tech .
On Fri, Jun 26, 2026 at 09:16:54PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 09:13:26PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 09:04:36PM -0400, funkymail via cypherpunks wrote:
> > > > > > > https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... > > > > > > > https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q > > > > > > > > > > > > > > > > > class Go: > > > > > > > > > > > https://ar.anyone.tech/ELH4g_MtmIp76iolJ-Dhvt8iIv26YpOnL4lq1HzQr-I#d9HTHkvo2... > > > > > > https://ar.anyone.tech/M--JZ_7_HwlQrbc0JDWdtAIBYW48WU2zn3itspcrPvE > > > > > > > > > > > > > > > universe -- i implemented a tiny virtual machine! this was a great > > > > > celebration as i have been unable to imppement virtual machines for the > > > > > past decade as one of a handful of powerful CS paradigms that had > > > > > previously been driving me to spasms when trying to redevelop use of.. > > > > > > > > > > ..... > > > > > > > > > > eek! > > > > > > > > > > https://ar.anyone.tech/U9gwPAH5oYzJOiT_GfEBXtc4SCGEvMIMH_KFMuiHoIM#ZclDwlkrm... > > > > > https://ar.anyone.tech/SAeLncrOrqpW_p2Lzgkoh7s4UC9WgDgjD0pvzdYMFeI > > > > > > > > Let us try now again to implement a tiny machine. One of the hardest > > > > parts of such an endeavor is using the machine, so maybe that can be put > > > > at the front somehow. It may be messy. > > > > > > > > JE = [0, 1, lambda state: state.sta [[[ uhoh > > > > > > > > > > > > oop > > > > > > > > https://ar.anyone.tech/Lultc9dsOLhmVzd5ghntGXUaLOM5J8Y6bGFA866taxc#U2vY-vYFm... > > > > https://ar.anyone.tech/cFo91pja_9_GiySahG-ZhVIXBSZ2Qgd0dkFSK9MkSfY > > > > > > so i dont immediately remember well :s but i recently ended up arguing > > > the -- oop?? > > > > > > https://ar.anyone.tech/THAKi1XsNkdfkAfYLQpXyKJsjs3DAw9dxipXLsNXgd8#cVWTtWThQ... > > > https://ar.anyone.tech/Og6lSRhfifiHCjUwfZt7p_SS0lqSKOdz1zpH9gojBRg > > > > uh! the turing halting problem with chatgpt and claude. focusing on > > defining a turing complete language that uses tur0ng's > > proof-by-contradiction assumption of there being a universal halting > > decider, to then define a computable syntax rule that excludes diagonal proofs and other contr-- > > > > https://ar.anyone.tech/hpjdvyfqc89vTMyv68uyj5uARHdrbViAXrJcP0yfsUI#5fl2J-xQk... > > https://ar.anyone.tech/6u253XhXFHG7Vp_X4RP-HkIEbWM2lOy9PcbjudHr214 > > recent possible phrasing [claude] was "closure under diagonalization is > logically distinct from turing completeness". unsure if that's anything > useful to say bu-- > > https://ar.anyone.tech/fSKDY6kC7ZHe9zgUnKKN91zY65cLT9POgloJX-ViMr8#9LQlU3oDi... > https://ar.anyone.tech/opCDnLribrJyqEmsOxfA0yIOBAIFcGxYQILK0JpF4nM
so, midway earlier patterns said to just implement a halting decider :D it's always fun to try to implement things but i spasm out as soon as anything useful-looking gets involved, but i seemed to be able to start it right out!
so as soon as i had a functioning microvm i froze the work and comm--itted in celebration before anything went wrong cause thats a huge avconplishment for me :D
https://ar.anyone.tech/mgo04RidwMDjZkvnGflrAy0UG0pTapgYa9krnythZM0#Qr3-foyTN... https://ar.anyone.tech/AXEXNFcNt3uEFD4NxqnQjboFT3Rw6kRrKDzg0_NP3Ps
sadly this is presently stuck on an offline machine with its celebratory commit message :/ unsure if cutrent behaviors will transport more of it 0r its concept
ummm but! so thats my current thought for the halting decider goal, is to prqctice making microvms until i trust it to be a more stable behavior. cause there would be other blocks to navigate to do that so we gotta ensure things are ok, and vms are fun and possibly useful somehow!
i tried making a second vm today by iterating 'import opcode' in python. i made a super-succinct disassembler and wrote implementations for all the opcodes in a toy function :D but didn't get as far as actually having it run anything like the first one :/
microvms are intetesting to be near doing because they take a little more human-memory to do :}
https://ar.anyone.tech/SZvB3IwfwpwwBvW5qOiyReogs85Hj9XK0n9SeEMiVZE#1kxrM1wPY... https://ar.anyone.tech/mtQIrdgrG8CRz44E2qcIPXuU4FPy9L17ofoyaCYAWYg
how--
https://ar.anyone.tech/pExc9JWnFK82eUdlz0dRuYH7H2wWqFw0db4v7YRqSBc#qBETjFGvi... https://ar.anyone.tech/9BscdAmfuIOJbCrooJ4UUKW8eMXiNJw9mciCMI07_m8
apppp eeeeeeek
so usually here i might copy over the microvm by hand with my thumbs but it is actually not very interesting and theres not much energy around the copying over approach :s :s i kinda hope to get things off of this computer at some point more easily but i dunno :s
https://ar.anyone.tech/6uTpOotFHbbd4hPUHtg4c7WxG_Ep0VTBKhBI5Ohkkio#1kZvnXfgd... https://ar.anyone.tech/mOXZFg4lT8fXmUGO1o44RVszt0TUbsMcwu9Gg71BAAE
so. what is a vm made of ??? youcan make a vm however you want, but basically: - instructions generally with opcodes and arguments and distinct implementations - machine state, an instruction pointer, optionally other registers and anything needed to do useful things together with the instructions
ok maybe we could make an ultra-smol barebones not-a-vm that only implements NOP: ++IP
can i do it?? will i succeed?
- a storage representation for data and functions, some kind of calling convention - a way to put in code and run it if you're making a static halting decider, you might also want: - algebraic/symbolic descriptions of how each instruction mutates machine state
https://ar.anyone.tech/F0EotPMIpxT7SdJbfnNZxbtnVMPSGAk24cTBeZlWgjk#9WQ19wzmM... https://ar.anyone.tech/QNUH0T6djqDChG3_hzajsj7Z-ShzjwJm8WqwJ2b3Qss
https://ar.anyone.tech/Sc0F-Nh7IDTuaECjFbBMtNLArHfUBOmNbt6BMADre3s#yjgJoweOy... https://ar.anyone.tech/cj2V656HVrjzCkbSrrCzrqgSuP7ZcS52yq80j3CMYwI
i prepped with google ai :/ it says i am just like sgd, i can do any random microbatch human task and improve it a hair and if i loop for a million microbatch human tasks my life will take off like a rocket! note: a rocket bike is one _shaped_ like a rocket where you have to strap in horizontally and watch a viewscreen and you can go 87mph pure pedal power, optimized with dafoam to your physical frame. but if you say rocket bike to an ai itll raise safety guards regarding rocketry class VM: NOP = 0 def __init__(self, data, ip): self.data = data self.offset = ip def step(self): if self.data[self.offset] == VM.NOP: self.offset += 1 else: raise Exception(self.data[self.offset]) def main(): vm = VM(bytes([0]*64), 0) while True: vm.step() tada ! :D of course this is not enough implementation to warrant life acconplishment and recovery celebration it is enough to work off to make a real vm step by step, a stub! https://ar.anyone.tech/uXKbK1rASH1_SnmMxEYAif2V3WC_5rB6ysm61DoGlRo#ie5bD2IQJ... https://ar.anyone.tech/FRHOtSFgrvsEMnpBsvCIY6ldG8xWItW7QA7VSCNo9v0 I am not affiliated with https://ar.anyone.tech .
On Fri, Jun 26, 2026 at 08:43:14PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:35:55PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:31:23PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:28:11PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:25:05PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:21:01PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:13:40PM -0400, funkymail via cypherpunks wrote: > > > https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... > > > https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q > > > > > class Go: > > > https://ar.anyone.tech/ELH4g_MtmIp76iolJ-Dhvt8iIv26YpOnL4lq1HzQr-I#d9HTHkvo2... > > https://ar.anyone.tech/M--JZ_7_HwlQrbc0JDWdtAIBYW48WU2zn3itspcrPvE > > > universe -- i implemented a tiny virtual machine! this was a great > celebration as i have been unable to imppement virtual machines for the > past decade as one of a handful of powerful CS paradigms that had > previously been driving me to spasms when trying to redevelop use of.. > > ..... > > eek! > > https://ar.anyone.tech/U9gwPAH5oYzJOiT_GfEBXtc4SCGEvMIMH_KFMuiHoIM#ZclDwlkrm... > https://ar.anyone.tech/SAeLncrOrqpW_p2Lzgkoh7s4UC9WgDgjD0pvzdYMFeI
Let us try now again to implement a tiny machine. One of the hardest parts of such an endeavor is using the machine, so maybe that can be put at the front somehow. It may be messy.
JE = [0, 1, lambda state: state.sta [[[ uhoh
oop
https://ar.anyone.tech/Lultc9dsOLhmVzd5ghntGXUaLOM5J8Y6bGFA866taxc#U2vY-vYFm... https://ar.anyone.tech/cFo91pja_9_GiySahG-ZhVIXBSZ2Qgd0dkFSK9MkSfY
so i dont immediately remember well :s but i recently ended up arguing the -- oop??
https://ar.anyone.tech/THAKi1XsNkdfkAfYLQpXyKJsjs3DAw9dxipXLsNXgd8#cVWTtWThQ... https://ar.anyone.tech/Og6lSRhfifiHCjUwfZt7p_SS0lqSKOdz1zpH9gojBRg
uh! the turing halting problem with chatgpt and claude. focusing on defining a turing complete language that uses tur0ng's proof-by-contradiction assumption of there being a universal halting decider, to then define a computable syntax rule that excludes diagonal proofs and other contr--
https://ar.anyone.tech/hpjdvyfqc89vTMyv68uyj5uARHdrbViAXrJcP0yfsUI#5fl2J-xQk... https://ar.anyone.tech/6u253XhXFHG7Vp_X4RP-HkIEbWM2lOy9PcbjudHr214
recent possible phrasing [claude] was "closure under diagonalization is logically distinct from turing completeness". unsure if that's anything useful to say bu--
https://ar.anyone.tech/fSKDY6kC7ZHe9zgUnKKN91zY65cLT9POgloJX-ViMr8#9LQlU3oDi... https://ar.anyone.tech/opCDnLribrJyqEmsOxfA0yIOBAIFcGxYQILK0JpF4nM
so, midway earlier patterns said to just implement a halting decider :D it's always fun to try to implement things but i spasm out as soon as anything useful-looking gets involved, but i seemed to be able to start it right out!
so as soon as i had a functioning microvm i froze the work and comm--itted in celebration before anything went wrong cause thats a huge avconplishment for me :D
https://ar.anyone.tech/mgo04RidwMDjZkvnGflrAy0UG0pTapgYa9krnythZM0#Qr3-foyTN... https://ar.anyone.tech/AXEXNFcNt3uEFD4NxqnQjboFT3Rw6kRrKDzg0_NP3Ps
sadly this is presently stuck on an offline machine with its celebratory commit message :/ unsure if cutrent behaviors will transport more of it 0r its concept
ummm but! so thats my current thought for the halting decider goal, is to prqctice making microvms until i trust it to be a more stable behavior. cause there would be other blocks to navigate to do that so we gotta ensure things are ok, and vms are fun and possibly useful somehow!
i tried making a second vm today by iterating 'import opcode' in python. i made a super-succinct disassembler and wrote implementations for all the opcodes in a toy function :D but didn't get as far as actually having it run anything like the first one :/
microvms are intetesting to be near doing because they take a little more human-memory to do :}
https://ar.anyone.tech/SZvB3IwfwpwwBvW5qOiyReogs85Hj9XK0n9SeEMiVZE#1kxrM1wPY... https://ar.anyone.tech/mtQIrdgrG8CRz44E2qcIPXuU4FPy9L17ofoyaCYAWYg
so maybe iv-- uhhh https://ar.anyone.tech/TR4YX5YIB93wYCr6QEa8x8QTmR8OlexgIBDax4pSF88#1kZvnXfgd... https://ar.anyone.tech/Bb-FKg6i6ow-CoAiXBpYFEApMYKKrXjBiPONm5sHJaQ I am not affiliated with https://ar.anyone.tech .
On Fri, Jun 26, 2026 at 09:01:20PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:43:14PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:35:55PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:31:23PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:28:11PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:25:05PM -0400, funkymail via cypherpunks wrote:
On Fri, Jun 26, 2026 at 08:21:01PM -0400, funkymail via cypherpunks wrote: > On Fri, Jun 26, 2026 at 08:13:40PM -0400, funkymail via cypherpunks wrote: > > > > https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... > > > > https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q > > > > > > > > class Go:
https://ar.anyone.tech/TR4YX5YIB93wYCr6QEa8x8QTmR8OlexgIBDax4pSF88#1kZvnXfgd... https://ar.anyone.tech/Bb-FKg6i6ow-CoAiXBpYFEApMYKKrXjBiPONm5sHJaQ
Here is the current state of the simple gogame code: import numpy as np class Go: EMPTY = ' ' BLACK = 'X' WHITE = 'O' EDGE = '#' MARK = '\0' NEIGHBORS = np.array([[-1,0],[0,-1],[1,0],[0,1]]) def __init__(self, size=10): self.clear(size) @property def board(self): return self.edged_board[1:-1,1:-1] @property def size(self): return self.board.shape[0] def __repr__(self): return '\n'.join([' '.join(row) for row in self.edged_board.T[::-1]]) def clear(self, size = None): if size is not None: self.edged_board = np.full((size+2, size+2), Go.EDGE) col_axis_len = min(size, 27) row_axis_len = min(size, 9) self.edged_board[1:col_axis_len+1,0] = [chr(X) for X in np.arange(col_axis_len)+ord('A')] self.edged_board[0,1:row_axis_len+1] = [str(Y) for Y in np.arange(row_axis_len)+1] self.board[:] = Go.EMPTY self.turn = Go.BLACK self.passes = 0 self.captures = {Go.BLACK:0, Go.WHITE:0} def pass_(self, player): if player != self.turn: raise ValueError(f"It is {self.turn}'s turn, not {player}'s") self.turn = Go.BLACK if player == Go.WHITE else Go.WHITE self.passes += 1 def naive_score_needslock(self): unscored_territory = self.board == Go.EMPTY #while len @staticmethod def str2coord(coord : str): col = ord(coord[0].upper()) row = coord[1:] if col < ord('A') or col > ord('Z'): raise ValueError(f'Column "{col}" not A-Z') return np.array([col - ord('A'), int(row) - 1]) @staticmethod def coord2str(col, row = None): if row is None: col, row = col return chr(ord('A') + col) + str(1 + row) def move(self, col, row, player): if player != self.turn: raise ValueError(f"It is {self.turn}'s turn, not {player}'s") try: if row < 0 or col < 0: raise IndexError() if self.board[col, row] != Go.EMPTY: raise ValueError(f"{self.board[col, row]} has already moved there.") except IndexError: raise ValueError(f"{col}, {row} is off the board.") captures = [] self.board[col, row] = player self.turn = Go.BLACK if player == Go.WHITE else Go.WHITE try: for neighbor in Go.NEIGHBORS + 1: colrow = neighbor + [col, row] if self.edged_board[*colrow] == self.turn: members, liberties = self.liberties_needslock(*(colrow - 1)) if len(liberties) == 0: captures.extend(members) self.board[*members.T] = Go.EMPTY members, liberties = self.liberties_needslock(col, row) if len(liberties) == 0: raise ValueError(f"No liberties for {player}: {[self.coord2str(*coord) for coord in members]}.") except: self.board[col, row] = Go.EMPTY self.board[*np.array(captures).T] = self.turn self.turn = player raise self.captures[player] += len(captures) self.passes = 0 def play(self): while self.passes < 2: self.play1() def play1(self): print(self) move = input(f'{self.turn}: ') if move: try: self.move(*self.str2coord(move), self.turn) except Exception as e: print(type(e),e) else: self.pass_(self.turn) def liberties_needslock(self, col, row): colrow = np.array([col, row]) player = self.board[*colrow] members = [colrow] liberties = [] next_index = 0 try: while next_index < len(members): colrow = members[next_index] next_index += 1 self.board[*colrow] = Go.MARK neighbor_colrows = Go.NEIGHBORS + colrow[None] neighbors = self.edged_board[*(neighbor_colrows.T + 1)] if player != Go.EMPTY: liberties.extend(neighbor_colrows[neighbors == Go.EMPTY]) else: liberties.extend(neighbor_colrows[neighbors == Go.BLACK or neighbors == Go.WHITE]) new_members = neighbor_colrows[neighbors == player] members.extend(new_members) self.board[*new_members.T] = Go.MARK finally: self.board[*np.array(members).T] = player assert (self.edged_board != Go.MARK).all() return np.array(members), np.array(liberties) def atari_needslock(self, col, row): members, liberties = self.liberties_needslock(col, row) return len(liberties) == 1 if __name__ == '__main__': def main(): go = Go(5) go.move(0,0,go.turn) go.pass_(go.turn) assert(go.board[0,0] == go.turn) go.pass_(go.turn) go.move(1,0,go.turn) go.move(1,1,go.turn) go.move(0,1,go.turn) assert(go.board[0,0] == Go.EMPTY) go.pass_(go.turn) go.move(0,0,go.turn) go.pass_(go.turn) assert(go.board[0,0] == go.turn) go.clear() go.move(0,0,go.turn) go.move(1,1,go.turn) go.move(0,1,go.turn) go.pass_(go.turn) assert(go.board[0,1] == go.turn) go.clear() import traceback while True: try: go.move(np.random.randint(go.size), np.random.randint(go.size), go.turn) except Exception as e: if "has already moved" in str(e): continue traceback.print_exc() #print(type(e), e, repr(e.__traceback__)) go.play1() continue print(go) go.play() main() https://ar.anyone.tech/avN9UKjg-MuEP6JkPV3-jZ_giKvpalfrMPGg5ejzOmc#solCOXHas... https://ar.anyone.tech/mVPpGtZd5jBVzUc44l6MtY48kfQJdMq6o6OCubaR2eU I am not affiliated with https://ar.anyone.tech .
> > > > > https://ar.anyone.tech/QkHIWrCSy3iXoP_fS-2snSKIdPYBqGHNmPDya89lWHE#QE8jBZoNz... > > > > > https://ar.anyone.tech/ExicPTy-13WSydg1y-DHVOPtR8L6IMDMiMc7ZAGt2_Q > > > > > > > > > > > class Go:
https://ar.anyone.tech/TR4YX5YIB93wYCr6QEa8x8QTmR8OlexgIBDax4pSF88#1kZvnXfgd... https://ar.anyone.tech/Bb-FKg6i6ow-CoAiXBpYFEApMYKKrXjBiPONm5sHJaQ
Here is the current state of the simple gogame code:
import numpy as np
class Go: EMPTY = ' ' BLACK = 'X' WHITE = 'O' EDGE = '#' MARK = '\0' NEIGHBORS = np.array([[-1,0],[0,-1],[1,0],[0,1]]) def __init__(self, size=10): self.clear(size) @property def board(self): return self.edged_board[1:-1,1:-1] @property def size(self): return self.board.shape[0] def __repr__(self): return '\n'.join([' '.join(row) for row in self.edged_board.T[::-1]]) def clear(self, size = None): if size is not None: self.edged_board = np.full((size+2, size+2), Go.EDGE) col_axis_len = min(size, 27) row_axis_len = min(size, 9) self.edged_board[1:col_axis_len+1,0] = [chr(X) for X in np.arange(col_axis_len)+ord('A')] self.edged_board[0,1:row_axis_len+1] = [str(Y) for Y in np.arange(row_axis_len)+1] self.board[:] = Go.EMPTY self.turn = Go.BLACK self.passes = 0 self.captures = {Go.BLACK:0, Go.WHITE:0} def pass_(self, player): if player != self.turn: raise ValueError(f"It is {self.turn}'s turn, not {player}'s") self.turn = Go.BLACK if player == Go.WHITE else Go.WHITE self.passes += 1 def naive_score_needslock(self): unscored_territory = self.board == Go.EMPTY #while len @staticmethod def str2coord(coord : str): col = ord(coord[0].upper()) row = coord[1:] if col < ord('A') or col > ord('Z'): raise ValueError(f'Column "{col}" not A-Z') return np.array([col - ord('A'), int(row) - 1]) @staticmethod def coord2str(col, row = None): if row is None: col, row = col return chr(ord('A') + col) + str(1 + row) def move(self, col, row, player): if player != self.turn: raise ValueError(f"It is {self.turn}'s turn, not {player}'s") try: if row < 0 or col < 0: raise IndexError() if self.board[col, row] != Go.EMPTY: raise ValueError(f"{self.board[col, row]} has already moved there.") except IndexError: raise ValueError(f"{col}, {row} is off the board.") captures = [] self.board[col, row] = player self.turn = Go.BLACK if player == Go.WHITE else Go.WHITE try: for neighbor in Go.NEIGHBORS + 1: colrow = neighbor + [col, row] if self.edged_board[*colrow] == self.turn: members, liberties = self.liberties_needslock(*(colrow - 1)) if len(liberties) == 0: captures.extend(members) self.board[*members.T] = Go.EMPTY
members, liberties = self.liberties_needslock(col, row) if len(liberties) == 0: raise ValueError(f"No liberties for {player}: {[self.coord2str(*coord) for coord in members]}.") except: self.board[col, row] = Go.EMPTY self.board[*np.array(captures).T] = self.turn self.turn = player raise self.captures[player] += len(captures) self.passes = 0 def play(self): while self.passes < 2: self.play1() def play1(self): print(self) move = input(f'{self.turn}: ') if move: try: self.move(*self.str2coord(move), self.turn) except Exception as e: print(type(e),e) else: self.pass_(self.turn) def liberties_needslock(self, col, row): colrow = np.array([col, row]) player = self.board[*colrow] members = [colrow] liberties = [] next_index = 0 try: while next_index < len(members): colrow = members[next_index] next_index += 1 self.board[*colrow] = Go.MARK neighbor_colrows = Go.NEIGHBORS + colrow[None] neighbors = self.edged_board[*(neighbor_colrows.T + 1)] if player != Go.EMPTY: liberties.extend(neighbor_colrows[neighbors == Go.EMPTY]) else: liberties.extend(neighbor_colrows[neighbors == Go.BLACK or neighbors == Go.WHITE]) new_members = neighbor_colrows[neighbors == player] members.extend(new_members) self.board[*new_members.T] = Go.MARK finally: self.board[*np.array(members).T] = player assert (self.edged_board != Go.MARK).all() return np.array(members), np.array(liberties) def atari_needslock(self, col, row): members, liberties = self.liberties_needslock(col, row) return len(liberties) == 1
if __name__ == '__main__': def main(): go = Go(5) go.move(0,0,go.turn) go.pass_(go.turn) assert(go.board[0,0] == go.turn) go.pass_(go.turn) go.move(1,0,go.turn) go.move(1,1,go.turn) go.move(0,1,go.turn) assert(go.board[0,0] == Go.EMPTY) go.pass_(go.turn) go.move(0,0,go.turn) go.pass_(go.turn) assert(go.board[0,0] == go.turn) go.clear() go.move(0,0,go.turn) go.move(1,1,go.turn) go.move(0,1,go.turn) go.pass_(go.turn) assert(go.board[0,1] == go.turn) go.clear() import traceback while True: try: go.move(np.random.randint(go.size), np.random.randint(go.size), go.turn) except Exception as e: if "has already moved" in str(e): continue traceback.print_exc() #print(type(e), e, repr(e.__traceback__)) go.play1() continue print(go) go.play()
main()
https://ar.anyone.tech/avN9UKjg-MuEP6JkPV3-jZ_giKvpalfrMPGg5ejzOmc#solCOXHas... https://ar.anyone.tech/mVPpGtZd5jBVzUc44l6MtY48kfQJdMq6o6OCubaR2eU
7 dimensional checkers. older star trek had "tri-dimensional chess". i played once this game. there are floating board partitions and rules for moving the pieces between the board partitions -- more like 2.5d uncertain ahmmmmm https://ar.anyone.tech/trIB7Z9WE4t7Nf8mXgK6RG2PQoZbzaf6dj3qHmYKKNI#NUmAYW_ul... https://ar.anyone.tech/GqtLDIu6YDgzmW84K4NsdPlgAUx7z4vRL2WQDpXq794 I am not affiliated with https://ar.anyone.tech .
participants (1)
-
funkymail