Liste des Groupes | Revenir à theory |
Am Wed, 16 Oct 2024 12:42:43 -0500 schrieb olcott:That Decide_Halting() is not pure at most shows that itOn 10/16/2024 12:24 PM, joes wrote:Am Wed, 16 Oct 2024 12:13:12 -0500 schrieb olcott:On 10/16/2024 3:05 AM, Mikko wrote:On 2024-10-16 03:52:00 +0000, olcott said:On 10/15/2024 9:11 PM, Richard Damon wrote:On 10/15/24 8:39 AM, olcott wrote:On 10/15/2024 4:58 AM, joes wrote:Am Mon, 14 Oct 2024 20:12:37 -0500 schrieb olcott:On 10/14/2024 6:50 PM, Richard Damon wrote:On 10/14/24 12:05 PM, olcott wrote:On 10/14/2024 6:21 AM, Richard Damon wrote:Decide_Halting() is not pure.Quite a few experts agree that the purity of a function ensures itsSays the one with an if(Root).In other words you think that functions that rely on global data suchThere is no known way to construct one that isn't. No computer canA termination analyzer need not be a Turing computable function.But it needs to be computationally equivalent to one to ask aboutEven people of low intelligence that are not trying to be asCan you please give the date and time? Did you also explicitlyBut, you claim to be working on that Halting Problem,I quit claiming this many messages ago and you didn't bother to
notice.
disclaim it or just silently leave it out?
disagreeable as possible would be able to notice that a specified
C function is not a Turing machine.
Termination.
execute a function that is not Turing computable.
that they are not a pure function of their inputs are A OK?
Apart from that, purity has nothing to do with computability.
computability. It was like pulling teeth to get this out of them. It was
like the computer science experts desperately wanted to remain totally
ignorant of mapping computer science to software engineering.
Les messages affichés proviennent d'usenet.