Theoretical Computer Science
Caleb Stanford's user avatar
Caleb Stanford's user avatar
Caleb Stanford's user avatar
Caleb Stanford
  • Member for 10 years, 6 months
  • Last seen more than a month ago
Profile Activity
Stats
862
reputation
5k
reached
4
answers
4
questions
Communities
View all
About

Assistant professor of computer science at UC Davis.

Badges
View all badges
This user doesn’t have any gold badges yet.
5
silver badges
15
bronze badges
Top tags
View all tags
25
Score
1
Posts
12
Posts %
4
Score
2
Posts
25
Posts %
4
Score
2
Posts
25
Posts %
4
Score
2
Posts
25
Posts %
2
Score
4
Posts
50
Posts %
1
Score
3
Posts
38
Posts %
Top posts
All Questions Answers
Score Newest
answer
25
Turing award papers
Dec 6, 2019
question
21
Decidability of diophantine equations over {=, +, gcd}
Dec 26, 2020
question
10
What class of languages is recognized by finite-state automata with $k$ heads?
Oct 4, 2019
question
7
Complexity class of efficient streaming algorithms
Apr 23, 2020
question
5
What is FO(REGULAR)? (The descriptive complexity equivalent of NC1)
Apr 16, 2020
answer
4
2DFA to 1DFA - Converting two way deterministic finite automata to one way deterministic finite automata
Apr 25, 2020
answer
1
Turing Machines and Logic
Mar 20
answer
1
What is FO(REGULAR)? (The descriptive complexity equivalent of NC1)
Apr 23, 2020
Top network posts
View all network posts
249
How do towels stay on hooks?
152
Referee wants me to add a plot – because the paper has none
129
Colleague blames me for not spotting typos when I only reviewed the structure and content
93
$-3^2 = 9?\ $ Correct syntax for a negative number with an exponent.
87
Rejection from a legitimate journal, with reviewers recommending me to try a Beall's list journal

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.