This article has not yet been rated on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||
|
"(The halting problem for Zeno machines cannot be solved using a Zeno machine, however)."
Is this true? Don't all Zeno machines halt, making the halting function trivially f(T, i) = 1 for any Zeno machine T with any input i? -- NoizHed 01:06, 20 March 2006 (UTC)
"(The halting problem for Zeno machines cannot be solved using a Zeno machine, however)."
of course its true it says on the paper. have you actually read the paper you cite? —Preceding unsigned comment added by 138.250.193.98 ( talk) 08:40, 6 November 2009 (UTC)
Abstract
This paper reviews the Church–Turing Thesis (or rather, theses) with reference to their origin and application and considers some models of “hypercomputation”, concentrating on perhaps the most straight-forward option: Zeno machines (Turing machines with accelerating clock). The halting problem is briefly discussed in a general context and the suggestion that it is an inevitable companion of any reasonable computational model is emphasised. It is suggested that claims to have “broken the Turing barrier” could be toned down and that the important and well-founded rôle of Turing computability in the mathematical sciences stands unchallenged. —Preceding unsigned comment added by 138.250.193.98 ( talk) 08:45, 6 November 2009 (UTC)
I haven't read the paper, but my guess would be that a ZM is allowed to do \omega steps of computation, and then keep going; if it can do step number \omega, \omega+1, ..., then the halting question seems like it's probably sensible. Maybe someone can check the source and update the main article with a clarification. Joule36e5 ( talk) 19:30, 6 August 2012 (UTC)
A ZM can solve the TM-halting problem. So can a TM-Oracle, by definition. Does a ZM have equivalent computational power to a TM augmented with a TM-Oracle? Joule36e5 ( talk) 19:40, 6 August 2012 (UTC)
A Zeno machine can solve the halting problem for a Turing machine. What can solve the halting problem for a Zeno machine? -32ieww 10:04PM 11/20/2015 NY time 32ieww ( talk) 03:04, 21 November 2015 (UTC)
This article has not yet been rated on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||
|
"(The halting problem for Zeno machines cannot be solved using a Zeno machine, however)."
Is this true? Don't all Zeno machines halt, making the halting function trivially f(T, i) = 1 for any Zeno machine T with any input i? -- NoizHed 01:06, 20 March 2006 (UTC)
"(The halting problem for Zeno machines cannot be solved using a Zeno machine, however)."
of course its true it says on the paper. have you actually read the paper you cite? —Preceding unsigned comment added by 138.250.193.98 ( talk) 08:40, 6 November 2009 (UTC)
Abstract
This paper reviews the Church–Turing Thesis (or rather, theses) with reference to their origin and application and considers some models of “hypercomputation”, concentrating on perhaps the most straight-forward option: Zeno machines (Turing machines with accelerating clock). The halting problem is briefly discussed in a general context and the suggestion that it is an inevitable companion of any reasonable computational model is emphasised. It is suggested that claims to have “broken the Turing barrier” could be toned down and that the important and well-founded rôle of Turing computability in the mathematical sciences stands unchallenged. —Preceding unsigned comment added by 138.250.193.98 ( talk) 08:45, 6 November 2009 (UTC)
I haven't read the paper, but my guess would be that a ZM is allowed to do \omega steps of computation, and then keep going; if it can do step number \omega, \omega+1, ..., then the halting question seems like it's probably sensible. Maybe someone can check the source and update the main article with a clarification. Joule36e5 ( talk) 19:30, 6 August 2012 (UTC)
A ZM can solve the TM-halting problem. So can a TM-Oracle, by definition. Does a ZM have equivalent computational power to a TM augmented with a TM-Oracle? Joule36e5 ( talk) 19:40, 6 August 2012 (UTC)
A Zeno machine can solve the halting problem for a Turing machine. What can solve the halting problem for a Zeno machine? -32ieww 10:04PM 11/20/2015 NY time 32ieww ( talk) 03:04, 21 November 2015 (UTC)