raoof
Joined 13 years ago
Karma
96
Submissions
56
Member since
Jun 26
Recent submissions
Comment · 2 years ago
FRACTRAN has a goto instruction so it is not a total model of computation but my claim is that Ar is a total model of computation. maybe unrolled FRACTRAN is a total model of computation too, I have to think about that
Comment · 2 years ago
the only approach to practical programming with Ar is to have external dependencies on hard to compute functions until I implement them :)
Comment · 2 years ago
in my model it's the platform job to handle the user input and your program output you just write your function and the platform calls your program for example f(time,input_data,key_a,key_b,key_c,...) . if you are very very patient and don't care about the program length you can just compute every output of your program for every possible input. according to [this](https://web.archive.org/web/20230505022436/http://page.mi.fu...) paper a single loop and four basic arithmetic operation is enough to simulate a turing machine so my idea was that to unroll the loop and my conjecture is that we don't need the loop and only four operations is enough to compute all total computable functions
Comment · 2 years ago
it takes a lot of time and patient to come up with a function that works for all n and also have a short length, let me try if I can solve this problem it may takes a few hours or days or maybe months I'll post the solution here so stay tuned. but if you want to make your life easier you can generate the function in a meta language so you can always be sure that your software does not have a halting problem
Comment · 2 years ago
(now I can reply here, let me repeat it again)
it depend how you want to display the result to the user, you can just compute a number that represent an html page showing the numbers from 1 to n
Comment · 2 years ago
(it seems like I can't reply to your last comment so I do it here)
it depend how you want to display the result to the user, you can just compute a number that represent an html page showing the numbers from 1 to n
Comment · 2 years ago
the language is obviously (at least to me) turing-complete in the limit of the program length. even if you don't buy my argument that it is also turing-complete without the limit notice that in ordinary programming you never need a function that is valid on all input because actual computers have time and memory limitation
Comment · 2 years ago
if you don't want to melt your brain :D you just precompute the value of any functions f(x) for x<n otherwise you need to be very clever I explained my idea in the link
Comment · 2 years ago
consciousness is like a joke, if you think it needs an explanation you already miss it.
I struggled with myself to convince Dennett that his conscious so much that I ended up losing it myself I hope you don't make the same mistake that I did
Comment · 3 years ago
consciousness is equivalent to the halting function h(p,n) where p is a physical process and n is time, we know how to turn a physical process into a virtual process but we don't know how to turn consciousness itself into a virtual process
Comment · 4 years ago
I can see that you can symbolically talk about the power set of (0,1) and say it's cardinality is bigger than the set itself (although I haven't studied sets and cardinalities deeply enough) but I can't see what Real numbers offers against the computable Universe hypothesis