meta user
network profile
| bio | website | StackOverflow.Com/users/2988 |
|---|---|---|
| location | Karlsruhe, Germany | |
| age | 34 | |
| visits | member for | 2 years, 9 months |
| seen | 2 hours ago | |
| stats | profile views | 863 |
Not a software developer in the sense that I write software as part of my job or otherwise get paid to do so. Also, not a developer in the sense that I write software for others.
I write software for myself, often for no other reason than that I want to. (What I call recreational programming.)
Actually, I’m currently forcibly confined to recreational programming, as I’m looking for a job.
My current go-to language is Ruby, but I’m interested in all sorts of other languages as well: Newspeak, Seph, Ioke, Self, Io, Slate, Reia, Cobra, Fortress, Sapphire, Haskell, Scala, Clojure, Racket, Go, Fancy, Poison, and many more.
|
3h |
reviewed | Approve suggested edit on akka tag wiki |
|
3h |
reviewed | Approve suggested edit on akka tag wiki excerpt |
|
11h |
comment |
Dependency properties outside the realm of WPF? This would be easier to answer if we knew what Dependency Properties are. |
|
19h |
comment |
Are C++, C# and CSS Turing Complete? @4thSpace: I didn't say that. I very explicitly said that C is not Turing-complete because the C Language Specification mandates that there are only finitely many finitely sized objects: programmers.stackexchange.com/questions/201927/… |
|
21h |
comment |
Are C++, C# and CSS Turing Complete? @4thSpace: All of those languages exist just fine without computers. Turing Machines, Lambda Calculus, SKI Combinator Calculus, they all existed long before computers were even invented. Languages don't run on computers. Compilers and interpreters run on computers, and those compilers and interpreters may have limitations that the language doesn't have. For example, JavaScript is Turing-complete, but the dialect of JavaScript that is interpreted by Mozilla isn't. Languages are useful for lots of things besides being implemented on a computer. Writing down algorithms, for example. |
|
23h |
answered | What is the origin/meaning of the name 'NHibernate'? |
|
1d |
comment |
Are C++, C# and CSS Turing Complete? @4thSpace: There are a lot of Turing-complete languages. Java is Turing-complete. The JLS does not put any constraint on the amount of memory. Scheme, Ruby, JavaScript, Python, PHP are also Turing-complete. Brainfuck, Whitespace, Ook!, Haskell, Scala as well. I'm not sure where you get that idea from. Even SQL is Turing-complete as of 2003. |
|
1d |
comment |
How can CoffeeScript be written in CoffeeScript? I have to disagree with your last statement, or specifically with its absoluteness ("always"). Some languages are good for writing compilers in, some aren't. You have to weigh the benefits of writing a compiler in the language it compiles and thus increasing the amount of people able to work with it (because they only need to understand one language, not two) against the increase in complexity caused by using a language that might not be up to the task. I personally would much rather maintain a SQL compiler written in Scala than one written in SQL. |
|
1d |
comment |
How can CoffeeScript be written in CoffeeScript? The first compiler was written in Ruby, not JavaScript, but yeah, that's basically how it works. |
|
1d |
reviewed | Approve suggested edit on Executables and Python |
|
1d |
comment |
Are C++, C# and CSS Turing Complete? Actually, I'm not entirely sure that C++ is Turing-complete. I am sure that C is not Turing-complete, but I don't know enough about C++ to determine whether the same kind of limitations apply to C++ as well. The reasoning for C is as follows: you can take a pointer to any object in memory. This pointer can be arbitrarily large (the standard doesn't say how large a pointer is), but it must be finite. You can also get the sizeof any object, and again, it is arbitrarily large but finite. So, you can only have finitely many finitely large objects, but TC requires infinite memory. |
|
1d |
answered | What were the Design Patterns of the procedural programming era? |
|
2d |
awarded | Enlightened |
|
2d |
awarded | Nice Answer |
|
2d |
awarded | Enlightened |
|
2d |
awarded | Nice Answer |
|
2d |
comment |
Is using subprocedures to logically separate my code a bad idea for structured programming? I assume he means Structured Programming. |
|
2d |
answered | Is using subprocedures to logically separate my code a bad idea for structured programming? |
|
Jun 15 |
awarded | Generalist |
|
Jun 13 |
comment |
How come javascript, being a prototype based language, doesn't have an easy way to access the prototype? … and sprinkled the whole thing with curly braces so that nobody would notice that he actually still designed a Scheme dialect ;-) |
