Lately at work, I\'ve been doing some translation from Makefiles to an alternative build system. I\'ve seen some pretty hairy Make code in some places using functional map, filter, and fore开发者_如何
As there are non-Turing complete languages out there, and given I didn\'t study Comp Sci at university, could someone explain something that a Turing-incomplete language (like Coq) cannot do?
The act of transforming procedural code into SQL has been of interest to me lately. I know that not absolutely everything is expressable in a turing complete procedural language.
It\'s possible to do interesting things with what would ordinarily be thought of as typesetting languages. For example, you can construct the Mandelbrot set using postscript.
I\'m reading an article about different evaluation strategies (I linked article in wiki, but I\'m reading another one not in English). And it says that unlike to call-by-name and call-by-need strategi
This is a screenshot of the applet LogiCell 1.0, link to which I found here. As the bottom left corner shows, this is doing sum 0+1 an开发者_如何学运维d the result is 01b (bottom right hand side).
I\'ve read in Wikipedia that neural-network functions defined on a field of arbitrary real/rational numbers (along with algorithmic schemas, and the speculative `transrecursive\' models) have more com
I am trying to find the logical alan turing explanation why there can开发者_如何学Go\'t be a program that checks another programs.
I have created a turing-complete programming language (already proven) so it must be possible to write a quine for it, right?
I just wanted to know if it is 100% possible, if my language is turing-complete, to write a program in it that prints itself out (of course not using a file reading function)
加载中,请稍侯......