A Unified Calculus? 31
DeAshcroft writes "Science Daily is reporting that one Martin Bohner's work, "Asymptotic Behavior of Dynamic Equations on Time Scales," has made significant waves (ahem) in the mathematical community. The work is "part of a fairly new and exciting effort to unify continuous and discrete calculus" I guess it's time to re-learn long division."
It turns out this topic is not entirely new: (Score:5, Informative)
Jesus Christ! (Score:3, Funny)
Re:Jesus Christ! (Score:4, Funny)
Re:Jesus Christ! (Score:1, Informative)
Re: Jesus Christ! (Score:2, Funny)
Your subject line should have been Jesusgottinhimmelskind!
Re:Jesus Christ! (Score:2)
Consider for instance ``Law school entrance requirement examination test score''.
The noun phrase has a root, on the rightmost side, in other words ``score''. The other nouns modify the root, giving it more refined semantics. It's a test score; moreover, it is an examination test score, and so forth.
Now if you were German, you would write lawschoolentrancerequirementexaminationtestscore. Probably with enough practice, you can learn to read this!
In case you're wondering... (Score:5, Informative)
Its readable enough if you can remember your calculus from first year at Uni.
The gist: normally we do calculus with the set of real numbers, and difference equations with integers. The 'time scales' notion is that instead of having even gaps between numbers like the integers, you can have independently varying gaps, down to infinitesimal ones. Thus, timescales are really just arbitrary subsets of the reals. An example of a time scale might be:
1_2 3_4 5_6
(the underscore indicates a chunk of real numbers, the space a gap of numbers we don't use, and so on)
It's hopefully obvious that the set of integers and the set of reals are special cases of timescales. So, if you derive the fundamental theorems in calculus using timescales, you find the equivalent theorems for reals and integers are special cases.
Cheers,
Baz
cool (Score:4, Interesting)
Re:cool (Score:3, Informative)
I gotta say (Score:2)
Re:I gotta say (Score:2)
It looks like early days yet. Off the top of my head, I can think of a couple of areas where this might be very useful.
In signal processing, remote sensing, image processing and so on, we want to do "continuous" things to discrete samples. If we can carry solutions over from the continuous world, we may get nice algorithms.
There is a deep link between certain kinds of algebra and formal language theory. A recent discovery is that formal languages obey the rules of calculus. For example, DFA construction from a regular expression turns out to be a Taylor series expansion of the expression. (If anyone is curious, I can supply the details.) Perhaps this will motivate someone to bring formal languages into the picture.
It's not very deep so far, but you never know.
Ok, I'll bite (Score:2)
For example, DFA construction from a regular expression turns out to be a Taylor series expansion of the expression. (If anyone is curious, I can supply the details.)
Ok, I'll bite. This statement doesn't make any sense to me, and a google search turned up matches (with DFA in {"Deterministic Finite Automata", "Detrended Fluctuation Analysis", "Dynamic financial analysis", "Descrete functional analysis"...}), none of which seemed to be what you were refering to.
-- MarkusQ
Re:Ok, I'll bite (Score:1)
Re:Ok, I'll bite (Score:2)
In this context DFA refers to "Deterministic Finite Automata". Among other things, they can be employed in highly efficient lexical analyzers. If you've got a decent book on compilers around, you can look up the details.
In the context of formal languages, sure. (Note that that was the first interpretation on my list.) But in the context of Taylor series? Remember, the original poster was claiming a link between formal language theory and Calculus via a DFA <---> Taylor series mapping. How in the heck do you say that Deterministic Finite Automata are somehow the same as Taylor series? Structurally, I just can't see it. But I also can't see/find any other interpretation of DFA that makes this make sense. Thus my request that the original poster provide the offered details.
-- MarkusQ
Re:I gotta say (Score:2)
Re:I gotta say (Score:1)
I'm curious... details please. I'm not sure what you mean by a "Taylor series of the expression". Is it a power series? If so there's lots of cool things that can be done once you have a power series... including lagrange inversion...
Re:I gotta say (Score:2)
Re:I gotta say (Score:2)
Re:I gotta say (Score:2)
Re:I gotta say (Score:2)
Hint: (Score:2)