Re:Church-Turing Thesis Cannot Possibly Be True [video]
by tathougies on Friday October 19, 2018 @06:34PM
(#18260587)
My representation is countable, but not because of the fact it uses the algebraic term 'r * r' in its definition of sqrt(2).
My representation is based on dedekind cuts, implemented in Haskell, which is based on the lambda calculus. There are countably many lamdda terms. Thus, I can only represent countably many real numbers. My representation can store all the computable numbers, but there are computable numbers that are not algebraic.
For example, e is not algebraic, but it is computable. Here is a representation of e
My representation is based on dedekind cuts, implemented in Haskell, which is based on the lambda calculus. There are countably many lamdda terms. Thus, I can only represent countably many real numbers. My representation can store all the computable numbers, but there are computable numbers that are not algebraic.
For example, e is not algebraic, but it is computable. Here is a representation of e