43:
193:". As the inputs get bigger, the amount of computational resources needed to solve a problem will increase. Thus, the resources needed to solve a problem are described in terms of
244:
has been used to model specific computations using the number of state transitions and alphabet size to quantify the computational effort required to solve a particular problem.
204:
Computational resources are useful because we can study which problems can be computed in a certain amount of each computational resource. In this way, we can determine whether
365:
60:
169:
A computational problem is generally defined in terms of its action on any valid input. Examples of problems might be "given an integer
197:, by identifying the resources as a function of the length or size of the input. Resource usage is often partially quantified using
107:
337:
126:
264:
212:. The set of all of the computational problems that can be solved using a certain amount of a certain computational resource is a
79:
370:
140:
86:
64:
93:
31:
216:, and relationships between different complexity classes are one of the most important topics in complexity theory.
75:
53:
166:, the amount of storage needed while solving the problem, but many more complicated resources have been defined.
322:
209:
152:
17:
100:
194:
148:
289:
272:
260:
330:
Signals, Systems & Computers. Conference Record of the Thirty-Second
Asilomar Conference on
333:
229:
281:
213:
159:
297:
27:
Something a computer needs needed to solve a problem, such as processing steps or memory
241:
198:
359:
293:
240:
There has been some effort to formally quantify computing capability. A bounded
42:
228:
is commonly used to describe accessible computing equipment and software. See
205:
285:
208:
for solving the problem are optimal and we can make statements about an
265:"On the Length of Programs for Computing Finite Binary Sequences"
36:
323:"Representing Information with Computational Resource Bounds"
162:, the number of steps necessary to solve a problem, and
220:
Describing generally accessible computing equipment
67:. Unsourced material may be challenged and removed.
321:Sow, Daby; Eleftheriadis, Alexandros (1998).
236:Formal quantification of computing capability
8:
158:The simplest computational resources are
127:Learn how and when to remove this message
252:
18:Memory space (computational resource)
7:
65:adding citations to reliable sources
25:
332:. Vol. 1. pp. 452–456.
177:is prime", or "given two numbers
41:
366:Computational complexity theory
141:computational complexity theory
52:needs additional citations for
1:
342:. 10.1109/ACSSC.1998.750904
147:is a resource used by some
32:Resource (computer science)
387:
29:
226:"Computational resource"
185:, calculate the product
76:"Computational resource"
371:Computational resources
210:algorithm's efficiency
153:computational problems
145:computational resource
286:10.1145/321356.321363
173:, determine whether
149:computational models
61:improve this article
30:For other uses, see
261:Gregory J., Chaitin
195:asymptotic analysis
151:in the solution of
273:Journal of the ACM
230:Utility computing
137:
136:
129:
111:
16:(Redirected from
378:
351:
350:
348:
347:
327:
318:
312:
311:
309:
308:
302:
296:. Archived from
269:
257:
214:complexity class
160:computation time
132:
125:
121:
118:
112:
110:
69:
45:
37:
21:
386:
385:
381:
380:
379:
377:
376:
375:
356:
355:
354:
345:
343:
340:
325:
320:
319:
315:
306:
304:
300:
267:
259:
258:
254:
250:
238:
222:
133:
122:
116:
113:
70:
68:
58:
46:
35:
28:
23:
22:
15:
12:
11:
5:
384:
382:
374:
373:
368:
358:
357:
353:
352:
338:
313:
280:(4): 547–569.
251:
249:
246:
242:Turing machine
237:
234:
221:
218:
199:Big O notation
135:
134:
117:September 2007
49:
47:
40:
26:
24:
14:
13:
10:
9:
6:
4:
3:
2:
383:
372:
369:
367:
364:
363:
361:
341:
339:0-7803-5148-7
335:
331:
324:
317:
314:
303:on 2007-02-05
299:
295:
291:
287:
283:
279:
275:
274:
266:
262:
256:
253:
247:
245:
243:
235:
233:
231:
227:
219:
217:
215:
211:
207:
202:
200:
196:
192:
188:
184:
180:
176:
172:
167:
165:
161:
156:
154:
150:
146:
142:
131:
128:
120:
109:
106:
102:
99:
95:
92:
88:
85:
81:
78: –
77:
73:
72:Find sources:
66:
62:
56:
55:
50:This article
48:
44:
39:
38:
33:
19:
344:. Retrieved
329:
316:
305:. Retrieved
298:the original
277:
271:
255:
239:
225:
223:
203:
190:
186:
182:
178:
174:
170:
168:
164:memory space
163:
157:
144:
138:
123:
114:
104:
97:
90:
83:
71:
59:Please help
54:verification
51:
360:Categories
346:2007-09-25
307:2007-09-25
248:References
206:algorithms
87:newspapers
294:207698337
224:The term
263:(1966).
101:scholar
336:
292:
103:
96:
89:
82:
74:
326:(PDF)
301:(PDF)
290:S2CID
268:(PDF)
108:JSTOR
94:books
334:ISBN
181:and
143:, a
80:news
282:doi
139:In
63:by
362::
328:.
288:.
278:13
276:.
270:.
232:.
201:.
155:.
349:.
310:.
284::
191:y
189:*
187:x
183:y
179:x
175:n
171:n
130:)
124:(
119:)
115:(
105:·
98:·
91:·
84:·
57:.
34:.
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
