raoof

5 ms·

1.
Show HN: A single character turns primitive recursion into general recursion(github.com)
2 points by raoof 2mo ago|0 comments
2.
Show HN: Practical programming using only composition(github.com)
2 points by raoof 9mo ago|0 comments
3.
by raoof 2y 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
4.
by raoof 2y ago
the only approach to practical programming with Ar is to have external dependencies on hard to compute functions until I implement them :)
5.
by raoof 2y 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
6.
by raoof 2y 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 sta
7.
by raoof 2y 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
8.
by raoof 2y 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
9.
by raoof 2y 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 fun
10.
by raoof 2y 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
11.
Show HN: You can program without loop and recursion and×÷- is all you need(github.com)
9 points by raoof 2y ago|17 comments
12.
by raoof 2y 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 tha
13.
Uniqueness Violations(slai2022.islai.org)
1 points by raoof 3y ago|0 comments
14.
by raoof 4y 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 pro
15.
by raoof 4y 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
16.
by raoof 4y ago
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 know any proof that does not refer to the invert of the di
17.
by raoof 4y ago
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 numbers
18.
by raoof 4y ago
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 uncountable I'd be happy to know)
19.
by raoof 4y ago
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 binary strings between [0,1] is uncountable ) how
20.
Tell HN: Programmers do not use a bug free program to debug programs
1 points by raoof 4y ago|0 comments
21.
by raoof 4y ago
thank you for the recommendation
22.
by raoof 4y ago
that would get way too much time to reach an acceptable state for one person and creating your own game engine is much better
23.
by raoof 4y ago
interesting in any sense
24.
by raoof 4y ago
thanks for the idea but not that interesting beside I don't have access to RPi
25.
Ask HN: Can you give me something interesting or useful to work on?
1 points by raoof 4y ago|8 comments
26.
Show HN: Lang: run .c .cpp .py .cljs .ts and more directly in Chrome offline(github.com)
5 points by raoof 5y ago|0 comments
27.
How to Build a Hypercomputer(citeseerx.ist.psu.edu)
1 points by raoof 5y ago|0 comments
28.
by raoof 5y ago
didn't read the whole article but I have to say that having a non-mechanical process in the ontology of the Universe does not mean nonsense, it's not obvious that AI is not possible but also it's not obvious that we are just
29.
Turing mind: Turing machine as a mathematical model of a mind instead of a body
1 points by raoof 5y ago|0 comments
30.
by raoof 5y ago
I hope it's okay to post to my own article.

More ›