Activity
#3553·Dennis HackethalOP revised about 16 hours agoIsn't every theory infinitely underspecified ?
No. For example, the theory of addition is sufficiently specified: we have enough info to implement an algorithm of addition on a computer, then run it, test it, correct errors with it, and so on.
Yes. When you have program you can test a concept (incl. whether it is sufficiently defined to allow a program in the first place). But the other way around does not work: "If one does not have a program, then the concept is underspecified".
One way to program HTV could be to feed 2 explanations of the same phenomenon (in the form of text strings) to an LLM that is trained on seeking ETV patterns in text (things of the form "and then -all of a sudden- X happened ..." or "and Y (e.g. tears of a God) is kind of like Z (e.g. rain)" ) and seeking HTV patterns in text (e.g. Y happened because of X, with the LLM evaluating whether it is actual causation, whether if X did not happen, Y could not happen).And then the LLM could rank score the HTV-ness of each string (as a first approximation)