BeuysVonTelekraft

Haha, i'll remember that.

I felt afraid to search for. I thought i could only obtain the answer diving on lots and lots of techical papers.

I didn't get this. Isn't it possible to make algorithms on all these languanges?

I was reading about haskell on wikipedia. Why they took n-plus-k-patterns off haskell? And: Do you know some catalog of this patterns?

But what's the problem?

Well. I had a naive idea a few minutes ago, due to that i'm kinda ashamed to share and ask about but i'm gonna do that. On various historical moments, we had ideas that were possible due to some variables. What were these variables? Why they made/make us think like that? What are the possible variables and what can they make us think? Do you know some book or something about it? Do you think i'm completely stoned/drunk?

"Notice that Lisp is an object-oriented language in the sense that it evaluates objects, not expressions." Common Lisp (Shapiro) On searching for definitions of both elements of the dicotomy: OBJECT: In computer science, an object is any entity that can be manipulated by the commands of a programming language, such as a value, variable, function, or data structure. (With the later introduction of object-oriented programming the same word, "object", refers to a particular instance of a class)(Wikipedia) EXPRESSIONS: An expression in a programming language is a combination of explicit values, constants, variables, operators, and functions that are interpreted according to the particular rules of precedence and of association for a particular programming language, which computes and then produces (returns, in a stateful environment) another value. This process, like for mathematical expressions, is called evaluation. The value can be of various types, such as numerical, string, and logical. (Wikipedia) Both share some elements, a value or a variable can be both an object or an expression. So, what's the difference?

Thank you. I'm reading it, i got "Set Theory, an introduction" by Robert L. Vaught" too.

It happens a nasty error when n is > 2.

I'm reading the book "The rubato music composer" and on fourth chapter, he says i need a basic knowledge about set theory. What are the pre-requisites for learning set theory? And is there a consense of what this basic knowledge may be?

I've read about it on "An introduction to Programmming with Mathematica". There, they have a similar function that sounds plausible to me. Using recursion to discover what are the next fibonacci numbers. But this: factorial 0 = 1 factorial n = n * factorial (n - 1) Is completelly alien to me, on the same book, i've seen a similar example of your demonstration of recursion.

I didn't get how this works. factorial 0 = 1 factorial n = n * factorial (n - 1) You're making a new function "factorial". And n factorial will be n * factorial(n-1). But how can it be possible if it still does not know what is factorial? This sounds really weird to me. You just gave the factorial 0=1, how can it guess the result for other n's? Or factorial is a built-in function?

I'm kinda new to programming. What does functional programming means? And what does imperative means? I've already searched for definitions but their implications weren't clear to me.