Computer Science
user avatar
user avatar
user avatar
roctothorpe
  • Member for 4 years, 6 months
  • Last seen more than a month ago
Profile Activity
Stats
1,118
reputation
59k
reached
17
answers
4
questions
Communities
About

Currently: software engineer @ LinkedIn

Previously: MS ∈ CS @ Stanford

I'm fond of: puzzles, tea, subway maps, hiking, obscure typographical symbols

Badges
View all badges
This user doesn’t have any gold badges yet.
7
silver badges
19
bronze badges
Top tags
View all tags
30
Score
6
Posts
29
Posts %
28
Score
6
Posts
29
Posts %
27
Score
3
Posts
14
Posts %
21
Score
3
Posts
14
Posts %
18
Score
4
Posts
19
Posts %
8
Score
2
Posts
10
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
17
Is a Turing machine without the ability to write on blank cells less powerful than standard Turing?
Dec 24, 2017
question
11
Intuition behind the Master Theorem
Dec 26, 2017
answer
9
Aho-Corasick for a set of patterns
Aug 22, 2018
answer
7
When to add and when to multiply to find time complexity
Nov 18, 2018
answer
6
How to tell if a language is recognizable, co-recognizable or decidable?
Jan 19, 2018
answer
4
Minimum number of states in dfa accepting binary number with decimal equivalent divisible by $n$
Dec 24, 2017
answer
4
Can't Understand this Subset Construction Proof
Mar 19, 2018
answer
4
What is the relation between NP/NP-hard problems and Recursive/R.E languages? any of them a subset of another?
Apr 14, 2018
answer
4
Whether TM accepts epsilon?
Jan 12, 2018
answer
3
Does a turing machine halt with input left on tape?
Feb 3, 2018

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.