You are not logged in.
Pages: 1
hi MrRHQ,
Well, calculus is what you're missing pretty much eh? I can tell you that some of the solutions to the other questions are in calculus too. I learned calculus in some depth because I took engineering in university. Physics relies heavily on calculus and engineering on physics, so...
Get yourself a good text on calculus and you'll take off! There are some weird concepts in there, but once you get them its really fun. Try going to your library and doing a title search for "Introduction to Calculus" Guess that's obvious... But really, the quality of calculus texts these days is great, and there are plenty of intro books. Given your rich basis, you'll have no problems.
Good idea! Can you build other words from the 1-words?
Since the whole idea of symbols is to make words, if the 1-words cannot be used to make words, we know that it doesn't make sense to think of the set of all 1-words over an alphabet as the same as the alphabet. Oh, this lets me formalize my question a different way:
This is an interesting way to state that symbols and letters are the same thing. I wonder if I could prove that statement false...
I'm not very comfortable with proving.
In any case, back to your idea: we could try to make the language ∑* using only the set of 1-words S defined above. So you say that words cannot be combined together to make other words? Not with that attitude! In fact, we can define the operation concatenation, as suggested by my textbook, which creates a new word that has the symbols of two other words.
In that case, it seems we could create all words, and indeed assemble ∑* by using concatenation of words from S.
Is there any problem with that?... yes. In fact there are some words we cannot make by that proposed method:
- we can't make the null word,
- nor any 1-words.
At least this set of words of length < 2 are missing. Of course, if we added to S the null word, then we could make the null word by concatenating it with itself, and 1-words by concatenating the desired 1-word with the null word.
It seems like 1-words are different then symbols. I'd still like to formally prove it, just to flex a bit, but I don't even really understand what rules are in terms of what a "formal proof is".
I've just discovered the mathisfunforum. Seems awesome.
I'm trained as a chemical engineer, so I've used plenty of math, especially calculus, but always as a tool. Nevertheless I'm really interested in math for its own sake. Right now I'm trying to learn about information theory, which has prompted a review of discrete math.
But I often find myself really trying to understand beyond the practical explanations given in text books. Generally, things are explained in a degree of shall we say reasonable rigor, because too much precision is hard for people who just need the practical to understand. This leaves me invariably with questions. I wonder about the fundamental things, like what, exactly, do we mean by a "number". What is a number!? Similarly, one finite text brought up the idea of alphabets which are supposed to be sets of symbols. What is a symbol!? And how does that relate to the fact that math consists of lines of symbols!?
Does anybody else wonder about these things?
Actually, I know people do. Having been interested in this stuff, I did come across things like Godel's incompleteness theorem (I understand the juiced version, but dare not try to understand the actual papers). And I think some of this is dealt with in "elementary number theory". Any leads on how to get into that. I find myself wading through gobbledeygook. I think somebody didn't know what elementary means!
Know of any gentle, readerly intros to these ideas? I know that this stuff is hard. That's ok. It would just be nice to actually have terms defined before their used, etc. Know what I'm saying?
I'd love to talk to other people who think about these things.
Not sure if it came across right: this is a question. I'm sure someone out there has an opinion at least?
So the question is "Are a symbol and a word of length 1 equivalent". I proposed my answer "no" and gave my reasons above. Do you agree that a symbol and a 1-word are different objects?
I just got a decent discrete math text and am learning about sets. They've just introduced "alphabets" as a type of set that contains "symbols". No definition is given for a symbol, which is interesting. It is interesting because the following could be seen as a set of sets, or as an alphabet:
Of course, it depends on whether A, B, and C are sets or symbols. This is strange because, if I am not mistaken, math is written in symbols.
Next the text defines a "word" or "string" as an ordering of symbols.
So words are constructed by placing symbols in ordered sequences.
My question is subtle, I hope you won't mistake it for dumb:
Is a symbol a word of length 1, or is it not a word at all?
Why does it matter? Well, I'm wondering if a set of words of length 1 is an alphabet. Perhaps symbols are not words. There is a difference, after all, between an ordered sequence containing one symbol, and a symbol, is there not?
Think of it this way. Imagine that to create a word, the notation was a little more precise, and we had to use, say braces around the symbols. Then we could make words like
and the null word,
The null word is an object because it is an ordered list of symbols containing zero symbols, just like the null set is an unordered collection of zero elements. On this basis, the word
Pages: 1