Archive for November, 2011

Sequences of numbers are often defined using a recursive relation and initial conditions, for example, the sequence of Fibonacci numbers is defined with F_{n+2} = F_{n+1} + F_{n} and initial conditions F_{1} = 1, F_{2} = 1. In this lecture we will see (a) how to solve various types of recursions (b)How to determine various sequence properties of number sequences directly from the recursions, and (c) how this knowledge can come in handy in many competition problems as well as in the study of computer science.

Read Full Post »

Registration is now open for the 2012 North American Computational Linguistics Olympiad (NACLO).  This is a contest that appeals to many students who enjoy mathematical problem solving competitions.  As in past years, Dr. Vincent Ng will offer the contest at UT Dallas and will also provide a prep session before the contest.

Knowledge of specific languages is not being tested, but rather the ability of our students to detect patterns and solve problems.  Computational Linguistics and Natural Language processing are two exciting fields whose benefits we experience every day when we interact with Google search or Apple’s Siri.

Read Full Post »

%d bloggers like this: