...that the importance of general recursiveness (or Turing computability) is that "... with this concept one has for the first time succeeded in giving an...notion, ie, one not depending on the formalism chosen". (Italics mine; quotation from the 1946 article appearing in Godei 1989). 2.2. Partial Recursive Functions...

...of Adefinability was proved. Godel set a high value on the idea of Turing writing: With this concept one has for the first time succeeded in giving an...notion, ie, one not depending on the formalism chosen. (1946, p. 1) Also Church agreed early on that Turing's definition was conceptually superior. In his...

...general recursiveness ior Turing's computahility) ... is largely due to the fact that with this concept one has for the first time succeeded in giving an...definition of an interesting epistemological notion, ie. not one depending on the formalism chosen. Godel 11946(1965: 84) economic theory in effective ways....

...importance [ie of the notion of recursive function] is largely due to the fact that with this concept one has for the first time succeeded in giving an...notion, ie one not depending on the formalism chosen." [Godel, 1965], [Wang, 1974, p. 81] The reader may feel encouraged to go on and get acquainted with...

...Godel thus began by noting that, with the concept of general recursiveness or Turing computability, "one has for the first time succeeded in giving an...an interesting epistemological notion, ie, one not aDavis has informed me that he did not know of the existence of this paper until SC Kleene suggested...

...an idea. He cites the example of Turing computability, which succeeds for the first time, he says, "in giving an absolute definition of an interesting...notion, ie one not depending on the formalism chosen" (Godei 1946, p. 150). "In all other cases treated previously," he says, particularly citing "demonstrability"...

...importance of... Turing's computability...seems to me...largely due to the fact that with this concept one has for the first time succeeded in giving an...definition of an interesting epistemological notion.' 77 14. The Entscheidungsproblem In Section 11 of 'On Computable Numbers', Turing turns to the Entscheidungsproblem,...

...computability) . It seems to me that this importance is largely due to the fact that with this concept one has for the first time succeeded in giving an absolute definition of an interesting episte mo logical notion, ie, one not depending on the formalism chosen* In all other cases treated...

...computability). It seems to me that this importance is largely due to the fact that with this concept one has for the first time succeeded in giving an...notion, ie, one not depending on the formalism chosen. But what is the argument for Church's claim, and what could it be for Godel's? If one uses the strategic...

...by Turing's paper." -Godel: letter to Kreisel of May 1, 1968 [Sieg, 1994, P- 88]. "... one [Turing] has for the first time succeeded in giving an absolute...notion, ie, one not depending on the formalism chosen." -Godel, Princeton Bicentennial, [1946, p. 84]. ". . .For the concept of computability, however, although...