I would qualify that statement better by saying "compilers with Turing Complete macros or type systems terminate for any input is trivially false". The point may not be trivial (which I'm not ready to concede), but it…
That's fine that they're different. My point is that they're both formal processes. Adding AI to the mix will not help you arrive at formal conclusions. The conclusions will be probabilistic, instead. If an AI could use…
The point about the macros being Turing Complete is trivial in this instance because if you wrote a macro that never terminated, you'd never compile anything do decompile ;-).
I don't think you connected your arguments very well. Just because a human can do something doesn't mean that AI's are the best solution to the task. I'm not sure how your specific example plays to the general case.…
The set of all possible inputs for a compiler is infinite, too. Does that mean that compilers are all harangued by the halting problem as well? Nope. Having an infinite number of possible inputs (infinite input set…
It depends on what you want from decompilation. Decompilation by its basic nature is just as decideable as compilation is. It's a translation from one language to another in addition to semantics-preserving…
Applying AI to a decompilation problem is just like applying AI to a compilation problem. You're taking a potentially nondeterministic approach to a problem that should be formalized and deterministic. I think AI…
Sometimes I wonder if these payment processing companies behave like this so they can keep their books straight/solvent.
I think it might be important to note that while the terms map and reduce do come from Lisp, they're not one-to-one with what these functions do in Lisp. The original MapReduce paper mentions the borrowing, but doesn't…
Yeah I've always been tweaked by the "inborn" trait thing. I think there's a natural affinity that people can have for things, but at the same time, anybody who puts in the hours can get there with this stuff. Yes, some…
I'm not sure what's surprising about a compiler with no C in it. They're becoming much more common. I personally think C is an awful language to write a compiler in. One shouldn't be worrying about C's bookkeeping while…
Perhaps Peter Thiel's real master plan is to increase the value of an education by convincing a lot of people that they shouldn't go to school, and thus increasing scarcity of those getting degrees. AmIright?
Your suggestion that the deans are pro-college institution because they are deans doesn't necessarily follow. It actually is an ad hominem against the deans because you're trying to weaken the author's point by reducing…
I also think it sort of waters down Computer Science to wedge it into engineering and treat it as such. Ultimately it's more about theory, formalisms, and mathematical/logical foundations than it is about "making it…
Is good software engineering something you can truly learn in the classroom, or is it something that's emergent to applying good learning techniques to real life experiences (kind of like being a journeyman)? I think a…
Isn't that kinda like saying the C language still lives on in the form of Java?
I've read some of this and it's good stuff. I guess where I was coming from was that OOP is already so scatter shot and widely used as such that even if somebody did formalize something based on OOP, it wouldn't be…
Haskell is a purely functional language in this sense. http://en.wikipedia.org/wiki/Pure_function http://en.wikipedia.org/wiki/Purely_functional Haskell has taken functional purity and ran with it. It's proof that you…
I think with languages like Haskell, ML, Coq, ACL2 and their ilk, you're not going to get a lot of traction for theorem proving in an OOP-ed C++ variant. The first two do compile to machine code, and have type systems…
FP ~ Math/Formal Logics. OOP is a grab bag of theories, ideas and their applications to programming. Unfortunately I don't think that there's a generally accepted formal notion of what OOP actually is. On the other…
I think to call C++ compilers a black box and then turn around and say something like gcc is not is a bit of a stretch, and simply unfair to C++. The largess of the GNU C compiler is the very definition of a black box.…
While the price tag is pretty bad, at least she'll be ending with an advanced degree. Some of the people in this article had comparable liabilities but were going to wind up with undergraduate degrees. I hope it works…
Agreed. My second year in college as a CS student I felt like I was rolling in money (relative to working at a grocery store) when I had an internship.
Which part? I don't think he actually logged in under the guy's Facebook account?
Care to elaborate what you mean by VB-like stack?
I would qualify that statement better by saying "compilers with Turing Complete macros or type systems terminate for any input is trivially false". The point may not be trivial (which I'm not ready to concede), but it…
That's fine that they're different. My point is that they're both formal processes. Adding AI to the mix will not help you arrive at formal conclusions. The conclusions will be probabilistic, instead. If an AI could use…
The point about the macros being Turing Complete is trivial in this instance because if you wrote a macro that never terminated, you'd never compile anything do decompile ;-).
I don't think you connected your arguments very well. Just because a human can do something doesn't mean that AI's are the best solution to the task. I'm not sure how your specific example plays to the general case.…
The set of all possible inputs for a compiler is infinite, too. Does that mean that compilers are all harangued by the halting problem as well? Nope. Having an infinite number of possible inputs (infinite input set…
It depends on what you want from decompilation. Decompilation by its basic nature is just as decideable as compilation is. It's a translation from one language to another in addition to semantics-preserving…
Applying AI to a decompilation problem is just like applying AI to a compilation problem. You're taking a potentially nondeterministic approach to a problem that should be formalized and deterministic. I think AI…
Sometimes I wonder if these payment processing companies behave like this so they can keep their books straight/solvent.
I think it might be important to note that while the terms map and reduce do come from Lisp, they're not one-to-one with what these functions do in Lisp. The original MapReduce paper mentions the borrowing, but doesn't…
Yeah I've always been tweaked by the "inborn" trait thing. I think there's a natural affinity that people can have for things, but at the same time, anybody who puts in the hours can get there with this stuff. Yes, some…
I'm not sure what's surprising about a compiler with no C in it. They're becoming much more common. I personally think C is an awful language to write a compiler in. One shouldn't be worrying about C's bookkeeping while…
Perhaps Peter Thiel's real master plan is to increase the value of an education by convincing a lot of people that they shouldn't go to school, and thus increasing scarcity of those getting degrees. AmIright?
Your suggestion that the deans are pro-college institution because they are deans doesn't necessarily follow. It actually is an ad hominem against the deans because you're trying to weaken the author's point by reducing…
I also think it sort of waters down Computer Science to wedge it into engineering and treat it as such. Ultimately it's more about theory, formalisms, and mathematical/logical foundations than it is about "making it…
Is good software engineering something you can truly learn in the classroom, or is it something that's emergent to applying good learning techniques to real life experiences (kind of like being a journeyman)? I think a…
Isn't that kinda like saying the C language still lives on in the form of Java?
I've read some of this and it's good stuff. I guess where I was coming from was that OOP is already so scatter shot and widely used as such that even if somebody did formalize something based on OOP, it wouldn't be…
Haskell is a purely functional language in this sense. http://en.wikipedia.org/wiki/Pure_function http://en.wikipedia.org/wiki/Purely_functional Haskell has taken functional purity and ran with it. It's proof that you…
I think with languages like Haskell, ML, Coq, ACL2 and their ilk, you're not going to get a lot of traction for theorem proving in an OOP-ed C++ variant. The first two do compile to machine code, and have type systems…
FP ~ Math/Formal Logics. OOP is a grab bag of theories, ideas and their applications to programming. Unfortunately I don't think that there's a generally accepted formal notion of what OOP actually is. On the other…
I think to call C++ compilers a black box and then turn around and say something like gcc is not is a bit of a stretch, and simply unfair to C++. The largess of the GNU C compiler is the very definition of a black box.…
While the price tag is pretty bad, at least she'll be ending with an advanced degree. Some of the people in this article had comparable liabilities but were going to wind up with undergraduate degrees. I hope it works…
Agreed. My second year in college as a CS student I felt like I was rolling in money (relative to working at a grocery store) when I had an internship.
Which part? I don't think he actually logged in under the guy's Facebook account?
Care to elaborate what you mean by VB-like stack?