Viewing profile — raoof

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 compu…

the only approach to practical programming with Ar is to have external dependencies on hard to compute functions until I implement them :)

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,ke…

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 …

(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 numbe…

(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 pa…

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 n…

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

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 losin…

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 k…

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 deep…

the proofs that I've read shows that the list of infinite binary strings between [0,1] are uncountable because the invert of the diagonal of the list is not on the list, do you kno…

you can't prove something just by assuming it that would be trivial, if we can build or convince ourselves how to build a wormhole or a time machine then we can believe in Real num…

if you put 1 out then there is no reason to believe it is uncountable because you can sort the list such that the diagonal is all 0s (if you know an argument that shows [0,1) is un…

if Reality!=0.111... : the Universe is computable ( the list of infinite binary strings between [0,1) is countable ) else: the Universe is non-computable ( the list of infinite bin…

try to debug the following program: def hasbug(p): return debug(p) == p I know that hasbug has bug meaning hasbug(hasbug) == True therefore I do not use a bug free program to debug…

thank you for the recommendation

that would get way too much time to reach an acceptable state for one person and creating your own game engine is much better

interesting in any sense

thanks for the idea but not that interesting beside I don't have access to RPi