I've been thinking about creating a language where it's impossible to create a constant with a known value. Thus, it's impossible to guarantee a program will work 100% of the time (though you'd be able to achieve an arbitrarily high accuracy, at the cost of bytes).
My question is, would it be allowed to use this language? Would there be some threshold, like a requirement for it to work with at least a certain probability?
I'd imagine this would be similar to golfing languages, in that they have the advantage of being designed to complete challenges more efficiently, and thus they aren't competing with other languages.
Also, from my (very very limited) understanding, isn't the result of quantum computers the most probable answer, rather than one guaranteed to be correct? In the future there may be quantum-based languages which will need a similar consensus (assuming my understanding is correct).