作者: Apostolos Syropoulos
DOI: 10.1007/978-1-4614-8379-3_2
关键词: Rational number 、 Computability logic 、 Algebra 、 Church–Turing thesis 、 Computability theory 、 Computer science 、 Symbol (formal) 、 Integer 、 Turing machine 、 Zero (linguistics)
摘要: Turing machines form the core of computability theory, or recursion theory as it is also known. This chapter introduces basic notions and results readers already familiar with them can safely skip it. The exposition based on standard references [18, 39, 67, 83, 109]. In discussion that follows, symbol ℕ will stand for set positive integer numbers including zero ℚ rational numbers.