# Automation-requiring Task

(Redirected from Automated Task)

An Automation-requiring Task is a task with a task requirement that it be largely performed by a software-based system.

**AKA:**Software-based Task, Computational Task.**Context:**- It can be solved by an Automated System/Software-based System (that applies a computation algorithm)..
- It can be created by a Task Automation Task.
- It can range from being a Semi-Automated Task to being a Fully-Automated Task.

**Example(s):****Counter-Example(s):**- a Human-requiring Task, such as a manual task.

**See:**Theoretical Computer Science, Mathematical Object, Computers, Algorithms, Analysis of Algorithms.

## References

### 2015

- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/Computational_problem Retrieved:2015-6-17.
- In theoretical computer science, a
**computational problem**is a mathematical object representing a collection of questions that computers might be able to solve. For example, the problem of '*factoring*:"Given a positive integer n*, find a nontrivial prime factor of*n*." is a computational problem. Computational problems are one of the main objects of study in theoretical computer science. The field of algorithms studies methods of solving computational problems efficiently. The complementary field of computational complexity attempts to explain why certain computational problems are intractable for computers.**A computational problem can be viewed as an infinite collection of*instances*together with a*solution for every instance. For example in the factoring problem, the instances are the integers*n*, and solutions are prime numbers*p*that describe nontrivial prime factors of*n*.It is conventional to represent both instances and solutions by binary strings, namely elements of {0, 1}

^{*}. For example, numbers can be represented as binary strings using the binary encoding. (For readability, we identify numbers with their binary encodings in the examples below.)

- In theoretical computer science, a