Turing-computable issue Is important in research of Turing Machine and has significant value in both theory and practice. The paper analyzes Turingcomputable issue of k-variable function of nonnegative numbers by relational operationsfincludes greater than,less than and equal) and arithmetic operationsfincludes add operation,subtract,multiply,divide and modulo) and different accepting states are designed to compare the non-negative integers and to distinguish normal subtraction and proper subtraction and to decide whether an integer could be divided exactly. The paper also propose a Turing com...
