Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged shai-simonson
0
votes
0
answers
1
DFS Modification
How DFS(Depth First Search) modification is used to find whether a graph is planar or not ?
How DFS(Depth First Search) modification is used to find whether a graph is planar or not ?
ankitgupta.1729
1.3k
views
ankitgupta.1729
asked
Mar 21, 2018
Algorithms
depth-first-search
algorithms
graph-algorithms
shai-simonson
+
–
1
votes
1
answer
2
To prove a language as Non-CFL
Can we prove a language is Non-CFL using Diagonalisation ? If yes then how ?
Can we prove a language is Non-CFL using Diagonalisation ? If yes then how ?
ankitgupta.1729
493
views
ankitgupta.1729
asked
Mar 8, 2018
Theory of Computation
shai-simonson
theory-of-computation
+
–
0
votes
1
answer
3
Self Doubt on Decidability
Here in this video https://www.youtube.com/watch?v=8TuLr0cggMY&list=PL601FC994BDD963E4&index=87 professor is explaining that Turing Machine that accept something is recursively enumerable. We would run multiple inputs on turning machine in parallel using ... there are even two strings that are being accepted won't we get to know using the same method ?
Here in this video https://www.youtube.com/watch?v=8TuLr0cggMY&list=PL601FC994BDD963E4&index=87 professor is explaining that Turing Machine that accept something is recu...
Jeevesh
429
views
Jeevesh
asked
Mar 4, 2018
Theory of Computation
theory-of-computation
turing-machine
decidability
shai-simonson
+
–
5
votes
0
answers
4
Combinatorics (Shai Simonson)
How many n length base 10 numbers are there with at least 3 zeros?
How many n length base 10 numbers are there with at least 3 zeros?
Mk Utkarsh
1.1k
views
Mk Utkarsh
asked
Jan 8, 2018
Combinatory
shai-simonson
combinatory
+
–
0
votes
0
answers
5
Shai Simonson Lectures on TOC
In the "Halting Problem" lecture, the prof. introduced a magic trick to use the fact that there exists no TM that accepts all other TM that accept themselves to prove that the halting problem is undecidable. There he asked to change the algorithm ... . It would be great if somebody can shed some light on it. Thanks! https://www.youtube.com/watch?v=e9zzY7uqT8g
In the "Halting Problem" lecture, the prof. introduced a magic trick to use the fact that there exists no TM that accepts all other TM that accept themselves to prove tha...
GautamDas
695
views
GautamDas
asked
Apr 9, 2017
Theory of Computation
halting-problem
turing-machine
theory-of-computation
shai-simonson
decidability
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
