I wonder if you could sort this out. On steam when I try and play tf2 it says 'hl2.exe has stopped working'. Is there a solution for this? Thanks.

You will need OS disk or reset disk, then when starting the computer press the buttom that says "boot menu" and pick boot from CD, then press repair if using OS disk or follow the instructions on the reset disk(S)




It is better to have 2 4GB sticks since then you can expand to 4*4gb sticks. In preformance it will be no diffrence




More info needed Try this via steam go to: preference, local files, verify the integrity of the game cache

This is a hardware problem most of the time. All modern architectures support division and modulus at the hardware level. From a broad view, it has a special circut that handles the division. The cpu will then place the integer division result in a special register and the integer remainder on another register (these registers are named $hi and $low, normally. They are also used for multiplication).
Now, this only works for integers small enough that they have native support. If you wanted to divide, say 128 bit integers, you'd have to do the bit manipulations yourself.

Going into greater detail is difficult without explaining everything that the cpu does. It's also difficult because different processors may do it differently.

Here, I found this. Maybe that's a better answer than I gave.

Everyone learns something every day Thanks

can you go into detail anyway.? If it's hard for you to do for any reasons, can you tell me the complexity of it?(as in, O(n^2) and alike).
wut. I should go over this tomorrow.

btw, I'm interested in this and in the complexity of making modulus computation because in 2009 I developed a method to check if number A divides number B and it was pretty efficient I think(if I'm not mistaken, by hand, the algorithm should be in log(n), and by comp perhaps longer) and I wanted to see if it can replace some things anywhere. I showed that algorithm to the professor who is the vice-pres of the Math department in my university(that professor is worldly-known, he's one of the best) and he said that he doesn't know the complexity in which the computer does that, so I should check. but I never found that. I'm sure if I can do it right and it has potential, this can be patented..

It's a constant time algorithm. O(1). In fact, I wouldn't even call it an algorithm. It's a hardware circuit. An atomic operation.
There are many ways of doing it in the case of non-native support, as that wiki article will show you.
Generally, such an algorithm will be O(n) where our instance characteristic is the number of bits your integers have, or some constant multiple (which we don't care about in asymptotic analysis). It can be proven by induction that the runtime complexity of a division algorithm can't be better than linear for arbitrarily sized integers, but I'm not going to do that. It can, however, be constant time for fixed sized integers (size referring to bit-size, not value-size). If we consider the bit size of the integers as the instance characteristic, then any solution is O(n). You simply cannot divide longer bit numbers as fast as smaller bit numbers because you have to do long division, which is at best a linear problem. You can optimize the hell out of division algorithms, thus making them practically faster, but you can really only adjust them by a constant multiple, thus not affecting their asymptotic behavior.

NINJA'd
It's linear. Although you're probably better at math than me, so if you can devise a division algorithm that doesn't have to visit every bit, you will also be better than logic.

DOUBLE POST
I just reread you post. What you're asking isn't how a computer divides numbers, but how it can tell if one number is divisible by another? These are two different questions. Doing the division is one way of telling, but you can also do stuff with prime factorizing them, some weird bit stuff that I don't really know about, and other mathy tricks. Usually, asking a yes or no question is much easier for a computer to handle than asking it to deal with numbers. Despite what people think, computers don't really like numbers. They like yes and no. We just make computers so that we can turn those yeses and noes into more useful things. And computers do yes and no so fast that it makes it look like they do numbers fast too. But really, if you can reduce something to a binary question, it becomes much easier.
I'm still not certain that a O(log n) divisibility algorithm is possible, but I suppose it could be.

my algorithm gets less information than division - as I said, it gives me a yes/no answer. and with time it can grow better, as in, if it has memory, next attempts will be shorter. for example, in my algorithm, I'll need about 10 moves to check if 1234567891 divides any one-digit number. (it's log10(N), but that's just a constant multiplication of log2(10) so nobody cares)

anyway - that is roughly an estimation. I don't know how computers do the modulus action, so I can't compare.

I was pretty shocked about that O(1) in division :/ you'll have to explain it to me in a pm or something, how can an electric ciruit do the math? =\

~~~
let me think about it, I'll post the real complexity of my algorithm at worst

Q=A/B

well the first thing to do is to check if B>A. if not, then remove all 0s at the end as much as possible(as in, make 2400/60 a 240/6 problem). then multiply B by a constant which can be 1, 3, 7 or 9 so that's O(1) we said, right? and then..

hmm.

so we start with (1+1+1+1+1) and we have the constant we need and we can start..

and then...we do 1+1+1 and iterate log10(A/ times at worst, then compare to a database consisting of B*{-9..9, and then say yes or no.

so generally yes, my method calculates if A divides B or not in O(log(A/). that is, assuming both numbers are small enough so that multiplication is O(1)....which is very bad because that is obviously more than O(1) and if the numbers satisfy what I said, just dividing them in O(1) is better.

but if the numbers are really really great. as in, take the largest prime known so far; around 12 mil digits in decimals if I remember correctly. and we want to check if it's prime so we want to check if it divides everything. then it would be O(log(A/) * O(multiplication). does THAT have potential to make me a millionaire?

Lol, multiplication is also O(1). In fact, multiplying is faster than dividing, which is why you usually try to multiply by a reciprocal instead of dividing. That's won't tell you a remainder, but it's faster if you just want to divide.
Now, I'm curious about what you mean by O(log A/. A and B are just numbers, so...? Are you measuring operations, or what are you analyzing?
Even assuming that you can indeed do this in log time, you'll need to build a circuit to do it, otherwise it will be slower (real time) than just using hardware modulus.

To clarify what I'm saying about O() notation, you can multiply two 32 bit integers at a constant speed, regardless of what their value is. 1*1 is exactly as fast as 12,345*67,890. Likewise, division of 1/1 is exactly as fast as 1,234,567,890/3. Getting larger than 32 bits goes into the realm of external division, which is O(n), n being the largest bit size of the integers you are dividing (which is already log_2 of your input, btw).

I'm measxuring operations. as in basic computing - you know - like how for n! you do for(i=2;i<=n;i++) res*=i;  is O(n)?

so for me, I need to run the loop for around [log(A/ /3.3~ rounded up] times. in other words, suppose I take number A, and each time I divide it by 10, till I get to the order of number B. and in each loop, separate a 1-digit number, multiply it by a constant whose order is like B(or less), and you do A/10 (rounded down) - result, and repeat. something like that.

Hey Wully do you know if this CPU will work with this heatsink? The heatsink says it works with 1155 LGA socket processors but then under "Details," it lists the CPUs it's compatible with and it has core i7 and stuff but not core i5...

Yes The cpu it self isent intressting at all, the socket (1155 in this case) is the intressting thing, now it happens that i got plenty of friends with that socket and cooler and it works like a charm, just remember to apply thermal grese

Could you find me a pretty large PC case? Not gigantic, but you know, big enough for me to fit a new processor in without breaking everything. (http://www.novatech.co.uk/products/components/cases/ something here?)

If you happen to live in sweden i got a case that is awsome you can buy It is quite large.


Well the thing is just saying you want a new case that fits a new cpu dosent tell me anything sadly

But since i do not get any info about your about the formfactor of your current setup (asuming atx/mATX)
http://www.novatech.co.uk/products/components/cases/cases/fd-ca-def-r4-bl.html ATX midi tower
http://www.novatech.co.uk/products/components/cases/cases/fd-ca-arc-mini-bl.html mATX mini tower


About all cases you can find that are mATX or bigger i can promise will fit about any cpu + cooler you throw at them

I looked up my motherboard and it's apparently a 'G41M-P28'. Will this motherboard fit the cases you're suggesting?

Edit: http://www.novatech.co.uk/products/components/cases/cases/fd-ca-def-r3-usb3-bl.html ?

http://www.novatech.co.uk/products/components/cases/cases/fd-ca-def-mini-bl.html
http://www.novatech.co.uk/products/components/cases/cases/fd-ca-arc-mini-bl.html


Since that is an atx case and your MB is an mATX case

-snip i'm dumb-

Not really

Does this work?

http://www.addictivetips.com/hardware/fix-your-graphics-card-by-baking-in-oven/

Jorster, that would likely fry it, not fix it.

But I'm not a computer expert, just from my knowledge, heat fries components.

It works, I have done it


Bawh, It does work, i have done it. It works since what you do is resolder the parts

I have a heat gun, should that be able to do the same thing?