Computer Science
Profile Activity
Meta user
Network profile
1,088
reputation
6
18

roctothorpe

Currently: software engineer @ LinkedIn

Previously: MS ∈ CS @ Stanford

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

17
answers
4
questions
~49k
people reached
  • Member for 3 years, 7 months
  • 74 profile views
  • Last seen May 21 at 21:44

Communities (3)

Top network posts

We respect a laser-like focus on one topic.

Top tags (34)

Score 29
Posts 6
Posts % 29
Score 28
Posts 3
Score 27
Posts 6
Score 20
Posts 3
Score 17
Posts 4
Score 9
Posts 2
View all tags →

Top posts (21)

All Questions Answers
Votes Newest
17 Is a Turing machine without the ability to write on blank cells less powerful than standard Turing? Dec 24 '17
9 Aho-Corasick for a set of patterns Aug 22 '18
9 Intuition behind the Master Theorem Dec 26 '17
7 When to add and when to multiply to find time complexity Nov 18 '18
7 How to tell if a language is recognizable, co-recognizable or decidable? Jan 19 '18
4 Can't Understand this Subset Construction Proof Mar 19 '18
4 Whether TM accepts epsilon? Jan 12 '18
3 What is the relation between NP/NP-hard problems and Recursive/R.E languages? any of them a subset of another? Apr 14 '18
3 Does a turing machine halt with input left on tape? Feb 3 '18
3 Minimum number of states in dfa accepting binary number with decimal equivalent divisible by $n$ Dec 24 '17
View all questions and answers →

Badges (24)

Gold

—

Silver

6

Rarest

Bronze

18

Rarest

View all badges →

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.