Turing machine insolubility discrimination method and system for big data

Abstract

The invention discloses a Turing machine insolubility discrimination method and system for big data. According to the Turing machine insolubility distinction method for the big data, a Turing machineM=(Q,sigma,gamma,delta,q0,qaccept,qreject,m,P0,T0,P,T) is defined, and an operating time limit is acquired, wherein an input box is popped up to prompt a user to input the operating time limit as T; aframe threshold of continuous movement of a read-write head is acquired, wherein an input box is popped up to prompt the user to input the frame threshold of continuous movement of the read-write head as m; and a minimum value density threshold and preset operating duration T0 and required value density P of the minimum value density threshold are acquired, wherein an input box is popped up to prompt the user to input the minimum value density threshold, the corresponding preset operating duration and the required value density as P0, T0 and P respectively. According to the discrimination method and system, by adding time, space and output limitations to insolubility judgment of the Turing machine, the demand of big data application is better met.

Description

technical field [0001] The invention relates to the field of Turing machines, in particular to a large data-oriented Turing machine unsolvable discrimination method and system. Background technique [0002] A Turing machine is a computational model of all existing computers, mobile phones and other electronic devices as well as electronic systems and electronic platforms. The advantage of the Turing machine model is that it can be applied not only to the oldest and most primitive computers, but also to the latest and most advanced computers, not only to a single computer, but also to a distributed computer cluster. It is suitable for the processing of small data and can be applied to the processing of big data. It is precisely because of its versatility and universality that it can become a computing model for all types of computers and electronic equipment, electronic systems, and electronic platforms. [0003] The Turing machine can use M=(Q, Σ, Γ, δ, q0, qaccept, qreject...

AI Technical Summary

Problems solved by technology

[0004] Existing Turing machines have no restrictions on running time, communication overhead, and calculation results. As long as the calculation can be completed within a limited time, but the limited time can be very long, such as tens of thousands of years, it is solvable and cannot be stopped or calculation errors It is considered unsolvable, but this cannot meet the needs of big data processing, because big data processing requires real-time, obviously there is no limit to the running time; because the amount of data in big data processing is very large, if the data needs to be far away during the calculation process Distance transmission, obviously, due to the huge amount of data, the communication overhead is huge, which will make the communication paralyzed, so the communication distance must be limited, which is reflected in the Turing machine is the number of grids that the read-write head needs to move when calculating once; because large data The value density is low. If a certain amount of value cannot be mined within a certain period of time, it means that using the current algorithm to mine the current data is doing useless work and should end instead of continuing to mine.

Images