I M/G/C Queue Theory: Proving Results & Finding Sources

  • I
  • Thread starter Thread starter mertcan
  • Start date Start date
  • Tags Tags
    Queue Theory
mertcan
Messages
343
Reaction score
6
upload_2016-12-8_18-40-28.png

hi, initially when I saw these statements , I got really amazed, and now I endeavor to find the proofs of these statements, bu I would like assure you of the fact that there are very very very few sources which evaluate M/G/K or M/G/infinite queue, mostly sources prefer to handle the subject of M/G/1 queue. Therefore, I am really asking you: Could you prove how these statements are possible to me using some mathematical demonstrations? Is there a proof of results above?
 
Physics news on Phys.org
@Ray Vickson and other respectable forum members, Is there a incomprehensible, complex situation in my question? Why can't I get any support from you? I am absolutely aware that most of you are very capable of overcoming my question easily. Why don't you prefer to help me?
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top