User gnasher729

68 votes

Accepted

Time complexity of an algorithm: Is it important to state the base of the logarithm?

algorithms time-complexity

answered May 20, 2019 at 19:24

47 votes

Accepted

Given a specific computer system, is it possible to estimate the actual precise run time of a piece of Assembly code

assembly

answered Aug 31, 2019 at 19:06

33 votes

Accepted

Assembly writer vs compiler in VLIW architecture

compilers assembly

answered May 14, 2019 at 6:30

28 votes

Time complexity of min() and max() on a list of constant size?

time-complexity python

answered Mar 11, 2021 at 16:37

28 votes

Can we generate random numbers using irrational numbers like π and e?

randomized-algorithms randomness random-number-generator

answered Apr 10, 2019 at 13:01

27 votes

Is there a known maximum for how much a string of 0's and 1's can be compressed?

data-compression

answered Nov 28, 2015 at 13:44

20 votes

Accepted

Inequality caused by float inaccuracy

arithmetic floating-point numerical-algorithms

answered Nov 7, 2016 at 23:29

13 votes

Accepted

Can we create faster sort algorithm than O(N log N)

optimization time-complexity sorting

answered Aug 26, 2017 at 13:02

12 votes

Why is English not a regular language?

formal-languages regular-languages finite-automata

answered Oct 22, 2019 at 19:38

12 votes

Accepted

If NP is the class of problems that cannot be solved in polynomial time, what is co-NP?

complexity-theory np complexity-classes

answered Nov 13, 2016 at 0:08

11 votes

Accepted

Why is copy speed periodic? (or seems to be)

operating-systems

answered Nov 11, 2021 at 15:10

11 votes

Why the 127 encodings of ASCII needed to be extended to 256?

data-structures history encoding-scheme binary

answered Mar 21, 2020 at 7:41

11 votes

Accepted

Is there an polynomial time algorithm to find that sum of square-roots is less than an integer?

algorithms complexity-theory time-complexity

answered Dec 2, 2017 at 14:46

10 votes

Why is A implies B true if A is false and B is false?

terminology logic first-order-logic propositional-logic

answered Nov 25, 2016 at 20:40

9 votes

Why do we use the number of compares to measure the time complexity when compare is quite cheap?

algorithms time-complexity comparison

answered Mar 22, 2020 at 7:50

9 votes

What did Turing mean when saying that "machines cannot give rise to surprises" is due to a fallacy?

turing-machines computability computation-models

answered Apr 19, 2019 at 14:42

9 votes

How does a computer interpret real numbers?

mathematical-programming mathematical-foundations

answered Mar 22, 2019 at 18:44

9 votes

Accepted

Why would you introduce the goto statement into a modern language?

programming-languages language-design

answered Oct 28, 2016 at 21:54

9 votes

"For small values of n, O(n) can be treated as if it's O(1)"

asymptotics

answered Dec 16, 2014 at 18:42

9 votes

Why doesn't playing audio stop other tasks?

cpu multi-tasking

answered May 30, 2017 at 18:56

8 votes

How does editing software (like Microsoft word or Gmail) pick the 2nd string to compare in Levenshtein distance?

algorithms strings edit-distance

answered Sep 6, 2021 at 6:54

8 votes

How is ‘x + ½ = 2 and x ∈ ℤ’ an open statement?

first-order-logic

answered Oct 11, 2021 at 22:03

8 votes

Why is addition as fast as bit-wise operations in modern processors?

computer-architecture arithmetic circuits cpu digital-circuits

answered May 24, 2017 at 20:32

8 votes

Accepted

Which one grows faster asymptotically: $\log(\log^an)$ or $\log^a(\log n)$

asymptotics

answered Feb 15, 2017 at 1:13

8 votes

Accepted

Time complexity of this while loop

algorithm-analysis runtime-analysis randomness average-case

answered Jul 13, 2017 at 16:10

7 votes

Find the number using binary search against one possible lie

algorithms dynamic-programming binary-trees information-theory binary-search

answered Jun 5, 2020 at 16:39

7 votes

Accepted

Is there a way to calculate the number of all the languages over an alphabet?

automata

answered Mar 30, 2019 at 18:42

7 votes

Accepted

What is instruction throughput and instruction latency?

terminology computer-architecture cpu

answered Sep 5, 2017 at 6:28

7 votes

Why must a Turing Machine that Repeats the Same Configuration Twice be in an Infinite Loop?

complexity-theory turing-machines

answered Jun 30, 2018 at 16:06

7 votes

Why does restricting size of input for NP complete problem imply a runtime of O(1)?

complexity-theory time-complexity np-complete

answered Jul 10, 2016 at 20:32

Stack Exchange Network

current community

your communities

more stack exchange communities

1,514 Answers

Time complexity of an algorithm: Is it important to state the base of the logarithm?

Given a specific computer system, is it possible to estimate the actual precise run time of a piece of Assembly code

Assembly writer vs compiler in VLIW architecture

Time complexity of min() and max() on a list of constant size?

Can we generate random numbers using irrational numbers like π and e?

Is there a known maximum for how much a string of 0's and 1's can be compressed?

Inequality caused by float inaccuracy

Can we create faster sort algorithm than O(N log N)

Why is English not a regular language?

If NP is the class of problems that cannot be solved in polynomial time, what is co-NP?

Why is copy speed periodic? (or seems to be)

Why the 127 encodings of ASCII needed to be extended to 256?

Is there an polynomial time algorithm to find that sum of square-roots is less than an integer?

Why is A implies B true if A is false and B is false?

Why do we use the number of compares to measure the time complexity when compare is quite cheap?

What did Turing mean when saying that "machines cannot give rise to surprises" is due to a fallacy?

How does a computer interpret real numbers?

Why would you introduce the goto statement into a modern language?

"For small values of n, O(n) can be treated as if it's O(1)"

Why doesn't playing audio stop other tasks?

How does editing software (like Microsoft word or Gmail) pick the 2nd string to compare in Levenshtein distance?

How is ‘x + ½ = 2 and x ∈ ℤ’ an open statement?

Why is addition as fast as bit-wise operations in modern processors?

Which one grows faster asymptotically: $\log(\log^an)$ or $\log^a(\log n)$

Time complexity of this while loop

Find the number using binary search against one possible lie

Is there a way to calculate the number of all the languages over an alphabet?

What is instruction throughput and instruction latency?

Why must a Turing Machine that Repeats the Same Configuration Twice be in an Infinite Loop?

Why does restricting size of input for NP complete problem imply a runtime of O(1)?