the myth of ‘the myth of hypercomputation’kryten.mm.rpi.edu/pres/turkuhyper/nsg_sb_momoh... ·...
TRANSCRIPT
![Page 1: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/1.jpg)
The Myth of ‘The Myth of Hypercomputation’
Naveen Sundar G.1 & Selmer Bringsjord2
Department of Computer Science(1,2)
Department of Cognitive Science (2)
Lally School of Management (2)
Rensselaer Polytechnic Institute (RPI)Troy NY 12180 USA
[email protected] • [email protected] 9 2011 Turku, Finland
Thursday, June 9, 2011
![Page 2: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/2.jpg)
Thursday, June 9, 2011
![Page 3: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/3.jpg)
Thursday, June 9, 2011
![Page 4: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/4.jpg)
MD: Hypercomputation is nothing but a myth.
Thursday, June 9, 2011
![Page 5: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/5.jpg)
Thursday, June 9, 2011
![Page 6: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/6.jpg)
The real myth is that Davis’ argument(s) is/are sound.
Thursday, June 9, 2011
![Page 7: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/7.jpg)
Thursday, June 9, 2011
![Page 8: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/8.jpg)
Hypercomputation qua field is a success if one or more of the following possibilities hold.
Thursday, June 9, 2011
![Page 9: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/9.jpg)
1. POSSIBILITY 1 or η1: The Church-Turing is false; and it follows that there exist effective computations for functions that aren’t Turing-computable.
Hypercomputation qua field is a success if one or more of the following possibilities hold.
Thursday, June 9, 2011
![Page 10: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/10.jpg)
1. POSSIBILITY 1 or η1: The Church-Turing is false; and it follows that there exist effective computations for functions that aren’t Turing-computable.
2. POSSIBILITY 2 or η2: There are hypercomputational physical phenomena that may or may not be harnessable. In this case, the functions representing the dynamics of such phenomena are of course Turing-uncomputable.
Hypercomputation qua field is a success if one or more of the following possibilities hold.
Thursday, June 9, 2011
![Page 11: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/11.jpg)
1. POSSIBILITY 1 or η1: The Church-Turing is false; and it follows that there exist effective computations for functions that aren’t Turing-computable.
2. POSSIBILITY 2 or η2: There are hypercomputational physical phenomena that may or may not be harnessable. In this case, the functions representing the dynamics of such phenomena are of course Turing-uncomputable.
3. POSSIBILITY 3 or η3: There are hypercomputational cognitive phenomena that may or may not be harnessable. In this case, the functions representing the dynamics of such phenomena are of course Turing-uncomputable.
Hypercomputation qua field is a success if one or more of the following possibilities hold.
Thursday, June 9, 2011
![Page 12: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/12.jpg)
Thursday, June 9, 2011
![Page 13: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/13.jpg)
φ ≡ Hypercomputation is true.
Thursday, June 9, 2011
![Page 14: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/14.jpg)
φ ≡ η ≡ η1 ∨ η2 ∨ η3
φ ≡ Hypercomputation is true.
Thursday, June 9, 2011
![Page 15: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/15.jpg)
φ ≡ η ≡ η1 ∨ η2 ∨ η3
Davis tries to establish ¬η but fails.
φ ≡ Hypercomputation is true.
Thursday, June 9, 2011
![Page 16: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/16.jpg)
φ ≡ η ≡ η1 ∨ η2 ∨ η3
Davis tries to establish ¬η but fails.
We don’t establish η, but rather defend η against Davis.
φ ≡ Hypercomputation is true.
Thursday, June 9, 2011
![Page 17: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/17.jpg)
One-Slide Encapsulation of the Situation ...
Thursday, June 9, 2011
![Page 18: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/18.jpg)
TT, CT, CTT
Thursday, June 9, 2011
![Page 19: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/19.jpg)
TT, CT, CTT
TT: A numerical (total) function is effectively computable by some algorithmic routine if and only if (= iff) it is computable by a Turing machine.
Thursday, June 9, 2011
![Page 20: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/20.jpg)
TT, CT, CTT
TT: A numerical (total) function is effectively computable by some algorithmic routine if and only if (= iff) it is computable by a Turing machine.
CT: A numerical (total) function is effectively computable by some algorithmic routine if and only if (= iff) it is µ-recursive.
Thursday, June 9, 2011
![Page 21: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/21.jpg)
TT, CT, CTT
TT: A numerical (total) function is effectively computable by some algorithmic routine if and only if (= iff) it is computable by a Turing machine.
CT: A numerical (total) function is effectively computable by some algorithmic routine if and only if (= iff) it is µ-recursive.
CTT: The effectively computable total numerical functions are the µ-recursive/Turing computable functions.
Thursday, June 9, 2011
![Page 22: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/22.jpg)
TT, CT, CTT
TT: A numerical (total) function is effectively computable by some algorithmic routine if and only if (= iff) it is computable by a Turing machine.
CT: A numerical (total) function is effectively computable by some algorithmic routine if and only if (= iff) it is µ-recursive.
CTT: The effectively computable total numerical functions are the µ-recursive/Turing computable functions.
And, for a function f to be effectively computable, is for a human agent/computor/calculator/... to follow an algorithm in order to compute ... f.
Thursday, June 9, 2011
![Page 23: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/23.jpg)
Thursday, June 9, 2011
![Page 24: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/24.jpg)
! CTT
Thursday, June 9, 2011
![Page 25: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/25.jpg)
! CTT Yes?
Thursday, June 9, 2011
![Page 26: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/26.jpg)
! CTT Yes?
No.
Thursday, June 9, 2011
![Page 27: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/27.jpg)
! CTT
!" CTT
Yes?
No.
Thursday, June 9, 2011
![Page 28: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/28.jpg)
! CTT
!" CTT
Yes?
No. But in the stipulative manner it can be done:
Thursday, June 9, 2011
![Page 29: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/29.jpg)
! CTT
!" CTT
∀a∀A(C(a,A) ↔ δ)
Yes?
No. But in the stipulative manner it can be done:
Thursday, June 9, 2011
![Page 30: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/30.jpg)
! CTT
!" CTT
∀a∀A(C(a,A) ↔ δ)
∀f∀a∀A(Eff (f) ↔ C(a,A))
Yes?
No. But in the stipulative manner it can be done:
Thursday, June 9, 2011
![Page 31: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/31.jpg)
! CTT
!" CTT
∀a∀A(C(a,A) ↔ δ)
∀f∀a∀A(Eff (f) ↔ C(a,A))
Yes?
No. But in the stipulative manner it can be done:
...
Thursday, June 9, 2011
![Page 32: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/32.jpg)
! CTT
!" CTT
∀a∀A(C(a,A) ↔ δ)
∀f∀a∀A(Eff (f) ↔ C(a,A))
Yes?
No. But in the stipulative manner it can be done:
...
And hypercomputation?
Thursday, June 9, 2011
![Page 33: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/33.jpg)
! ♦ψhyper
! CTT
!" CTT
∀a∀A(C(a,A) ↔ δ)
∀f∀a∀A(Eff (f) ↔ C(a,A))
Yes?
No. But in the stipulative manner it can be done:
...
And hypercomputation?
Thursday, June 9, 2011
![Page 34: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/34.jpg)
! ♦ψhyper
! CTT
!" CTT
∀a∀A(C(a,A) ↔ δ)
∀f∀a∀A(Eff (f) ↔ C(a,A))
Yes?
No. But in the stipulative manner it can be done:
...
And hypercomputation? Done!
Thursday, June 9, 2011
![Page 35: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/35.jpg)
! ♦ψhyper
! CTT
!" CTT
∀a∀A(C(a,A) ↔ δ)
∀f∀a∀A(Eff (f) ↔ C(a,A))
Yes?
No. But in the stipulative manner it can be done:
...
And hypercomputation? Done!
Too easy?
Thursday, June 9, 2011
![Page 36: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/36.jpg)
! ♦ψhyper
! ♦♦pψhyper
! CTT
!" CTT
∀a∀A(C(a,A) ↔ δ)
∀f∀a∀A(Eff (f) ↔ C(a,A))
Yes?
No. But in the stipulative manner it can be done:
...
And hypercomputation? Done!
Too easy?
Thursday, June 9, 2011
![Page 37: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/37.jpg)
! ♦ψhyper
! ♦♦pψhyper
! CTT
!" CTT
∀a∀A(C(a,A) ↔ δ)
∀f∀a∀A(Eff (f) ↔ C(a,A))
Yes?
No. But in the stipulative manner it can be done:
...
And hypercomputation? Done!
Too easy?
What is needed:
Thursday, June 9, 2011
![Page 38: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/38.jpg)
! ♦pψhyper
! ♦ψhyper
! ♦♦pψhyper
! CTT
!" CTT
∀a∀A(C(a,A) ↔ δ)
∀f∀a∀A(Eff (f) ↔ C(a,A))
Yes?
No. But in the stipulative manner it can be done:
...
And hypercomputation? Done!
Too easy?
What is needed:
Thursday, June 9, 2011
![Page 39: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/39.jpg)
! ♦pψhyper
! ♦ψhyper
! ♦♦pψhyper
! CTT
!" CTT
∀a∀A(C(a,A) ↔ δ)
∀f∀a∀A(Eff (f) ↔ C(a,A))
Yes?
No. But in the stipulative manner it can be done:
...
And hypercomputation? Done!
Too easy?
What is needed: So ...
Thursday, June 9, 2011
![Page 40: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/40.jpg)
! ♦pψhyper
! ♦ψhyper
! ♦♦pψhyper
! CTT
!" CTT
∀a∀A(C(a,A) ↔ δ)
M |= [A] ∪ [agents] ∪ SpecRel ∪ {∃f(¬Tcomputable(f) ∧Effcomputable(f))
∀f∀a∀A(Eff (f) ↔ C(a,A))
Yes?
No. But in the stipulative manner it can be done:
...
And hypercomputation? Done!
Too easy?
What is needed: So ...
Thursday, June 9, 2011
![Page 41: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/41.jpg)
! ♦pψhyper
! ♦ψhyper
! ♦♦pψhyper
! CTT
!" CTT
∀a∀A(C(a,A) ↔ δ)
M |= [A] ∪ [agents] ∪ SpecRel ∪ {∃f(¬Tcomputable(f) ∧Effcomputable(f))
∀f∀a∀A(Eff (f) ↔ C(a,A))
Yes?
No. But in the stipulative manner it can be done:
...
And hypercomputation? Done!
Too easy?
What is needed: So ...
or:
Thursday, June 9, 2011
![Page 42: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/42.jpg)
! ♦pψhyper
! ♦ψhyper
! ♦♦pψhyper
! CTT
!" CTT
∀a∀A(C(a,A) ↔ δ)
M |= [A] ∪ [agents] ∪ SpecRel ∪ {∃f(¬Tcomputable(f) ∧Effcomputable(f))
M |= [H machines] ∪ SpecRel ∪ {∃f(¬Tcomputable(f) ∧Hcomputable(f))
∀f∀a∀A(Eff (f) ↔ C(a,A))
Yes?
No. But in the stipulative manner it can be done:
...
And hypercomputation? Done!
Too easy?
What is needed: So ...
or:
Thursday, June 9, 2011
![Page 43: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/43.jpg)
Attack on η1
Thursday, June 9, 2011
![Page 44: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/44.jpg)
Attack on η1
η1: The Church-Turing is false; and it follows that there exist effective computations for functions that aren't Turing-computable.
Thursday, June 9, 2011
![Page 45: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/45.jpg)
Attack on η1
Thursday, June 9, 2011
![Page 46: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/46.jpg)
Attack on η1
Davis:
During the 1930s, as a result of the work of a number of logicians, it became possible to explain with full precision what it means to say for some given problem that an algorithm exists providing a solution to that problem. Moreover it then became feasible to prove for certain problems no such algorithm exists, that it is impossible to specify an algorithm that provides a solution to those problems.
Thursday, June 9, 2011
![Page 47: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/47.jpg)
Attack on η1
Davis:
During the 1930s, as a result of the work of a number of logicians, it became possible to explain with full precision what it means to say for some given problem that an algorithm exists providing a solution to that problem. Moreover it then became feasible to prove for certain problems no such algorithm exists, that it is impossible to specify an algorithm that provides a solution to those problems.
Thursday, June 9, 2011
![Page 48: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/48.jpg)
Attack on η1
Davis:
During the 1930s, as a result of the work of a number of logicians, it became possible to explain with full precision what it means to say for some given problem that an algorithm exists providing a solution to that problem. Moreover it then became feasible to prove for certain problems no such algorithm exists, that it is impossible to specify an algorithm that provides a solution to those problems.
Circular reasoning by assuming the CTT.
Thursday, June 9, 2011
![Page 49: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/49.jpg)
And:
Thursday, June 9, 2011
![Page 50: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/50.jpg)
And:
• A false premise:
Thursday, June 9, 2011
![Page 51: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/51.jpg)
And:
• A false premise:
• To explain something with “full precision” one presumably has a fully formal scheme at one’s disposal; but because CTT (and all variants) has at its heart informal notions (e.g., effective computation) that have yet to be suitably formalized, “full precision” has not been obtain.
Thursday, June 9, 2011
![Page 52: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/52.jpg)
Attack on η2
Thursday, June 9, 2011
![Page 53: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/53.jpg)
Attack on η2
η2: There are hypercomputational physical phenomena that may or may not be harnessable. In this case, the functions representing the dynamics of such phenomena are of course Turing-uncomputable.
Thursday, June 9, 2011
![Page 54: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/54.jpg)
Attacking Physical Hypercomputation
Thursday, June 9, 2011
![Page 55: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/55.jpg)
Attacking Physical Hypercomputation
• Finiteness Assumptions
Thursday, June 9, 2011
![Page 56: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/56.jpg)
Attacking Physical Hypercomputation
• Finiteness Assumptions
• Uncomputable Weights and Weights
Thursday, June 9, 2011
![Page 57: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/57.jpg)
Attacking Physical Hypercomputation
• Finiteness Assumptions
• Uncomputable Weights and Weights
• Abstractness and Approximations
Thursday, June 9, 2011
![Page 58: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/58.jpg)
Attacking Physical Hypercomputation
• Finiteness Assumptions
• Uncomputable Weights and Weights
• Abstractness and Approximations
• Necessity of Non-computable Real Numbers in Physical Theory
Thursday, June 9, 2011
![Page 59: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/59.jpg)
Attacking Physical Hypercomputation
• Finiteness Assumptions
• Uncomputable Weights and Weights
• Abstractness and Approximations
• Necessity of Non-computable Real Numbers in Physical Theory
• Science-based Arguments
Thursday, June 9, 2011
![Page 60: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/60.jpg)
Finiteness Assumptions
Thursday, June 9, 2011
![Page 61: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/61.jpg)
Finiteness Assumptions• All hypercomputation models exploit infinite
resources in some manner.
Thursday, June 9, 2011
![Page 62: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/62.jpg)
Finiteness Assumptions• All hypercomputation models exploit infinite
resources in some manner.
• Let η’2 : There exists (in the mathematical universe) machines that can exploit infinite resources and such machines can be harnessed by people.
Thursday, June 9, 2011
![Page 63: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/63.jpg)
Finiteness Assumptions• All hypercomputation models exploit infinite
resources in some manner.
• Let η’2 : There exists (in the mathematical universe) machines that can exploit infinite resources and such machines can be harnessed by people.
• We can say that η2 → η’2
Thursday, June 9, 2011
![Page 64: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/64.jpg)
Finiteness Assumptions• All hypercomputation models exploit infinite
resources in some manner.
• Let η’2 : There exists (in the mathematical universe) machines that can exploit infinite resources and such machines can be harnessed by people.
• We can say that η2 → η’2
• Davis simply asserts ¬η’2
Thursday, June 9, 2011
![Page 65: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/65.jpg)
Finiteness Assumptions• All hypercomputation models exploit infinite
resources in some manner.
• Let η’2 : There exists (in the mathematical universe) machines that can exploit infinite resources and such machines can be harnessed by people.
• We can say that η2 → η’2
• Davis simply asserts ¬η’2
• “But it is worth noting that unlike the abstract algorithm that countenances no limitation on the size of the numbers being added, a machine implementing this algorithm, being a finite physical object, is constrained to accept only numbers smaller than some definite amount. (Davis 2004, 198)”
Thursday, June 9, 2011
![Page 66: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/66.jpg)
Uncomputable Weights and Weights
Thursday, June 9, 2011
![Page 67: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/67.jpg)
Uncomputable Weights and Weights
• Davis claims that Turing-uncomputable inputs are necessary to produce Turing uncomputable outputs in all hypercomputational models.
Thursday, June 9, 2011
![Page 68: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/68.jpg)
Uncomputable Weights and Weights
• Davis claims that Turing-uncomputable inputs are necessary to produce Turing uncomputable outputs in all hypercomputational models.
• “When the claims are viewed critically, it is seen that they amount to little more than the obvious comment that if non-computable inputs are permitted, then non-computable outputs are attainable.”
Thursday, June 9, 2011
![Page 69: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/69.jpg)
Uncomputable Weights and Weights
Thursday, June 9, 2011
![Page 70: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/70.jpg)
Uncomputable Weights and Weights
• Davis discusses only Siegelmann’s Analog Neural Network Model.
Thursday, June 9, 2011
![Page 71: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/71.jpg)
Uncomputable Weights and Weights
• Davis discusses only Siegelmann’s Analog Neural Network Model.
• Furthermore, Siegelmann’s models provide a model of computation in which one can use and exploit real numbers. This feature is already beyond the capability of Turing machines.
Thursday, June 9, 2011
![Page 72: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/72.jpg)
Uncomputable Weights and Weights
Thursday, June 9, 2011
![Page 73: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/73.jpg)
Uncomputable Weights and Weights
• There are other models which do not require Turing-uncomputable inputs to produce Turing-uncomputable outputs.
Thursday, June 9, 2011
![Page 74: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/74.jpg)
Uncomputable Weights and Weights
• There are other models which do not require Turing-uncomputable inputs to produce Turing-uncomputable outputs.
• Can be categorized as:
Thursday, June 9, 2011
![Page 75: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/75.jpg)
Uncomputable Weights and Weights
• There are other models which do not require Turing-uncomputable inputs to produce Turing-uncomputable outputs.
• Can be categorized as:
• Infinite time Turing machines
Thursday, June 9, 2011
![Page 76: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/76.jpg)
Uncomputable Weights and Weights
• There are other models which do not require Turing-uncomputable inputs to produce Turing-uncomputable outputs.
• Can be categorized as:
• Infinite time Turing machines
• Super-task machines
Thursday, June 9, 2011
![Page 77: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/77.jpg)
Uncomputable Weights and Weights
• There are other models which do not require Turing-uncomputable inputs to produce Turing-uncomputable outputs.
• Can be categorized as:
• Infinite time Turing machines
• Super-task machines
• Physical oracles
Thursday, June 9, 2011
![Page 78: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/78.jpg)
Abstractness and Approximations
Thursday, June 9, 2011
![Page 79: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/79.jpg)
Abstractness and Approximations
• This rather absurd attack goes as follows
Thursday, June 9, 2011
![Page 80: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/80.jpg)
Abstractness and Approximations
• This rather absurd attack goes as follows
1. Even Turing machines are abstract models that can’t be implemented fully.
Thursday, June 9, 2011
![Page 81: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/81.jpg)
Abstractness and Approximations
• This rather absurd attack goes as follows
1. Even Turing machines are abstract models that can’t be implemented fully.
2. Therefore, no other more powerful model can be implemented fully.
Thursday, June 9, 2011
![Page 82: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/82.jpg)
Abstractness and Approximations
• This rather absurd attack goes as follows
1. Even Turing machines are abstract models that can’t be implemented fully.
2. Therefore, no other more powerful model can be implemented fully.
Thursday, June 9, 2011
![Page 83: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/83.jpg)
• This rather absurd attack goes as follows
1. Even Turing machines are abstract models that can’t be implemented fully.
2. Therefore, no other more powerful model can be implemented fully.
Abstractness and Approximations
Thursday, June 9, 2011
![Page 84: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/84.jpg)
• This rather absurd attack goes as follows
1. Even Turing machines are abstract models that can’t be implemented fully.
2. Therefore, no other more powerful model can be implemented fully.
Abstractness and Approximations
• Going by the same argument:
Thursday, June 9, 2011
![Page 85: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/85.jpg)
• This rather absurd attack goes as follows
1. Even Turing machines are abstract models that can’t be implemented fully.
2. Therefore, no other more powerful model can be implemented fully.
Abstractness and Approximations
• Going by the same argument:
• Since Turing computers can’t be realized fully, Turing computation is now another “myth.”
Thursday, June 9, 2011
![Page 86: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/86.jpg)
• This rather absurd attack goes as follows
1. Even Turing machines are abstract models that can’t be implemented fully.
2. Therefore, no other more powerful model can be implemented fully.
Abstractness and Approximations
• Going by the same argument:
• Since Turing computers can’t be realized fully, Turing computation is now another “myth.”
• The problem is that Davis fails to recognize that a lot of the hypercomputational models are abstract models that no one hopes to build in the near future.
Thursday, June 9, 2011
![Page 87: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/87.jpg)
Necessity of Non-computable Reals
Thursday, June 9, 2011
![Page 88: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/88.jpg)
Necessity of Non-computable Reals
• Another point in Davis’ argument is that almost all hypercomputation models require Physics to give them a Turing-uncomputable real number.
Thursday, June 9, 2011
![Page 89: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/89.jpg)
Necessity of Non-computable Reals
• Another point in Davis’ argument is that almost all hypercomputation models require Physics to give them a Turing-uncomputable real number.
• This is false. Quite a large number of hypercomputation models don’t require non-computable reals and roughly fall into the following categories
Thursday, June 9, 2011
![Page 90: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/90.jpg)
Necessity of Non-computable Reals
• Another point in Davis’ argument is that almost all hypercomputation models require Physics to give them a Turing-uncomputable real number.
• This is false. Quite a large number of hypercomputation models don’t require non-computable reals and roughly fall into the following categories
• Infinite time Turing Machines
Thursday, June 9, 2011
![Page 91: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/91.jpg)
Necessity of Non-computable Reals
• Another point in Davis’ argument is that almost all hypercomputation models require Physics to give them a Turing-uncomputable real number.
• This is false. Quite a large number of hypercomputation models don’t require non-computable reals and roughly fall into the following categories
• Infinite time Turing Machines
• Zeus Machines
Thursday, June 9, 2011
![Page 92: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/92.jpg)
Necessity of Non-computable Reals
• Another point in Davis’ argument is that almost all hypercomputation models require Physics to give them a Turing-uncomputable real number.
• This is false. Quite a large number of hypercomputation models don’t require non-computable reals and roughly fall into the following categories
• Infinite time Turing Machines
• Zeus Machines
• Kieu-type Quantum Computation
Thursday, June 9, 2011
![Page 93: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/93.jpg)
Science-based Arguments: A Meta Analysis of Davis and friends
Thursday, June 9, 2011
![Page 94: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/94.jpg)
Science-based Arguments: A Meta Analysis of Davis and friends
The Main Case Science of Sciences Part 1: Chain Store Paradox Part 2: Turing-level Actors Part 3:MDL
Computational Learning Theory
CLT-based Model of Science
σ ∈ SEQ
i o
Mi, i ∈ NS
L
such that Mi accepts L
T = u0, u1,#,#,#, u2 M3
(r.e.)
Bringsjord, Eberbach, Naveen, Yang Might the Rigorous Modeling of Economic Phenomena Require Hypercomputation?
Thursday, June 9, 2011
![Page 95: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/95.jpg)
SoS
Thursday, June 9, 2011
![Page 96: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/96.jpg)
SoS• A language L is a set of finite strings from a
finite alphabet Σ.
Thursday, June 9, 2011
![Page 97: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/97.jpg)
SoS• A language L is a set of finite strings from a
finite alphabet Σ.
• Nature represented by some language Lt.
Thursday, June 9, 2011
![Page 98: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/98.jpg)
SoS• A language L is a set of finite strings from a
finite alphabet Σ.
• Nature represented by some language Lt.
• The scientist is presented strings one by one from Lt by Nature.
Thursday, June 9, 2011
![Page 99: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/99.jpg)
SoS• A language L is a set of finite strings from a
finite alphabet Σ.
• Nature represented by some language Lt.
• The scientist is presented strings one by one from Lt by Nature.
• The scientist has to correctly identify Lt by output i such in some programming system v, Wi
v = Lt. Wiv denotes the halting set of the v-
program i.
Thursday, June 9, 2011
![Page 100: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/100.jpg)
SoS
Thursday, June 9, 2011
![Page 101: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/101.jpg)
SoS
• A particular infinite sequence of strings given by nature is called a text.
Thursday, June 9, 2011
![Page 102: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/102.jpg)
SoS
• A particular infinite sequence of strings given by nature is called a text.
• The scientist is said to identify a language L if he/she can produce the correct hypothesis after a finite number of mistakes for all texts of L.
Thursday, June 9, 2011
![Page 103: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/103.jpg)
SoS
• A particular infinite sequence of strings given by nature is called a text.
• The scientist is said to identify a language L if he/she can produce the correct hypothesis after a finite number of mistakes for all texts of L.
• The scientist is said to identify a class of languages L if he/she can identify all languages in L.
Thursday, June 9, 2011
![Page 104: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/104.jpg)
Identifying machines in nature
Thursday, June 9, 2011
![Page 105: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/105.jpg)
Identifying machines in nature
• The formalism can be used to identify machines in nature.
Thursday, June 9, 2011
![Page 106: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/106.jpg)
Identifying machines in nature
• The formalism can be used to identify machines in nature.
• We are given a black box machine and the set of numbers the machine halts on.
Thursday, June 9, 2011
![Page 107: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/107.jpg)
Identifying machines in nature
• The formalism can be used to identify machines in nature.
• We are given a black box machine and the set of numbers the machine halts on.
• Our goal is to identify the language the machine halts on.
Thursday, June 9, 2011
![Page 108: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/108.jpg)
Identifying machines in nature
Thursday, June 9, 2011
![Page 109: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/109.jpg)
Identifying machines in nature
• Allow the possibility of the language K
Thursday, June 9, 2011
![Page 110: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/110.jpg)
Identifying machines in nature
• Allow the possibility of the language K
• K={i | i ∉ Wiv}, the non-recursive set of indices of all machines which do not halt on their own index.
Thursday, June 9, 2011
![Page 111: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/111.jpg)
Identifying machines in nature
• Allow the possibility of the language K
• K={i | i ∉ Wiv}, the non-recursive set of indices of all machines which do not halt on their own index.
• Assume a black-box machine H.
Thursday, June 9, 2011
![Page 112: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/112.jpg)
Identifying machines in nature
• Allow the possibility of the language K
• K={i | i ∉ Wiv}, the non-recursive set of indices of all machines which do not halt on their own index.
• Assume a black-box machine H.
• Assume that for all the numbers n that the machine H has halted on, it has been proved that n∈K.
Thursday, June 9, 2011
![Page 113: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/113.jpg)
Identifying machines in nature
Thursday, June 9, 2011
![Page 114: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/114.jpg)
Identifying machines in nature
• Any rational scientist in this situation will admit the possibility Lt = K.
Thursday, June 9, 2011
![Page 115: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/115.jpg)
Identifying machines in nature
• Any rational scientist in this situation will admit the possibility Lt = K.
• The set of hypotheses for a rational scientist is then Lhyp+K =Lhyp + K where Lhyp= {Kfin | Kfin is finite and Kfin ⊂K }
Thursday, June 9, 2011
![Page 116: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/116.jpg)
Two Lemmata
Thursday, June 9, 2011
![Page 117: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/117.jpg)
Two Lemmata• SoS1: Let FIN be the collection of all finite languages; and let
L be an infinite class of languages. Then L+FIN is not identifiable by any scientist.
Thursday, June 9, 2011
![Page 118: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/118.jpg)
Two Lemmata• SoS1: Let FIN be the collection of all finite languages; and let
L be an infinite class of languages. Then L+FIN is not identifiable by any scientist.
• SoS2: A scientist is said to be self-monitoring if it can signal its own convergence, the point in the text when the scientist produces its final conjecture.
Thursday, June 9, 2011
![Page 119: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/119.jpg)
Two Lemmata• SoS1: Let FIN be the collection of all finite languages; and let
L be an infinite class of languages. Then L+FIN is not identifiable by any scientist.
• SoS2: A scientist is said to be self-monitoring if it can signal its own convergence, the point in the text when the scientist produces its final conjecture.
• No self-monitoring scientist identifies FIN.
Thursday, June 9, 2011
![Page 120: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/120.jpg)
Two Lemmata• SoS1: Let FIN be the collection of all finite languages; and let
L be an infinite class of languages. Then L+FIN is not identifiable by any scientist.
• SoS2: A scientist is said to be self-monitoring if it can signal its own convergence, the point in the text when the scientist produces its final conjecture.
• No self-monitoring scientist identifies FIN.
• Since the SoS formalism lacks any notion of declarative statements, we take the notion of the self-monitoring signal to be a declaration of the statement that the scientist knows that the final conjecture has been produced.
Thursday, June 9, 2011
![Page 121: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/121.jpg)
Therefore,
Thursday, June 9, 2011
![Page 122: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/122.jpg)
Therefore,
• By SoS1, No scientist can identify Lhyp+K
Thursday, June 9, 2011
![Page 123: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/123.jpg)
Therefore,
• By SoS1, No scientist can identify Lhyp+K
• Even if a scientist a priori rejects the possibility of K (like Davis), by SoS2 the scientist cannot be self-monitoring.
Thursday, June 9, 2011
![Page 124: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/124.jpg)
Therefore,
• By SoS1, No scientist can identify Lhyp+K
• Even if a scientist a priori rejects the possibility of K (like Davis), by SoS2 the scientist cannot be self-monitoring.
Thursday, June 9, 2011
![Page 125: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/125.jpg)
Therefore,
• By SoS1, No scientist can identify Lhyp+K
• Even if a scientist a prior rejects the possibility of K (like Davis), by SoS2 the scientist cannot be self-monitoring.
Thursday, June 9, 2011
![Page 126: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/126.jpg)
Therefore,
• By SoS1, No scientist can identify Lhyp+K
• Even if a scientist a prior rejects the possibility of K (like Davis), by SoS2 the scientist cannot be self-monitoring.
Any one, including Davis, who claims that Lhyp is the case, are stating the absurd when they also claim that all the dynamics behind H are known and finalized.
Thursday, June 9, 2011
![Page 127: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/127.jpg)
Our universe and H
Thursday, June 9, 2011
![Page 128: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/128.jpg)
Our universe and H
• Is represented by some element of Lhyp+K
Thursday, June 9, 2011
![Page 129: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/129.jpg)
Our universe and H
• Is represented by some element of Lhyp+K
• H represents harnessable hypercomputation.
Thursday, June 9, 2011
![Page 130: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/130.jpg)
Attack on η3
Thursday, June 9, 2011
![Page 131: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/131.jpg)
Attack on η3
η3: There are hypercomputational cognitive phenomena that may or may not be harnessable. In this case, the functions representing the dynamics of such phenomena are of course Turing-uncomputable.
Thursday, June 9, 2011
![Page 132: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/132.jpg)
Our response:
Thursday, June 9, 2011
![Page 133: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/133.jpg)
Our response:
• Parallels that of the SoS argument.
Thursday, June 9, 2011
![Page 134: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/134.jpg)
Our response:
• Parallels that of the SoS argument.
• Replace H with a cognitive agent C
Thursday, June 9, 2011
![Page 135: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/135.jpg)
Digressions in the Myth Construction
Thursday, June 9, 2011
![Page 136: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/136.jpg)
Digressions in the Myth Construction
• Perpetual Motion Machines
Thursday, June 9, 2011
![Page 137: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/137.jpg)
Digressions in the Myth Construction
• Perpetual Motion Machines
• Other theories
Thursday, June 9, 2011
![Page 138: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/138.jpg)
Perpetual Machines
Thursday, June 9, 2011
![Page 139: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/139.jpg)
Perpetual Machines
• Perpetual machines are outright prohibited by existing laws of physics.
Thursday, June 9, 2011
![Page 140: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/140.jpg)
Perpetual Machines
• Perpetual machines are outright prohibited by existing laws of physics.
• Nothing in the existing laws prohibit hypercomputation.
Thursday, June 9, 2011
![Page 141: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/141.jpg)
Perpetual Machines
• Perpetual machines are outright prohibited by existing laws of physics.
• Nothing in the existing laws prohibit hypercomputation.
• A bit more precisely:
Thursday, June 9, 2011
![Page 142: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/142.jpg)
Perpetual Machines
• Perpetual machines are outright prohibited by existing laws of physics.
• Nothing in the existing laws prohibit hypercomputation.
• A bit more precisely:
• Ψhyper = Hypercomputer computers exist
Thursday, June 9, 2011
![Page 143: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/143.jpg)
Perpetual Machines
• Perpetual machines are outright prohibited by existing laws of physics.
• Nothing in the existing laws prohibit hypercomputation.
• A bit more precisely:
• Ψhyper = Hypercomputer computers exist
• Ψperp = Perpetual motion machines exist
Thursday, June 9, 2011
![Page 144: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/144.jpg)
Perpetual Machines
Thursday, June 9, 2011
![Page 145: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/145.jpg)
Perpetual Machines
• Let Γ represent an axiomatization of all existing laws of physics
Thursday, June 9, 2011
![Page 146: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/146.jpg)
Perpetual Machines
• Let Γ represent an axiomatization of all existing laws of physics
• Then we have at least
Thursday, June 9, 2011
![Page 147: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/147.jpg)
Perpetual Machines
• Let Γ represent an axiomatization of all existing laws of physics
• Then we have at least
In most analyses in CLT, no computational limits are placed on the learner F. Only information-theoretic properties of F are considered. So the scientist F can well be hypercomputational.
Due to the dual nature of CLT/SoS, all of the argument from §3.5 carries over to this section.The only difference is that H is now a cognitive process instead of a physical process. H couldbe humans computing values in K̄; or, with appropriate reductions and translations, humanscomputing values of the busy-beaver function.8
5 On Digressions
In this section we look at a couple of digressions in the paper and show that the claims in them donot hold.
5.1 Comparisons with Perpetual Motion Machines
Davis starts the paper with an unhelpful comparison of hypercomputation research with the searchfor a perpetual motion machine. This comparison falls flat.
First, Davis does not seem to know that while perpetual motion machines are outright excludedby existing laws of physics (Rao 2004), nothing in the existing laws prohibit the existence or con-struction and harnessing of a hypercomputer (Stannett 2005). The following semi-formal argumentmakes this weakness in the comparison more explicit. Let ψperp represent some formalization of thestatement “Perpetual machines exist.” in some propositional modal logic and let ψhyper representthe statement “Hypercomputers exist.” Let Γ represent an axiomatization of all existing physicallaws. Then it is the case that
Γ ! ¬ψperp
Γ ! "ψhyper
Also, via Stannett’s analysis in (Stannett 2005) we can even claim that
Γ ! ψhyper
The second issue with Davis’s comparison is that while the laws of physics are empirical, andcorrespondingly can be justified only inductively, a possible proof/disproof of a finite hypercomputerwill be deductive, following from the axioms of set theory.
5.2 Other Theories
Davis mentions the richness of the field of the study of Turing degrees and complexity theory.There is no denying such richness; indeed, this richness is one of the reasons we teach the materialin question. When talking about “oracles,” Turing imagined a black box with no internal structurewhatsoever. Davis follows the same approach in the textbook one of us has long used to teachtheoretical computer science: (Davis et al. 1994). This approach (and we specifically follow thestraightforward quantifier-based one, since our students come with a background in formal logic)is fine if one is concerned exclusively with for example a bare-bones hierarchy. But one of thepursuits of hypercomputation research is to study the internal structure of abstract devices whichcan hypercompute. This is a rich field of study that comes with its own set of theorems for aparticular machine, and serves quite a different purpose than the study of Turing degrees, whichsteadfastly leaves aside the details of any possible mechanism.9
8See (Bringsjord et al. 2006) for another cognitive argument based on the the busy-beaver function.9For an overview of the theoretical power of various machines, see Ord’s (2006) overview.
7
Thursday, June 9, 2011
![Page 148: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/148.jpg)
Theoretical Richness
Thursday, June 9, 2011
![Page 149: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/149.jpg)
Theoretical Richness
• Turing computation theory => Complexity theory & Turing degrees
Thursday, June 9, 2011
![Page 150: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/150.jpg)
Theoretical Richness
• Turing computation theory => Complexity theory & Turing degrees
• Hypercomputation => Mathematical models of hypercomputers, ``concretizes” Turing degrees
Thursday, June 9, 2011
![Page 151: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/151.jpg)
Theoretical Richness
• Turing computation theory => Complexity theory & Turing degrees
• Hypercomputation => Mathematical models of hypercomputers, ``concretizes” Turing degrees
• Hypercomputation could possibly be useful in formal learning theory
Thursday, June 9, 2011
![Page 152: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/152.jpg)
Theoretical Richness
• Turing computation theory => Complexity theory & Turing degrees
• Hypercomputation => Mathematical models of hypercomputers, ``concretizes” Turing degrees
• Hypercomputation could possibly be useful in formal learning theory
Thursday, June 9, 2011
![Page 153: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/153.jpg)
Theoretical Richness
• Turing computation theory => Complexity theory & Turing degrees
• Hypercomputation => Mathematical models of hypercomputers, ``concretizes” Turing degrees
• Hypercomputation could possibly be useful in formal learning theory
Consideration of non-computable scientists thereby facilitates the analysis of proofs, making it clearer which assumptions carry the burden. (Jain et al. “Systems that Learn ”1999, 35)
Thursday, June 9, 2011
![Page 154: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/154.jpg)
Thursday, June 9, 2011
![Page 155: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/155.jpg)
Some Objections ...
Thursday, June 9, 2011
![Page 156: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/156.jpg)
Objection 1
Thursday, June 9, 2011
![Page 157: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/157.jpg)
Objection 1
• “You write that ‘A rather large number of physical and mathematical models of hypercomputation have been put forward so far.’ Well yes, but none of them, when actually physically implemented, can do anything that a Turing machine couldn’t so far. If yes, show me the function. The burden of proof is of course on your side!”
Thursday, June 9, 2011
![Page 158: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/158.jpg)
Our response
Thursday, June 9, 2011
![Page 159: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/159.jpg)
Our response
• Just a recapitulation of Davis’ argument against η2
Thursday, June 9, 2011
![Page 160: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/160.jpg)
Our response
• Just a recapitulation of Davis’ argument against η2
• Even if a physical hypercomputer is impossible in the actual world, the hypercomputation field survives via the abstract mathematical and cognitive domains (η1 and η3)
Thursday, June 9, 2011
![Page 161: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/161.jpg)
Objection 2
Thursday, June 9, 2011
![Page 162: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/162.jpg)
Objection 2
• “You tell us that ‘Davis ignores numerous other models of hypercomputation.’ Yes, but because they all boil down to infinite resources in some form, infinite time, or some other wacky stuff.”
Thursday, June 9, 2011
![Page 163: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/163.jpg)
Our response: Flaw 1
Thursday, June 9, 2011
![Page 164: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/164.jpg)
Our response: Flaw 1• The objection is a blanket statement that all
hypercomputation models require infinitary processing.
Thursday, June 9, 2011
![Page 165: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/165.jpg)
Our response: Flaw 1• The objection is a blanket statement that all
hypercomputation models require infinitary processing.
• Unwarranted statement without a proof.
Thursday, June 9, 2011
![Page 166: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/166.jpg)
Our response: Flaw 1• The objection is a blanket statement that all
hypercomputation models require infinitary processing.
• Unwarranted statement without a proof.
• From the CTT experience, difficult to prove such statements
Thursday, June 9, 2011
![Page 167: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/167.jpg)
Our response: Flaw 1• The objection is a blanket statement that all
hypercomputation models require infinitary processing.
• Unwarranted statement without a proof.
• From the CTT experience, difficult to prove such statements
• Only a mythical belief exists in that all hypercomputation require infinite resources.
Thursday, June 9, 2011
![Page 168: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/168.jpg)
Our response: Flaw 2
Thursday, June 9, 2011
![Page 169: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/169.jpg)
Our response: Flaw 2
• Almost all formal sciences deal with infinite structures and processes.
Thursday, June 9, 2011
![Page 170: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/170.jpg)
Our response: Flaw 2
• Almost all formal sciences deal with infinite structures and processes.
• Our critic will then label infinitary logics as wacky.
Thursday, June 9, 2011
![Page 171: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/171.jpg)
Our response: Flaw 2
• Almost all formal sciences deal with infinite structures and processes.
• Our critic will then label infinitary logics as wacky.
• Infinitary logics are essential for formal mathematics.
Thursday, June 9, 2011
![Page 172: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/172.jpg)
Our response: Flaw 2
• Almost all formal sciences deal with infinite structures and processes.
• Our critic will then label infinitary logics as wacky.
• Infinitary logics are essential for formal mathematics.
• E.g. characterizing abelian group properties.
Thursday, June 9, 2011
![Page 173: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/173.jpg)
Our response: Flaw 3
Thursday, June 9, 2011
![Page 174: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/174.jpg)
Our response: Flaw 3
• “You tell us that ‘Davis ignores numerous other models of hypercomputation.’ Yes, but because they all boil down to infinite resources in some form, infinite time, or some other wacky stuff.”
Thursday, June 9, 2011
![Page 175: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/175.jpg)
Our response: Flaw 3
• “You tell us that ‘Davis ignores numerous other models of hypercomputation.’ Yes, but because they all boil down to infinite resources in some form, infinite time, or some other wacky stuff.”
Thursday, June 9, 2011
![Page 176: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/176.jpg)
Our response: Flaw 3
• “You tell us that ‘Davis ignores numerous other models of hypercomputation.’ Yes, but because they all boil down to infinite resources in some form, infinite time, or some other wacky stuff.”
Thursday, June 9, 2011
![Page 177: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/177.jpg)
Our response: Flaw 3
• “You tell us that ‘Davis ignores numerous other models of hypercomputation.’ Yes, but because they all boil down to infinite resources in some form, infinite time, or some other wacky stuff.”
So even Turing machines are “wacky” as they require an infinite tape!
Thursday, June 9, 2011
![Page 178: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/178.jpg)
Objection 3
Thursday, June 9, 2011
![Page 179: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/179.jpg)
Objection 3
• “Do the authors really believe that the accelerating TM is a model worth mentioning as a physically plausible hypercomputer?!”
Thursday, June 9, 2011
![Page 180: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/180.jpg)
Our response
Thursday, June 9, 2011
![Page 181: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/181.jpg)
Our response• Yes. We believe it is physically plausible.
Thursday, June 9, 2011
![Page 182: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/182.jpg)
Our response• Yes. We believe it is physically plausible.
• This has little to do with flaws in Davis’ reasoning.
Thursday, June 9, 2011
![Page 183: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/183.jpg)
Our response• Yes. We believe it is physically plausible.
• This has little to do with flaws in Davis’ reasoning.
• Support for our belief:
Thursday, June 9, 2011
![Page 184: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/184.jpg)
Our response• Yes. We believe it is physically plausible.
• This has little to do with flaws in Davis’ reasoning.
• Support for our belief:
• Xia’s result that, under certain conditions, a body can be accelerated to infinite time.
Thursday, June 9, 2011
![Page 185: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/185.jpg)
Our response• Yes. We believe it is physically plausible.
• This has little to do with flaws in Davis’ reasoning.
• Support for our belief:
• Xia’s result that, under certain conditions, a body can be accelerated to infinite time.
• Even if we are wrong that the model is physically possible:
Thursday, June 9, 2011
![Page 186: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/186.jpg)
Our response• Yes. We believe it is physically plausible.
• This has little to do with flaws in Davis’ reasoning.
• Support for our belief:
• Xia’s result that, under certain conditions, a body can be accelerated to infinite time.
• Even if we are wrong that the model is physically possible:
• We are sure that it’s logically possible that it’s physically possible.
Thursday, June 9, 2011
![Page 187: The Myth of ‘The Myth of Hypercomputation’kryten.mm.rpi.edu/PRES/TURKUHYPER/NSG_SB_MoMoH... · 2011. 6. 9. · The real myth is that Davis’ argument(s) is/are sound. Thursday,](https://reader036.vdocuments.us/reader036/viewer/2022071507/6127c7f47ecc007bfc692576/html5/thumbnails/187.jpg)
Our response• Yes. We believe it is physically plausible.
• This has little to do with flaws in Davis’ reasoning.
• Support for our belief:
• Xia’s result that, under certain conditions, a body can be accelerated to infinite time.
• Even if we are wrong that the model is physically possible:
• We are sure that it’s logically possible that it’s physically possible.
• The above proposition is enough for our defense against Davis’ stand.
Thursday, June 9, 2011