Turing Compute Model for Non-negative Numbers

摘要：

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 computation model for non-negative integers and based on the model,the conversion between binary numbers and non-negative integers in decimal system is achieved.

关键词： Turing machinejuring computable compute model

作者: Hu Qiguang Chen Wenyu Cheng Xiaoou

作者单位: Department of Computer Science,Hunan City University,Yiyang 413000,China School of Computer,University of Electronic Science & Technology of China,Chengdu 610054,China

会议类型: 国际会议

会议名称: 2010 International Forum on Computer Science-Technology and Applications(2010 国际计算机科学技术应用论坛 IFCSTA 2010)

会议地点: 南宁

会议语种:英文

页码: 25-28

在线出版日期: 2010-12-10（万方平台首次上网日期，不代表论文的发表时间）