Computer Science

Guru

 Guru
Accepted answer and score of 40 or more. This badge can be awarded multiple times.
Awarded 143 times.
Is C actually Turing-complete?
Awarded Nov 28 at 14:34
Why is there no permutation in Regexes? (Even if regular languages seem to be able to do this)
Awarded May 22 at 21:42
Why is C's void type not analogous to the empty/bottom type?
Awarded Mar 4 at 1:17
What makes type inference for dependent types undecidable?
Awarded Feb 24 at 17:11
Deciding on Sub-Problems for Dynamic Programming
Awarded Nov 5, 2022 at 20:51
Does an Operating System inject its own machine code when you open a program?
Awarded May 15, 2022 at 20:55
Difference Between Small and Big-step Operational Semantics
Awarded Mar 24, 2022 at 18:07
Why and how is a quantum computer faster than a regular computer?
Awarded Mar 19, 2022 at 17:06
What is the definition of Computer Science, and what is the Science within Computer Science?
Awarded Jan 28, 2022 at 19:30
Why is tail recursion better than regular recursion?
Awarded Jan 9, 2022 at 6:27
What is the formal, rigorous definition of a programming language?
Awarded Nov 26, 2021 at 13:02
Formal program verification in practice
Awarded Nov 8, 2021 at 6:47
What exactly is the semantic difference between set and type?
Awarded Sep 13, 2021 at 19:25
Why does Dijkstra's algorithm fail on a negative weighted graphs?
Awarded Jul 28, 2021 at 0:12
Dependent types vs refinement types
Awarded Jun 5, 2021 at 17:06
Are modern programming languages context-free?
Awarded May 10, 2021 at 19:17
What exactly is polynomial time?
Awarded Mar 27, 2021 at 14:55
Perplexed by Rice's theorem
Awarded Feb 20, 2021 at 7:08
Can a computer determine whether a mathematical statement is true or not?
Awarded Feb 12, 2021 at 16:31
Why we still need Short Term Memory if Long Term Memory can save temporary data?
Awarded Feb 12, 2021 at 0:56
Quantum Computing and Turing Machines: Are Turing Machines still an Accurate Measure?
Awarded Feb 7, 2021 at 20:47
Why is SAT so important in theoretical computer science?
Awarded Feb 7, 2021 at 7:55
Paradox? Pure Prolog is Turing-complete and yet incapable of expressing list intersection?
Awarded Jan 5, 2021 at 17:17
Is there any reason why the modulo operator is denoted as %?
Awarded Dec 20, 2020 at 10:07
Show that { xy ∣ |x| = |y|, x ≠ y } is context-free
Awarded Dec 17, 2020 at 21:26
Algorithm that finds the number of simple paths from $s$ to $t$ in $G$
Awarded Dec 10, 2020 at 9:32
Why are mathematical proofs so hard?
Awarded Aug 23, 2020 at 4:55
The first Turing machine
Awarded Jul 28, 2020 at 8:12
Are there any problems that get easier as they increase in size?
Awarded May 28, 2020 at 8:26
What are some real world applications of graphs?
Awarded May 27, 2020 at 17:34
How does a computer determine the data type of a byte?
Awarded May 22, 2020 at 17:51
Why is the Nintendo Entertainment System (NES) referred to as an 8-bit system, rather than a 1-byte system?
Awarded May 7, 2020 at 19:26
Why do logic gates behave the way they do?
Awarded May 1, 2020 at 23:26
What is the earliest use of the "this" keyword in any programming language?
Awarded Apr 2, 2020 at 7:40
What does "context" in "context-free grammar" refer to?
Awarded Mar 25, 2020 at 18:30
Assuming P = NP, how would one solve the graph coloring problem in polynomial time?
Awarded Mar 17, 2020 at 20:50
why don't we use machines with random access memory as our basic model of computation?
Awarded Mar 4, 2020 at 6:10
What is the difference between a 'page' of memory and a 'frame' of memory?
Awarded Mar 2, 2020 at 22:50
P = NP clarification
Awarded Feb 14, 2020 at 7:25
How do O and Ω relate to worst and best case?
Awarded Feb 5, 2020 at 21:10
Do theorem provers demonstrate their own correctness?
Awarded Jan 24, 2020 at 19:50
Is a push-down automaton with two stacks equivalent to a turing machine?
Awarded Jan 6, 2020 at 9:55
Which Grows Faster: Factorial or Double Exponentiation
Awarded Nov 27, 2019 at 22:55
Factorial algorithm more efficient than naive multiplication
Awarded Nov 19, 2019 at 17:15
Knapsack problem -- NP-complete despite dynamic programming solution?
Awarded Sep 16, 2019 at 6:15
Given a specific computer system, is it possible to estimate the actual precise run time of a piece of Assembly code
Awarded Sep 3, 2019 at 16:00
Can regular languages be Turing complete?
Awarded Jun 23, 2019 at 18:25
Why are ambiguous grammars bad?
Awarded Jun 11, 2019 at 18:50
Is Lambda Calculus purely syntactic?
Awarded Jun 9, 2019 at 19:10
Time complexity of an algorithm: Is it important to state the base of the logarithm?
Awarded May 22, 2019 at 19:05
Time complexity of an algorithm: Is it important to state the base of the logarithm?
Awarded May 22, 2019 at 3:55
Why do we believe that PSPACE ≠ EXPTIME?
Awarded May 10, 2019 at 10:00
Contradiction proof for inequality of P and NP?
Awarded Apr 28, 2019 at 21:20
What is a the fastest sorting algorithm for an array of integers?
Awarded Apr 5, 2019 at 3:25
Why would anyone want CISC?
Awarded Mar 12, 2019 at 20:30
What happens to the cache contents on a context switch?
Awarded Feb 28, 2019 at 0:10
Do lossless compression algorithms reduce entropy?
Awarded Feb 4, 2019 at 5:10
Understanding serialization
Awarded Jan 28, 2019 at 3:50
Find median of unsorted array in $O(n)$ time
Awarded Jan 22, 2019 at 20:55
What important/crucial real-world applications use blockchain?
Awarded Jan 7, 2019 at 10:45
1
2 3

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.