question

Stats

858

reputation

87k

reached

answers

questions

Loading…

Communities

View all

About

MIT PhD '15 Theoretical Physics

Currently at Google

Badges

View all badges

This user doesn’t have any gold badges yet.

silver badges

Necromancer

× 2

Nov 27, 2021
Yearling

× 4

May 6, 2022

bronze badges

Self-Learner

Oct 12, 2020
Excavator

Oct 29, 2020
Curious

Oct 12, 2020

Top tags

View all tags

turing-machines

Score

Posts

Posts %

algorithms

Score

Posts

Posts %

graphs

Score

Posts

Posts %

graph-traversal

Score

Posts

Posts %

computability

Score

Posts

Posts %

undecidability

Score

Posts

Posts %

Top posts

View all questions and answers

Algorithm to find diameter of a tree using BFS/DFS. Why does it work?

Jan 15, 2018

Show that the single-tape TMs that can not write on the portion of the tape containing the input string recognize only regular languages

Aug 24, 2020

is it possible to determine using a single depth-first search, in O(V+E) time, whether a directed graph is singly connected?

Jan 15, 2018

Undecidability of "is this CFG prefix-free?"

Oct 12, 2020

Undecidability of "is this CFG prefix-free?"

Oct 11, 2020

is it decidable whether a grammar in Chomsky normal form has useless rules?

Oct 12, 2020

NP completeness of deciding whether a set of examples, consisting of strings and states, has a corresponding DFA?

May 16, 2021

how to bound the probability that quicksort takes greater than n lg n time?

Jan 1, 2018

how does Kleene-Post show two languages that are not Turing reducible to each other?

Oct 25, 2020

how to bound the probability that quicksort takes greater than n lg n time?

Jan 1, 2018