Aren't (intelligent) humans born with logic built in?
Name:
Anonymous2010-02-08 15:57
>>2
I heard on /prog/ that it'd be good to read up on general logic before attempting programming- also sounds like an interesting topic to me. Rather than here rhetoric of "Read SICP" I thought I'd give this place a shout.
Name:
Anonymous2010-02-08 16:51
I've read four different logic books and I would say that "A Friendly Introduction to Mathematical Logic" by Christopher Leary is my personal favorite. It completely neglects propositional logic though, so if you feel you need something that covers that as well you could try "Propositional and Predicate Calculus" by Derek Goldrei. Enderton's book is also excellent and covers more material than the others I've read, but I wouldn't recommend it to a beginner.
>>3 /prog/
At first I was like щ(ﾟДﾟщ)
then I was like ( ≖‿≖)
Name:
Anonymous2010-02-09 4:55
>>2
yes, but like muscles, how many people actually USE it AND USE it effectively? :/
also, for books, I'm using "The Art of Deception: Introduction to Critical Thinking" by Nicholas Capaldi and "Critical Thinking" by Kevin Possin to get started.
After this, look for anything that uses keywords like logic and critical thinking.
Name:
Anonymous2010-02-09 19:58
Um... don't you mean "Boolean Logic"?
Logic in a general sense is a great thing to learn about, but it isn't really directly useful in programming. Not more than with anything else, anyway. BOOLEAN Logic, though, is completely different.
Steps to achieving 1337 programming skillz:
1) Boolean Logic/Algebra. Optionally, you might also want to pick up an electronics 101 sort of book--something that will give you the basics on electricity and physical circuitry (no need to go too overboard on this, though, unless you find it particularly interesting).
2) Microprocessor architecture and basic assembly. MIPS or something similar would be a better place to start than x86 (it is much simpler and less convoluted, making it easier to grasp the concepts involved and faster to learn).
At this point, you should be able to design a simple CPU and feed it basic instructions. It sounds way more impressive than it is, really.
3) OS architecture, advanced assembly, C, C++.
4) Algorithms.
Some people argue that you should learn algorithms before you ever write a single line of code, but I found most of the really good books on algorithms assumed familiarity with programming concepts. YMMV.
5) UNIX/Linux, if you're not already familiar. Seriously, you're not going to get far anymore without some experience with this shit.
After all that, you'll find it is quite simple to pick up new languages. You'll also be much better equipped to tell what language is appropriate in a given situation.
>>7
No, logic is more important than Boolean logic. Stop feeding this fine chap lies. Logic dictates the entire flow of execution, Boolean logic merely dictates when a branch is taken.
The flow becomes more complex when you add multiple threads, so a solid ground in serial logic is extremely important.
Boolos, George; Burgess, John; Jeffrey, Richard (2002), Computability and Logic (4th ed.), Cambridge: Cambridge University Press, ISBN 9780521007580 (pb.).
Enderton, Herbert (2001), A mathematical introduction to logic (2nd ed.), Boston, MA: Academic Press, ISBN 978-0-12-238452-3.
Hamilton, A.G. (1988), Logic for Mathematicians (2nd ed.), Cambridge: Cambridge University Press, ISBN 978-0-521-36865-0.
Katz, Robert (1964), Axiomatic Analysis, Boston, MA: D. C. Heath and Company.
Mendelson, Elliott (1997), Introduction to Mathematical Logic (4th ed.), London: Chapman & Hall, ISBN 978-0-412-80830-2.
Schwichtenberg, Helmut (2003–2004), Mathematical Logic, Munich, Germany: Mathematisches Institut der Universität München.
Shawn Hedman, A first course in logic: an introduction to model theory, proof theory, computability, and complexity, Oxford University Press, 2004, ISBN 0198529813.
J.Y. Girard, Linear Logic, Theoretical Computer Science 50 (1), 1987.
J.Y. Girard, Y. Lafont, P. Taylor, Proofs and types, Cambridge University Pres, 1989.
R. Di Cosmo & D. Miller. – Linear Logic. The Stanford Encyclopedia of Philosophy (Fall 2006 Edition), Edward N. Zalta (ed.).
R. Di Cosmo & D. Kesner. – Strong normalization of explicit substitutions via cut elimination in proof nets (extended abstract). In : Proceedings, Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, pp. 35–46. – Warsaw, Poland, 29 juin- 2 juillet 1997.
D. Kesner & S. Lengrand. – Resource Operators for lambda-calculus. Information and Computation. 205(4):419-473, 2007.
A. Asperti & S. Guerrini. – The Optimal Implementation of Functional Programming Languages. Cambridge University Press, 1998.
J.-J. Lévy. Optimal Reductions in the lambda-calculus. In : To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, J.P. Seldin et J.R. Hindley (eds.), pp. 159-191. Academic Press, 1980.
S. Guerrini. – Proof nets and the lambda-calculus. In : Linear Logic in Computer Science, T. Ehrhard, P. Ruet, J.-Y. Girard et P. Scott (eds.). Cambridge University Press, 2004.
A. Asperti et H.G. Mairson – Parallel beta is not elementary recursive. In : Proc. 25-th Annual ACM Symposium on Principles of Programming Languages (POPL '98), Albuquerque, New Mexico. ACM Press, 1998.
D. Miller. – A Multiple-Conclusion Meta-Logic. Theoretical Computer Science 165(1): 201- 232, 1996.
D. Miller, G. Nadathur, F. Pfenning & A. Scedrov. – Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, Vol. 51, 125 – 157 (1991).
.........................