Theorem 8.13: If a language L is accepted by a Turing machine, then L is accepted by a two-stack machine. - Introduction to automata theory, languages, and computation / Hopcroft,. Motwani, Ullman The Bitcoin Interpreter is a two-stack machine.
What the chain says
- Block
- 636 011
- Time
- 2020-05-22T12:12:15Z
- Signer
- 1K59XDtPV3VPyK65JKYJekfRMmfWJNxNwN
- App
- twetch
- Type
- post
- Content type
- text/plain
- Name in tx
- twetch#1477
Fields the transaction did not carry are omitted. Open the payload to see the bytes as stored.
Signed by
1K59XDtPV3VPyK65JKYJekfRMmfWJNxNwN Verified