Wikipedia article mentioned : Hypercomputation
The third paragraph starts off with:
Technically, the output of a random Turing machine is uncomputable; however, most hypercomputing literature focuses instead on the computation of deterministic, rather than random, uncomputable functions.
Furthermore, according to another article, Random Turing Machine:
In theoretical computer science, a probabilistic Turing machine is a non-deterministic Turing machine that chooses between the available transitions at each point according to some probability distribution.
Am I then correct to say, that in this context, the word random actually means unknown secondary input?
Because from my understanding:
- Probability is a well defined area of mathematics
- Randomness is rather a layman's term for "I don't really know what's going on here" or rather "I can't know what's going on here".
Sort of like seeds in PRNGs, an argument can be made that PRNGs are not random at all, after all, the very word pseudo-random is an oxymoron. Given an input and the "hidden input" (seed) I can get the same input back every time.
So in this context, is the output of a RTM reaaaallly uncomputable?