| |
|
Science Forum Index » Mathematics Forum » Zeno's Paradoxical Satisfaction (Turing-Churches?)
Page 1 of 1
|
| Author |
Message |
| Julio Di Egidio |
 Posted: Wed Apr 30, 2008 10:15 pm |
|
|
|
Guest
|
Questions that answer themselves:
Quote: Q: How did you get there?
A: There I was already.
Now:
Formulae are functions, algorithms are procedures. We justify formulae by induction, we verify algorithms by deduction. Nothing missing.
How then is possible to get that equivalence Turing=Churches?
Sorry, I need your help.
Julio |
|
|
| Back to top |
|
| Tim Little |
| Posted: Thu May 01, 2008 3:24 am |
|
|
|
Guest
|
On 2008-05-01, Julio Di Egidio <julio@diegidio.name> wrote:
Quote: How then is possible to get that equivalence Turing=Churches?
Are you talking about the Church-Turing thesis?
- Tim |
|
|
| Back to top |
|
| |
|
Page 1 of 1
All times are GMT - 5 Hours
The time now is Thu Jul 24, 2008 10:36 pm
|
|
