srimech

8 ms·

1.
by srimech 7y ago
I'd say maybe indie developers. 'Maker', to me, means the culture that started with O'Reilly's Make magazine, Maker Faires, and the subsequent culture that grew around it, which concentrated mainly on making physica
2.
by srimech 7y ago
Not just revenue, but 'products'. Maker, to me, means someone who makes projects, not necessarily things for other people to consume.
3.
by srimech 11y ago
The variety of memory used for computers is amazing, and I find it a lot more interesting than the history of the CPU. CPU architecture is very diverse, but physically tends to be just different configurations of a few physical elements - r
4.
by srimech 11y ago
It can run on steam if you like; it just needs one rotating shaft as input power. I did have the first version hooked up to a model steam engine, shown at the end of the video here: http://www.srimech.com/turing-machine-and-
5.
by srimech 11y ago
The infinite tape requirement is a bit difficult to fulfill, but that's true of the silicon implementations as well.
6.
by srimech 12y ago
I wouldn't call that a mistake on your part; it's over-use of capitalization in the headline.
7.
by srimech 12y ago
I used to work in a company which had "a culture that enforces a library-like environment on an open floor plan" as indicated (it wasn't a written rule, just the way the culture worked). I found it extremely stressful and dep
8.
by srimech 13y ago
I quit the co-working place I was working out of and went to work in the public library instead. It was free and their wifi was more reliable.
9.
by srimech 13y ago
I have my SCAD files on github. It seems wrong to me to have a build result (the .STL file) under version control though.
10.
by srimech 14y ago
It calculates a cellular automata called Rule 110 ( http://en.wikipedia.org/wiki/Rule_110 ) which is very difficult to code for. I've seen a paper which shows a method for coding any Turing machine into rule 110, but most of it is beyond my
11.
by srimech 14y ago
That's mine. It's a physical implementation of a 5-symbol, 2-state Turing machine which was shown to be universal by Wolfram. If it were perfectly reliable (it isn't) and had an infinite tape (it doesn't) then it would be universal. Going t