8 citations · 16 across the 22 of their papers we have counts for
11 papers · 1 filter
Can Laplace's formula model a deterministic universe that is irreducibly probabilistic?
Bhupinder Singh Anand
If we assume the Thesis that any classical Turing machine T, which halts on every n-ary sequence of natural numbers as input in a determinate time t(n), determines a PA-provable fo…
How definitive is the standard interpretation of Goedel's Incompleteness Theorem?
Bhupinder Singh Anand
Standard interpretations of Goedel's "undecidable" proposition, [(Ax)R(x)], argue that, although [~(Ax)R(x)] is PA-provable if [(Ax)R(x)] is PA-provable, we may not conclude from t…
Why we must heed Wittgenstein's "notorious paragraph"
Bhupinder Singh Anand
We argue that, although Wittgenstein's reservations on Goedel's interpretation of his own formal reasoning are, indeed, of historical importance, the uneasiness that academicians a…
Is the Halting probability a Dedekind real number?
Bhupinder Singh Anand
In a recent historical overview, Cristian S. Calude, Elena Calude, and Solomon Marcus identify eight stages in the development of the concept of a mathematical proof in support of…
Can we express every transfinite concept constructively?
Bhupinder Singh Anand
In a forthcoming book, professional computer scientist and physicist Paul Budnik presents an exposition of classical mathematical theory as the backdrop to an elegant thesis: we ca…
The formal roots of Platonism
Bhupinder Singh Anand
We present some arguments for the thesis that a set-theoretic inspired faith, in the ability of intuitive truth to faithfully reflect relationships between elements of a Platonic u…