answersLogoWhite

0


Best Answer

A compute intensive problem runs on an available processor, until such time that it reaches a blocking state.

User Avatar

Wiki User

12y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

11y ago

Supercomputer

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What does a compute-intensive problem run on?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Does mornings run affect any health or heart problem?

Does morning run affect any health or heart problem


Who owns Fireball Run Whiskey?

Me, Problem?


What should you do after you have a problem?

Look in the face of the problem and you will find the solution. Never run away from it


If you have loud noises in your pipes when the dishwasher is run and then you find the dishwasher didn't empty the soap or run water do you have a plumbing problem or a problem with the dishwasher?

The problem is the solinoid valve in the dishwasher Pay your water bill


Can you have 0 run in a rise over run problem?

Yes, but the the line is vertical and the slope (or gradient) is undefined.


Cooling fan problem?

If you have a problem with your cooling fan it may be an electrical problem. You don't want to drive you car in this condition because it can run hot.


Can a car run if one of the bolts on the water pump is missing?

It can run but if it is leaking coolant it will cause a problem soon.


Can Microsoft Office 2007 run on Window 8?

Yes, no problem.


What is the problem with my air coondition it only works on low?

air conditioner will not run ac lit flashing.but it run when you by pass from the relayed only run on low.


Can i run black ops on my PC?

You will need to check what is required of your computer to run it but if it runs windowns 7 should have no problem.


Did Kesha steal run devil run from snsd?

Seriously, I think you have a problem. You should go and ask Kesha directly


What is the first np-hard problem?

You can use the bounded tiling problem. Given a problem in NP A, it has a turing machine M that recognizes its language. We construct tiles for the bounded tiling problem that will simulate a run of M. Given input x, we ask if there is a tiling of the plane and answer that will simulate a run of M on x. We answer true iff there is such a tiling.