Liste des Groupes | Revenir à theory |
On 10/15/24 11:52 PM, olcott wrote:A c function terminates when it reaches its "return"On 10/15/2024 9:11 PM, Richard Damon wrote:Strange, since any function that meets the requireemntOn 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:On 10/14/24 5:53 AM, olcott wrote:On 10/14/2024 3:21 AM, Mikko wrote:On 2024-10-13 12:49:01 +0000, Richard Damon said:On 10/12/24 8:11 PM, olcott wrote:Can you please give the date and time? Did you also explicitly disclaimI quit claiming this many messages ago and you didn't bother to notice.Trying to change to a different analytical framework than the one thatBut, you claim to be working on that Halting Problem,
I am stipulating is the strawman deception. *Essentially an
intentional fallacy of equivocation error*
it or just silently leave it out?
>
Even people of low intelligence that are not trying to
be as disagreeable as possible would be able to notice
that a specified C function is not a Turing machine.
But it needs to be computationally equivalent to one to ask about Termination.
>
Not at all.
https://en.wikipedia.org/wiki/Pure_function
A termination analyzer need not be a Turing computable function.
the function return values are identical for identical arguments (no variation with local static variables, non-local variables, mutable reference arguments or input streams, i.e., referential transparency),
Is the equivalent of a Turing Machine.
>You can't stipulate that something is a standard.
*According to the industry standard definitions that I stipulated*
Les messages affichés proviennent d'usenet.