function Timeout(reflex, reject){
  this.interval = this.interval || arguments[3] ?? 5000
 var pace = setInterval(reflex,this.interval)
  if ('maximum' in this) setTimeout(()=>{
    clearInterval(pace)
   reject(`${this.constructor.name} reached`)
  }, Math.max(this.maximum, this.interval * this.cap))
}

Timeout.seed = function(retry,flex,off){try{off = off ?? (msg)=>{throw Timeout.except ? new Timeout.except(msg) : msg}
  this.prototype.interval = flex
 return new Timeout(retry,off)
}catch(flex){return off(flex)}finally{
  this.prototype.interval = 0
}}

>>107181655
wat

>>107181273
Halting problem is a imaginary problem that doesn't exist in the real world. Runtime will be limited by hardware and software lifespans, energy availability, and user interest.

>>107182080
A short range network failure should not appear stochastic after success, let your Promise not get in the way of correct UI handling.

Yes I know this is a meme thread but the halting problem is important because it shows there are logically well-defined mathematical properties (e.g. whether a program will eventually end or not) that are not computable (as that would cause a contradiction).

I understand that in your meme-riddled mind you meant to misunderstand the phrase 'halting problem' to mean the halting is the problem but that actually refers to the problem of finding out whether a program will halt or not. Infinite loops are an easy case. They never halt. They are infinite.

The obvious question is to then ask if it's possible for all properties to be computable as long as you ban the word 'program'. The issue then might be that you can define the idea of a program or a turing machine and then treat that purely as a mathematical object, and ask it about that. I wonder if there's some way you can get around this, and if you could, then if you could compute everything?

I.e., is the only source of non-computability this kind of self-reference? Or are there other 'sources' of non-computability? I am not sure about the answer to this question and wait patiently for a kind, quiet and wise anon to tell all of us.

>>107182452
Whether the problem itself is important isn't really the point. The point is that a fairly simple property is not computable.

I don't like computers and I think a lot of my problems are similar to computer problems because I look at the world like a computer would, in many ways. But my problems are all to do with other people. I barely speak to anyone and when I do it troubles me and frankly I think I should speak to them less. I am not autistic but I think trying those kinds of coping mechanisms might help me. I exhibit symptoms of all sorts of mental illnesses. Or maybe the running theme is anxiety. I'm so tense all the time. I'm so afraid.

File: 1745248505841160.jpg (955 KB, 1408x768)

955 KB JPG

>>107184160
This post went places

>>107184302
What is this a picture of? Is this a kidney stone or something? I don't know much about biology.

File: 389-relativiteit.png (2.62 MB, 1200x1153)

2.62 MB PNG

>>107184160
Buy Gödel, Escher, Bach and read it right now. You'll love it.

>>107184840
inside of a garloid post mortem

>>107184160
Afaik there is no proof that a computational model that's stronger than a Turing machine can't exist, and the halting problem is only for Turing machines and equivalent models.
Everyone just seems to assume that there are no stronger models, because TMs are equivalent to Lambda Calculus and noone has found anything that could compute more.

There is hypercomputation, but it basically assumes a machine that can solve the halting problem and then looks at what implications that would have, it doesn't provide the actual model that could do it.

>>107184160
The point is it could apply under many very general conditions, which already has to treat any program like a mathematical object. One way to get out of contradiction range is to literally just remove any infinite loop as valid syntax in a proposed language. Any system which might return a feedback error has instant relevance for the most basic lever in control theory.

>>107184840
It's AI slop

>>107186902
Non-deterministic turing machines are stronger than turing machines and they exist.

>>107182080
magical semaphore propagation

>>107182452
can confirm: just put my custom rig to simulating the universe and it spat out scrambled eggs, base reality does not support infinite calculus.

[][][][]
[][][][]
[][][][]
[][][][]

>>107182452
Pls halp, my compiler says to input more neutronium or it will keep running and eventually deprioritize correct mold pattern heuristics for instruction development histories

File: 1758697353242628.png (245 KB, 585x617)

245 KB PNG

>>107184160
Modeling epistemology like pic related is useful for standard models in particle physics.

As far as I'm aware, the current consensus in set theory are that truthful statements can exist with the necessary case of unprovability.

>>107181273
Computer science is not about computers. Don't worry about it.

>>107191221
>and they exist
Where.

>>107198289
I maintain a lot of mathematics for the scalar plane, we can explore together if you want an invite.

>>107184160
>Yes I know this is a meme thread but the halting problem is important because it shows there are logically well-defined mathematical properties (e.g. whether a program will eventually end or not) that are not computable (as that would cause a contradiction).
Are there any problems like that other than the the famous self-referential one in the halting problem?

>>107200024
>I maintain a lot of mathematics for the scalar plane, we can explore together if you want an invite.
what.

>>107181273
UB.

File: 1756544422673177.jpg (1008 KB, 1024x1024)

1008 KB JPG

Epic schizo thread