Re: arithmetic in ZF
george wrote:
The thesis IS A PROPOSED
DEFINITION of ALGORITHM, NOT of "effectively computable
function on naturals into naturals".
You're just plain wrong.
--
Aatu Koskensilta (aatu.koskensilta@xxxxxxxxx)
"Wovon man nicht sprechen kann, daruber muss man schweigen"
- Ludwig Wittgenstein, Tractatus Logico-Philosophicus
.
Relevant Pages
- Re: Zenkins paper on Cantor (reply of Dr. Zenkin)
... What is "a function which is a bijection"? ... exists another function (algorithm), f^-1, with the property for all b ... well-defined (exists for all naturals n, m) and S is a bijection - ... of reals, S". ...
(comp.theory) - Re: Zenkins paper on Cantor (reply of Dr. Zenkin)
... What is "a function which is a bijection"? ... exists another function (algorithm), f^-1, with the property for all b ... well-defined (exists for all naturals n, m) and S is a bijection - ... of reals, S". ...
(sci.math) - Re: arithmetic in ZF
... Torkel manifestly obviously IS NOT *saying* that, ... > Or an algorithm can be given in terms ... > for computing a function from ... > naturals to naturals can be simulated ...
(sci.logic) - Re: Semantics of First-Order Languages
... A set A of naturals, or of objects we can in some suitable ... daruber muss man schweigen" ... - Ludwig Wittgenstein, Tractatus Logico-Philosophicus ...
(sci.logic) - Re: continuum hypothesis and 0=1
... For one thing, naturals are not sets. ... daruber muss man schweigen" ... - Ludwig Wittgenstein, Tractatus Logico-Philosophicus ...
(sci.math) |
|
