A list of practical projects that anyone can solve in any programming language
51–59 of 59 posts
Re: A list of practical projects that anyone can solve in any programming language
#52Great list for inspiration! Though, it is not true that all the problems can be solved in any programming language: try to make a "Bandwidth Monitor" in Coq.
Or try to make an in Brainf*uck.
Re: A list of practical projects that anyone can solve in any programming language
#53I'd like to make a wikipedia-of-code where each page corresponds to a "project" like the ones listed here. The project entry would look like a Jupyter notebook, and you can edit/execute the code freely.
Re: A list of practical projects that anyone can solve in any programming language
#54Any other lists of projects like this?
Re: A list of practical projects that anyone can solve in any programming language
#55I'd like to make a wikipedia-of-code where each page corresponds to a "project" like the ones listed here. The project entry would look like a Jupyter notebook, and you can edit/execute the code freely.
I made a start on that once with http://wry.me/~darius/hacks/howtodothingswithdocs.tar.gz -- it runs literate programs in Scheme on the server. Ancient Python code.
Re: A list of practical projects that anyone can solve in any programming language
#56Earlier quoted context omitted.
I made a start on that once with http://wry.me/~darius/hacks/howtodothingswithdocs.tar.gz -- it runs literate programs in Scheme on the server. Ancient Python code.
I don't know if I'd be courageous enough to run random internet code server side, but I know there are some people that do. I was thinking about trying to get a lisp-to-javascript compiler, then use it to compile a lisp-interpreter-written-in-lisp to javascript, then the notebook would just be a fancy client-side lisp REPL.
Yeah, running it all client-side makes more sense. See my profile info if you ever feel like chatting about it.
Re: A list of practical projects that anyone can solve in any programming language
#57Re: A list of practical projects that anyone can solve in any programming language
#58Earlier quoted context omitted.
"Well, what constitutes a programming language then? It sounds like there is a clear definition :-)" Some bloke called Turing had a few ideas on a definition. (I'll whisper "whoosh" here - for my own note) Given that any programming language can be defined in English (or any other human language, with a few contortions as required, if any) then of course English can be used to create a Turing Machine (TM). It doesn't…
I am not aware of his definition? I can't find it on google either. Can you point me to it? A Turing machine does not talk about expressing computations, but rather a class of problems that can be computed. Remember, not all programming languages are Turing complete (Coq being one of them).
Given how simple a Turing Machine can be, I seriously doubt (without any proof) that coq is not able to recreate a TM.
I am not an expert but the explanation about Turing Machines I read was in GED and involved a simple tape and a slack handful of symbols and operations and some basic hand waving. If coq can't manage that then it is unlikely to be useful - which I doubt.
Re: A list of practical projects that anyone can solve in any programming language
#59Earlier quoted context omitted.
I am not aware of his definition? I can't find it on google either. Can you point me to it? A Turing machine does not talk about expressing computations, but rather a class of problems that can be computed. Remember, not all programming languages are Turing complete (Coq being one of them).
I can still hear "whoosh" in my own ears here 8) Given how simple a Turing Machine can be, I seriously doubt (without any proof) that coq is not able to recreate a TM. I am not an expert but the explanation about Turing Machines I read was in GED and involved a simple tape and a slack handful of symbols and operations and some basic hand waving. If coq can't manage that then it is unlikely to be useful - which I doub…
Coq only accepts well funded recursion. Non-bound Turing machines span a bigger complexity class.
In other words: Turing machines can loop forever, Coq can not express programs that can do so.
Read your CS 101: