Newest Questions

Ask Question
50,173 questions
Newest Active Bountied Unanswered
Filter by
Sorted by
Tagged with
0 votes
0 answers
7 views

When trying to prove that a language $L$ is not regular, we often use pumping lemma for regular languages to reach a contradiction. When doing so, we take a specific word $w$, and then consider ...
Zobody's user avatar
  • 101
-1 votes
0 answers
29 views

I'm a student trying to run some numerical simulations based on a complex scaling law, but I'm getting some results that feel "too specific." I suspect I might be making a mistake in my ...
Smile's user avatar
  • 1
0 votes
0 answers
21 views

In Express boolean logic operations in zero-one integer linear programming (ILP) The definition for $AND(x,y)$ is given as $\max(0,x+y-1)\leq AND(x,y)\leq\min(1,x,y)$. In we have $x,y\in\{-1,0,+1\}$ ...
Turbo's user avatar
  • 2,957
0 votes
0 answers
15 views

I am reading a lecture note on randomized complexity theory, which explains why the following result holds. $$\mathsf{NP^{BPP}=NP^{BPP[1]}}.$$ Comment 1: I understand this implies multiple (adaptive ...
Manish Kumar's user avatar
  • 253
0 votes
0 answers
23 views

I’m trying to understand the correctness of the OM(2) algorithm in the Byzantine Generals problem (with 7 generals, up to 2 traitors). Assume the commander is loyal, and two lieutenants are traitors: ...
Pierre's user avatar
  • 1
-1 votes
0 answers
22 views

I was reading sipser’s book and I know by the church turing thesis that during machines are equivalent to informal descriptions of algorithms. In chapter 4, we are looking at decidability, suppose we ...
Ddli's user avatar
  • 1
2 votes
0 answers
21 views

The IEEE-754 standard specifies several operations that 'rounds' fractional numbers to integers (contrasting conversions to integer data types, which is not the focus of this Q). There are several ...
DannyNiu's user avatar
  • 478
0 votes
0 answers
11 views

I'm trying to practice and drill my weaknesses in AP CSA before the exam comes up in a few weaks. Since it is considered a college level computer science class, does anyone who has experience with ...
grumbleArc_449's user avatar
  • 1
2 votes
2 answers
72 views

Let $L_1 = \{ww^{R} \mid w \in \{0,1\}^{*}\}$ where $w^{R}$ denotes the reverse of the string $w$. Now consider language $L_2 = \{wtw^{R} \mid w,t \in \{0,1\}^{*},|t|=|w|\}$. $\{0,1\}^{*}$ denotes set ...
Coreman's user avatar
  • 81
0 votes
1 answer
27 views

I can deduce $\mathsf{MA}\subseteq$ $\mathsf{NP^{BPP}}$ from their definition. Is $\mathsf{NP^{BPP}}\subseteq$ $\mathsf{MA}$?
Manish Kumar's user avatar
  • 253
0 votes
0 answers
13 views

I'm making a game that needs to have grids. These grids are dynamic and can be split into multiple grids. How would I find if a grid has split? I was thinking maybe I keep a list of local components (...
qwertyuiop's user avatar
  • 1
-3 votes
0 answers
44 views

Question 1 (15 points) For each blank, fill in with either O, Ω, or Θ. If the two functions have the same order of growth, you must use Θ to receive full credit. 3n = ___ (n²) 2n + log n = ___ (n) n −...
PRINCE NAVEEN JYOTHI's user avatar
  • 1
0 votes
0 answers
20 views

This is an old exam question from a course that I am currently taking (which lacks suggested solutions): "Both the Turing machine and the von Neumann model uses the term "state". How ...
albin's user avatar
  • 45
2 votes
2 answers
167 views

I was reading some notes from Stanford and it was stated that a nibble is half a byte. As far as I know a byte is $8$ bits, and since there are $2$ types of bit there's $2^8=256$ types of byte. Is it ...
peter petersen's user avatar
  • 131
0 votes
0 answers
57 views

I am trying to design a nondeterministic finite automaton (NFA) over the alphabet Σ = {0,1} that accepts all strings containing either the substring 011 or 1010. The constraint is that the NFA should ...
Wilfried Nendongo's user avatar
  • 1

15 30 50 per page
1
2 3 4 5
…
3345