161 reputation
14
bio website lavi.fm
location Israel
age 29
visits member for 1 year, 7 months
seen Jul 9 at 21:52

IT generalist


Jun
12
awarded  Civic Duty
Jan
23
comment What is an example of a computationally impossible business problem?
I think I understand what the answer says - a computer with a fixed memory size of n bits (including all types of memory) running a non-halting program will eventually reach the a memory state it already occupied earlier. A monitor program is marking check-boxes for each of the possible 2^n memory states and thus (in worst case) will surely complete its test after the program in question has gone through these 2^n states. I agree with the sentiment that this is not infinite, but given a computer with n memory bits, you will never be able to test it on another similarly sized computer.
Jun
12
comment Why do people fork repositories on GitHub?
My additional 2 cents on the "Why not?" section: My habit is of always doing "git push" after I've finished working on a feature; it has that Q.E.D. satisfactory feeling for me (that I don't get when writing out the remote and branch name). So whenever there's even a slightest chance that I may want to do changes to the repo, I'd prefer to fork it, instead of later having to change the default "origin" repo.
Apr
17
answered Readable regular expressions without losing their power?
Feb
20
awarded  Supporter
Feb
10
awarded  Teacher
Feb
10
answered What triggered the popularity of lambda functions in modern mainstream programming languages?
Jan
30
awarded  Editor
Jan
30
revised Programming interview question on Trees
the missing apostrophe confused me
Jan
30
suggested suggested edit on Programming interview question on Trees
Dec
16
awarded  Autobiographer