has a black network node asking rat4 about the difference between
Blacknet and ETH in Turing. Chat history is as follows
![](https://ip.bitcointalk.org/?u=https%3A%2F%2Foss02.bihu.com%2Fimage%2F20190825%2F24481f3a057c784fc7602a8e149ff5d0_GEYTQNJKGE3TK.png&t=670&c=DuM4FOqakKDGqw)
Rat4 mentions that Ethereum is a Turing machine, and Blacknet is similar to Lambda calculus. Both are Turing complete.
What is Turing complete? Turing machine, what is the Lambda calculus?
![](https://ip.bitcointalk.org/?u=https%3A%2F%2Foss02.bihu.com%2Fimage%2F20190825%2Fb1448dff3effcef6c79f7425ca62766d_HE2TEKRZG42A.png&t=670&c=C8msnbndaZYCsA)
In the computability theory, if a series of rules for manipulating data(such as instruction sets, programming languages, cellular automata) can calculate the results in a certain order, it is called turing complete. A device with a Turing complete instruction set is defined as a general purpose computer. If Turing is complete, it (computer equipment) has the ability to perform conditional jumps (if, while, goto statements) and to change memory data. If something shows Turing complete, it has the ability to emulate the original computer, and even the simplest computer can simulate the most complex computer.
Yes, you are right ------ computer.
The author believes that Turing is a must for all future public chains
(except Bitcoin, not Turing complete)
![](https://ip.bitcointalk.org/?u=https%3A%2F%2Foss02.bihu.com%2Fimage%2F20190825%2Fc3604e0b07fa29e4ea9d4cefc376f5d5_GYYDEKRRGQZQ.png&t=670&c=dxhwjDXQorqT8Q)
Rat4 speaks Chinese is also excellent . He used a similar modern computer to explain the complete state of BLN Turing. It can be said that it is very incisive and direct. As for the use of computers, please ask the officials to fill their own brains and do not expand. Turing machine, also known as Turing calculation, Turing computer, is an abstract computing model proposed by mathematician Alan Messon Turing (1912 ~ 1954), which will be the process of using paper and pen for mathematical operations. Abstraction, a virtual machine replaces people for mathematical operations. It has an infinitely long strip of paper that is divided into small squares, each with a different color. There is a machine head that moves around the tape. The machine head has a set of internal states and some fixed programs. At each moment, the machine head reads a square information from the current tape, and then uses its internal state to find the program table, output the information according to the program to the paper square, and convert its internal state, then
Move.
What problem can the Turing machine solve?
Assuming that the functions described in the above model can be physically implemented in some form, then any arbitrable problem can be solved.
![](https://ip.bitcointalk.org/?u=https%3A%2F%2Foss02.bihu.com%2Fimage%2F20190825%2F57a07c9e101622f4fef9b6c8ac45a480_HAZTAKRYGY3A.png&t=670&c=KjoWBSheUT8VWA)
Some examples of calculation problems:
Given a positive integer n, determine if it is a prime number
Given a sequence of 01, reverse them by bit
Given a string, determine if a character exists, and find the location
Given a proposition of a logical implication, ask for its inverse no proposition
Examples of non-computing problems:
What to eat tonight
Why does the sun rise from the east?
Take the Ethereum Turing machine, the core of the Ethereum Virtual Machine (EVM), EVM can execute the code of any algorithm complexity. In the terminology of computer science, Ethereum is Turing-complete. Developers can create applications that run on EVM using a programming language similar to JavaScript and Python (Solidity). The Ethereum Virtual Machine (EVM) uses a 256-bit machine code and is a stack-based virtual machine for executing Ethereum smart contracts.
![](https://ip.bitcointalk.org/?u=https%3A%2F%2Foss02.bihu.com%2Fimage%2F20190825%2F2134679325ad2f902a71ec0576f7de15_GEZTSNBKGEZTCNQ.png&t=670&c=osEC0bAzFmzKWA)
Lambda calculus (λ-calculus) is a set of rules developed from mathematical logic that binds and replaces variables to study how functions abstract abstractions, how functions are applied, and recursive formal systems. It was first published by mathematician Alonzo Church in the 1930s. Lambda calculus, as a widely used computational model, clearly defines what a computable function can be, and any computable function can be expressed and
evaluated in this form, which simulates the computational process of a single tape Turing machine; Thus, lambda calculus emphasizes the use of transformation rules rather than the concrete machines that implement them.
The lambda calculus is comparable to the most fundamental programming language. It includes a transformation rule (variable substitution) and a way to abstract the function abstraction. It is therefore generally accepted as a way to get closer to software than hardware. The lambda calculus is Turing complete, that is, it is a generic model that can be used to simulate any Turing machine.
From the expression of rat4, Blacknet uses a similar Lambda calculus to achieve the Turing completion of BLN. Here I have to mention why BLN does not use a virtual machine like Ethereum, but uses a similar Lambda calculus to achieve Turing complete.
Lambda's strength lies in building complex projects that require multi-person collaboration.
The computer industry is clearly a project that requires multi-person collaboration, so Lambda calculus was chosen as the underlying
interpreter.
Lambda converts external iterations into internal iterations to make it more efficient, making coding more elegant by using functions as arguments.
With the failure of Moore's Law, multi-core processors are being deployed in PCs and professional servers. In order to make programs run more efficiently, developers need to be able to distribute tasks to multiple cores for execution, while the Java Collection Framework defaults to external iterations. The way to bind the program to a single core runs, greatly reducing the speed of the operation.
In addition, sometimes in order to achieve a certain purpose, we need to repeat a lot of boilerplate code, which will invade the business logic and reduce readability. The code can be more elegant and concise without overusing the lambda.
Xiaobian personally believes that how to achieve Turing completeness also has a significant impact on the scalability of the future public chain. For the specific method of how Blacknet implements Turing complete, rat4 does not have too much explanation, and we still have to study and discover. The above is for reference only (not necessarily completely accurate).
"Blacknet is easy to extend over time without having to rely on a guarding foundation. No foundation is required to veto what the blockchain can do because there is NO script stored on the blockchain. Blockchain logic is stored inside the clients. The blockchain uses accounts And operate ermissionless without master nodes. the blockchain can be extended by defininf new logic inside the clients how to handle new transaction types. Well understood transactiontypes are implemented in the client."-----Xranby(one of the black network development)
This passage also proves from the side that using Lambda calculus as the underlying interpreter is better than virtual machine logic (ETH) for scalabilit
![](https://ip.bitcointalk.org/?u=https%3A%2F%2Foss02.bihu.com%2Fimage%2F20190825%2F99c0aa8946c65448bf668eb8efab276d_GEZTKNJKGEZDQMQ.png&t=670&c=ghVoEwjQQyDPnw)