truth_machine

6 ms·

1.
by truth_machine 5y ago
If you have written such an article and it is sound, I would imagine that I would hear it all during your Alan Turing award lecture :) But you can just post it in the comment here, I will see it
2.
by truth_machine 5y ago
> disagree with your stated claim on (6) which is that there is no accepting state for (M) after an arbitrary move in (5). No, this is not what I claim. I claim that if after the step 5 the new state is not an accepting state, 2PDA has t
3.
by truth_machine 5y ago
What is "bitcoin system"?
4.
by truth_machine 5y ago
> You're conflating (intentionally?) Bitcoin the system vs Bitcoin Script What is "Bitcoin the system"? What are the parts of this system? You are saying this in a way that implies the existence of widespread and commonly
5.
by truth_machine 5y ago
I can not agree with the claim that Bitcoin's Script Interpreter is 2PDA as it is defined in Hopcroft et al. Definition of the 2PDA as given by Hopcroft relies on the notion of looping with the number of loop iterations not known or fi
6.
by truth_machine 5y ago
Sorry, but the (max) board size is not known in advance. Board grows as the Turing machine simulator is running. > What you can then do instead is, for example, to update the first half of the board in one transaction and then the secon
7.
by truth_machine 5y ago
I have nothing to do with nullc. I'd rather avoid personal attacks if it is OK with you. > it can represent a single iteration of a larger program which is the point not being acknowledged. I am actually acknowledging that bitcoin s
8.
by truth_machine 5y ago
> This is just plain wrong and not at all what this article is about. In the article, a script is developed that enforces state transfer by the specified transition table, i.e. only a specific set of bitcoin transactions are allowed on t
9.
by truth_machine 5y ago
It seems to me that we actually agree on the main points. I do agree with you that single contract transaction is not turing-complete. I also agree that turing-complete element happens outside. My disagreement is with the following: 1. I di
10.
by truth_machine 5y ago
I am very familiar with Bitcoin script, and it was rather easy to confirm that BSV is using the same set of opcodes, and sCrypt compiles to bitcoin script, with obvious conclusions. So I think that I actually understand the topic (and the a
11.
by truth_machine 5y ago
Well, in Etherium, provided that sufficient amount of gas is paid for, I could have a contract that implements several (many?) iterations of the Turing machine - or any other computation. With the approach proposed in the article I need to
12.
by truth_machine 5y ago
If you go over older posts on that medium blog, it seems to be a pattern with that particular author. He also has Conway's Game of Life implementation for 7x7 board, Rule 110 implementation for the tape of 5 elements, "machine lea
13.
by truth_machine 5y ago
Interesting to note that since sCrypt's "loop" construct simply unrolls the loop the constant number of times, proposed implementation will grow in size proportionally to the number of state transition rules (8 in the example
14.
by truth_machine 5y ago
So it looks like a better title would have been "saving the state of the turing machine on the bitcoin blockchain", as the claim of Turing completeness[1] seems disingenious - bitcoin script itself has no looping constructs and is