INCOMPLETENESS OF MATHEMATICS AND ABSOLUTELY UNSOLVABLE PROBLEMS
V.V. Tselishchev
Keywords: Godel, mathematics, computer, man, dilemma
Abstract
The paper deals with one of the aspects of Godel’s dilemma of the man-computer relation and the existence of absolutely unsolvable predicates in mathematics. The author discusses the basic premise of the dilemma, viz. the concept of incompleteness of mathematics as a corollary of incompleteness theorems. He concludes that Godel’s argument of man’s superiority over a finite machine is incomplete as far as solvability of mathematical predicates is concerned.
|
