 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| Work in a life | |||||||||||||||||||||
| Nature is such a miracle that we will never be tired of being inside it. ---- 21 avril, radonnee dans le foret de Gretz-Armainvilliers avec Laure, Cyrille et Solene | |||||||||||||||||||||
| By random I "choose-d" theoretical computer science. This topic is worth a double explanation: first, computer (or rather, computing) science is a combination of both flavour from natural sciences (aiming at truth) and from engineering (aiming at usability); then by theoretical it means the focus is in a mathematical eye: We want abstraction to the abstractions. -- But one can never fail in finding live examples, they are the source of motivation. From an excerption in Journal of TCS, research in this area is classified into three axes: |
|||||||||||||||||||||
| -- Logic, semantics, and theory of programming: | |||||||||||||||||||||
| This axe is devoted to formal methods for (wait, let me first say what "formal" is: relating purely to forms, a real tradeoff perhaps) checking whether what we do with computers does confine to how we think and what we want; in another word, try to make it work, make it work right and safe, and the balance in-between. Diverse phenomena, requirements, techniques, methodology can be found: Curry-Howard isomorphism, rewriting vs. logical systems, semantics of sequetial and parallel programming languages, process calculiand net theory, abstract date types, automatic theorem proving, development in categorical methods, so on. Me moi-meme I've tried several topics, including proof-carrying code strategy, formal calculi for mobility with focus on security, transformation from a logic to rewrite system; completeness of a spatial logic for describing mobility. -- I haven't satisfying result in these learning yet, on verra. |
|||||||||||||||||||||
| -- Algorithms, automata, complexity and games: | |||||||||||||||||||||
| All the computers confine to the Turing-Church thesis, and nowadays we are still probing on the simplest model of computation -- automata. This axe is devoted to study of the algorithms and their complexity using analytical, combinatorial and probabilistic methods. Complexity theory deals with measurement of calculation, it tells about a hierarchy. Kleene discovered the isomorphism between automata and sequences, which forms the body of formal language theory; infinity is an new emphasis. With combinatorial methods (generating functions), a door to continuous world is opened. Geometrical (graphical ) applications and statistical measurements of system performance are also included. Another topic is verification. "If you don't achieve usability, try at least to achieve elegancy." I want to understand more on: algebraic vs. analytic; combinatorics and ... complex analysis. |
|||||||||||||||||||||
| -- Natural computing: | |||||||||||||||||||||
| This could appeal the human imagination and desire for a deeper understanding of the nature of computing. I attended courses of quatum computing; another sort is called bio-informatics, I've heard of titles like chemical machines (but it seems not the same) or DNA computing, they are now referred most to concurrency and formal languages. In A.I. there are topics such as neural networks, also belong to this category. I think it a perspective direction to explore more under inspiration from other sciences, even social ones such as, say, something very interesting for economics. | |||||||||||||||||||||
| What I'm currently studying is system modelisation, numercial resolution to ordinary differential equations, and interval analysis. (These three can form a "why-what-how" structure.) Under the supervision of Mr. Nacim Ramdani. More updates will be on. | |||||||||||||||||||||
|
|||||||||||||||||||||