Search Ideas

Empty criticism, issue not addressed. The checkbox provides no value and delays badges, limiting the amount one can interact with the site.

I think that you've made something really great here with Veritula, I'm naturally loving it. It would be a shame to make the experience taxing as one must be conscious of AI scores. I looked at the results of the analysis you did on my criticism. It was practically a sentence and a bit, that was adjusted by AI, as I mentioned it was the result of a speech to text tool, I don't type much anymore, it's a part of my workflow (a % score also does not consider the fact that replies are usually short. So one sentence can be a significant)

I think, especially on a platform like this, users don't enjoy feeling restrained. The problem with AI is that, used recklessly, it creates low quality ideas/criticism (many times because it does not actually address a problem so progress stalls). When one does not have a reliable system with which to consider a response as AI, the label and its enforcement becomes worthless. This reminds me of your criticism of hard to vary, in that because we cannot program it we do not understand it. Your rule on AI and labelling seems to suffer from the same issue.

I used Wispr Flow, speech-to-text. Tough line to draw.

Thanks. I agree that knowing an algorithm and understanding why it is impossible are different things. The theorem says there is no universal halting algorithm to know.

The contradiction arises when we assume that an algorithm satisfying those requirements exists. The conclusion is that no algorithm meets those requirements. Describing such an algorithm as “unknowable” seems to treat it as something that exists but is inaccessible to us, when its existence is precisely what the theorem rules out.

Consider an exact circle made from finitely many straight line segments. We will never discover what such a figure looks like because no figure satisfies those requirements. Calling its appearance “unknowable” seems to turn the nonexistence of an object into a limitation on our knowledge of it.

In the same way, “we will never know a universal halting algorithm” amounts to saying that we will never discover an algorithm that does not exist, based on our current theories. If that is all you mean by “unknowable,” I think the only thing we would not agree about is the definition of “unknowable” itself.

It is unclear to me why uncomputable should mean unknowable. The halting problem shows that no algorithm can correctly decide, for every program and input, whether the program will halt. Yet we can understand why such an algorithm is impossible, and we can determine the answer in particular cases. Are you equating the impossibility of a universal computational procedure with the impossibility of knowledge? What exactly is being claimed to be unknowable here?