RGB FAQ
  • Welcome to RGB!
  • πŸ’‘What is RGB?
  • πŸ“šRGB Resources
  • βš™οΈRGB design principles
  • πŸŽ“RGB paradigms
    • Single-use seals
    • Cryptographic commitments
    • Client-side validation
    • Strict encoding
  • πŸ”–RGB Smart contracts
    • What is a smart contract?
    • What is contract schema?
    • How does one program RGB smart contracts?
    • Do you define the validity of a state transition with Schema?
  • ☣️RGB & β‚Ώitcoin
    • Will RGB require a fork of Bitcoin or Lightning?
    • RGB testnet & mainnet
    • Taproot, Schnorr signatures and RGB
    • Does anything need to happen in Lightning or Bitcoin to enable Lightning on RGB?
    • Is there a plan to work on channel factories?
  • 🎨RGB NFT
    • RGB NFT vs other NFT
    • What's the difference between RGB design of NFTs and common NFT approach?
  • ❓FAQ
    • What is RGB?
    • What does 'RGB' stand for?
    • Is RGB a new blockchain?
    • What can I do with RGB?
    • Is it possible to create a DAO with RGB?
    • RGB vs alternatives
    • Is RGB Turing-complete?
    • Does RGB require Taproot?
    • What RGB is compatible with?
    • Will Simplicity be used in RGB?
    • Why there is no RGB MVP with updates rolling out after?
    • How is confidentiality reached in RGB?
    • How is safety reached in RGB?
    • What is client-side validation?
    • How scalable is RGB?
    • Is there an RGB "Hello World" guide?
  • πŸ“–Glossary
    • Contracts
      • ContractId
      • NodeId
      • Node
      • State
      • State assignment
      • State transition
      • Assignment
      • Assignment variant
      • State data
      • State type
      • Metadata fields
      • Metadata
      • Data type
      • Genesis
    • AluVM
    • Bifrost
    • Client-side validation
    • Contractum
    • Deterministic Bitcoin commitments
      • Container construction/deconstruction
      • Container
      • Commitment
      • Commitment embedding
      • LockScript
      • Proof
      • Protocol-specific entropy
      • Supplement
    • Right
    • Schema & Scripts
      • Schema
      • Field type
      • Assignment type
      • Bit dimensions
      • ABI
      • Script library
      • Occurence boundaries
      • Script extensibility
      • Transition type
    • Single-use seals
      • Witness
      • Seal definition
      • Seal blinding
      • Multimessage commitments
      • Seal closing over message
    • Stash
      • Stash
      • Consignment
      • Disclosure
      • Anchor
      • Forget procedure
      • Merge procedure
      • Validate procedure
      • Conceal procedure
      • Consign procedure
    • Encodings
      • Merklization commitment encoding
      • Storage encoding
      • Strict encoding
      • Pedersen commitments
      • Blinding factors
      • Buletproofs
      • Conceal
      • Commitment encoding
  • πŸ™‹Community
    • Developer calls
    • Presentation slides
    • YouTube
    • Getting familiar with RGB
    • Articles & interviews on RGB
Powered by GitBook
On this page

Was this helpful?

  1. FAQ

Is RGB Turing-complete?

PreviousRGB vs alternativesNextDoes RGB require Taproot?

Last updated 3 years ago

Was this helpful?

First and foremost it depends on how exactly you define Turing-completeness. In simple words you can say that RGB is as Turing-complete as Ethereum. However, if we dig deeper while answering this question, we can find a parallel that comes from physics. , the creator of Mathematica, has been doing a very interesting research and , new methodology to describe physics. He is the guy who did a lot of research on cellular automata and Complexity Science in the early days. And in his works he shows (mathematically), that you could get a mathematical construction of a (graph of a certain type) where you only define simple evolution rules for this hypergraph end up having the emergence of physics as a whole. On this graph the quantum theory & the relativistic theory can emerge, thus proving that very simple rules defined for the graph's evolution (not the step-by-step algorithm!) may create the whole world of a tremendous complexity and richness. If you look closely, you can see that it's very similar to the concept of a . So thus far we see that the same can be applied to RGB, because RGB is basically a hypergraph with certain evolution rules defined locally. And with a kind of smart contracting system like that you can do much more than with Ethereum, where the steps and possible options of your computing are very limited to the predefined set of algorithms that operate the whole state or the system.

We are not 100% sure yet, but maybe RGB potentially is a non-Turing form of computing. By saying that we are not speaking about it being or not being Turing-complete, but about it being a non-Turing form of computing at all, but instead being a cellular automation-based one. So to sum up, RGB is a distributed, partially replicated state machine which is actually the type of a state machine when you don't have a complete state of the system (which is more similar to cellular automaton-based computing that Turing-one).

❓
Stephen Wolfram
he offered a new approach
hypergraph
cellular automaton