One instruction set computer
21–27 of 27 posts
Re: One instruction set computer
#22[1] http://homepage.cs.uiowa.edu/~jones/arch/risc/ [2] http://homepage.divms.uiowa.edu/~jones/voting/pictures/ [3] http://homepage.cs.uiowa.edu/~jones/voting/
Re: One instruction set computer
#23Re: One instruction set computer
#24Re: One instruction set computer
#25Re: One instruction set computer
#26At one point I was seriously fascinated by the lambda calculus and particularly the S and K combinators - two very simple functions that you can build any computation from: http://en.wikipedia.org/wiki/SKI_combinator_calculus More recently I found out about the U combinator which is a single combinator that can be used to define S & K: http://en.wikipedia.org/wiki/Iota_and_Jot Having a system that implemented recursi…
It would look like a very (very!) long string of U's. :-) You might enjoy this: http://www.flownet.com/ron/lambda-calculus.html
Re: One instruction set computer
#27Earlier quoted context omitted.
It would look like a very (very!) long string of U's. :-) You might enjoy this: http://www.flownet.com/ron/lambda-calculus.html
Presumably a tree of U's.
It's worth noting, BTW, in case anyone is still following this thread, that what is going on here in all of these single-instruction languages is not particularly interesting. You're just encoding the program semantics in the arguments, or in the structure of the tree, or the length of the program, or something like that, rather than in the instructions.