Is NIP-01 or some combination of NIPs turing complete? #asknostr 🤔🤔🤔

Reply to this note

Please Login to reply.

Discussion

I've asked myself this question, we basically need to see if we can make the basic logic gates out of just nip-01, I have a very abstract idea for a not gate, but that's as far as I've gone, maybe I need to give it more time.

It’s probably not useful but considering our input as a nostr event (let’s call it A)

Our not function should give us a new event: (A!) using ! as a replacement for the not operator, such that (A!)! = A

So within nostr event syntax, a not function could be something that adds a “not” tag on the event, that references another event( going to be A!) that has a not tag back to the original event. The not function returns the event referenced with the not tag.

So now whenever we call the not function for A it returns A! And when we call it for A! we get A.

Not sure if we could get to other gates with a similar approach, and sorry if there’s a flaw in this thinking this is just thoughts in my head that I’m blurting out online 😅

I'm still pondering this. I think you might be really interested in what #NOMAD nostr:npub1rujdpkd8mwezrvpqd2rx2zphfaztqrtsfg6w3vdnljdghs2q8qrqtt9u68 is buildng with Validators: https://nomad.lacrypta.ar/documentation/validators

Very interesting. I have some initial thoughts but I’ll reserve them until I go through it a couple of times more.