Automation-Requiring Task
(Redirected from Automation-requiring Task)
Jump to navigation
Jump to search
An Automation-Requiring Task is a task that requires being performed primarily by an automation-requiring software-based system.
- AKA: Automated Task, Automatic Task, Computational Task, Software-Based Task.
- Context:
- It can typically be performed by an Automation-Requiring System that implements an automation-requiring algorithm.
- It can typically require Computational Resources for automation-requiring task execution.
- It can often be created through a Task Automation Task.
- It can often integrate with Human-Requiring Tasks in automation-requiring workflows.
- ...
- It can range from being a Semi-Automated Task to being a Fully-Automated Task, depending on its automation-requiring task autonomy level.
- It can range from being a Simple Automation-Requiring Task to being a Complex Automation-Requiring Task, depending on its automation-requiring task complexity.
- ...
- Example(s):
- Automation-Requiring Industrial Tasks, such as:
- Automated Intelligence-Requiring Tasks, such as:
- ...
- Counter-Example(s):
- Human-Requiring Tasks, which require human cognition or manual dexterity.
- Manual Tasks, which lack automation-requiring capability.
- Hybrid Tasks that require equal human involvement and automation-requiring system support.
- See: Task, Automated System, Task Automation Task, Computational Complexity Theory.
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 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.