55 citations · 60 across the 5 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2003★ 3 cited
The Diagonal Method and Hypercomputation
Toby Ord, Tien D. Kieu
The diagonal method is often used to show that Turing machines cannot solve their own halting problem. There have been several recent attempts to show that this method also exposes…
math.LO2002★ 55 cited
Hypercomputation: computing more than the Turing machine
Toby Ord
Due to common misconceptions about the Church-Turing thesis, it has been widely assumed that the Turing machine provides an upper bound on what is computable. This is not so. The n…