Liste des Groupes | Revenir à c theory |
Am Wed, 16 Oct 2024 12:13:12 -0500 schrieb olcott:Quite a few experts agree that the purity of a functionOn 10/16/2024 3:05 AM, Mikko wrote:Says the one with an if(Root).On 2024-10-16 03:52:00 +0000, olcott said:In other words you think that functions that rely on global data suchOn 10/15/2024 9:11 PM, Richard Damon wrote:There is no known way to construct one that isn't. No computer canOn 10/15/24 8:39 AM, olcott wrote:Not at all.On 10/15/2024 4:58 AM, joes wrote:But it needs to be computationally equivalent to one to ask aboutAm Mon, 14 Oct 2024 20:12:37 -0500 schrieb olcott:Even people of low intelligence that are not trying to be asOn 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 explicitlyI quit claiming this many messages ago and you didn't bother toTrying to change to a different analytical framework than theBut, you claim to be working on that Halting Problem,
one that I am stipulating is the strawman deception.
*Essentially an intentional fallacy of equivocation error*
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.
https://en.wikipedia.org/wiki/Pure_function A termination analyzer
need not be a Turing computable function.
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.
Les messages affichés proviennent d'usenet.