Larry Page's father.
Carl is mentioned in The Google Story Chapter 2 "When Larry Met Sergey".
He divorced from Larry's mother Gloria in 1980 or 1981, "when he [Page] was eight years old" according to The Google Story. He then moved on to Joyce Wildenthal, another MSU professor. Larry had a good relation with both Gloria and Joyce:
Larry came to feel that he was showered with love and wisdom from two mothers: his real mom, and Joyce Wildenthal, a Michigan State professor who had a long-term relationship with his dad.
His obituary on the website of the Michigan State University, where he taught most of his life: www.cse.msu.edu/Alumni_Friends/Alumni/PageMemorial.php:
Page served as CSE’s [MSU Department of Computer Science and Engineering] first graduate director and had a critical role in promoting the department’s research mission. In 1967, when he joined MSU, the computer science program consisted of only undergraduate courses. Just three years later, the department offered eighteen graduate courses in computer science.[...]Page taught courses in Automata and Formal language theory and Artificial intelligence. He was a beloved teacher and mentor to innumerable students until his death in 1996.
This is the classic result of formal language theory, but there is too much slack between context free and context sensitive, which is PSPACE (larger than NP!).
By Noam Chomsky.
TODO had seen a good table on Wikipedia with an expanded hierarchy, but lost it!
A branch of mathematics that attempts to prove stuff about computers.
Unfortunately, all software engineers already know the answer to the useful theorems though (except perhaps notably for cryptography), e.g. all programmers obviously know that iehter P != NP or that this is unprovable or some other "for all practical purposes practice P != NP", even though they don't have proof.
And 99% of their time, software engineers are not dealing with mathematically formulatable problems anyways, which is sad.
The only useful "computer science" subset every programmer ever needs to know is:
- for arrays: dynamic array vs linked list
- for associative array: binary search tree vs hash table. See also Heap vs Binary Search Tree (BST). No need to understand the algorithmic details of the hash function, the NSA has already done that for you.
- don't use Bubble sort for sorting
- you can't parse HTML with regular expressions: stackoverflow.com/questions/1732348/regex-match-open-tags-except-xhtml-self-contained-tags/1732454#1732454 because of formal language theory
Funnily, due to the formalization of mathematics, mathematics can be seen as a branch of computer science, just like computer science can be seen as a branch of Mathematics!