%0 Journal Article
%T Turing Compute Model for Non-negative Binary Numbers
%A Wenyu Chen
%A Xiaobin Wang
%A Xiaoou Cheng
%A Shixin Sun
%J Journal of Software
%D 2010
%I Academy Publisher
%R 10.4304/jsw.5.1.123-130
%X Turing-computable issue is important in research of Turing Machine and has significant value in both theory and practice. The paper analyzes Turing-computable issue of non-negative numbers by relational operations(includes greater than, less than and equal) and arithmetic operations(includes add operation, subtract, multiply, divide and modulo). The regulation of computing 1-bit binary number and the carry set(or borrow set) are defined to compute multi-bit binary numbers. Algorithms are described through multi-tape Turing machine. For some operations, the discussion is extended to base-N number system(3¡ÜN¡Ü10). Turing regulation for add operation is used to implement the Turing counter for counting the length of the string on the input tape of the Turing machine.
%K Turing machine
%K Turing computable
%K binary
%K Turing counter
%U http://ojs.academypublisher.com/index.php/jsw/article/view/632