Javascript must be enabled to continue!
Computing machinery and creativity: lessons learned from the Turing test
View through CrossRef
Purpose
– The purpose of this paper is to investigate the relevance and the appropriateness of Turing-style tests for computational creativity.
Design/methodology/approach
– The Turing test is both a milestone and a stumbling block in artificial intelligence (AI). For more than half a century, the “grand goal of passing the test” has taught the authors many lessons. Here, the authors analyze the relevance of these lessons for computational creativity.
Findings
– Like the burgeoning AI, computational creativity concerns itself with fundamental questions such as “Can machines be creative?” It is indeed possible to frame such questions as empirical, Turing-style tests. However, such tests entail a number of intricate and possibly unsolvable problems, which might easily lead the authors into old and new blind alleys. The authors propose an outline of an alternative testing procedure that is fundamentally different from Turing-style tests. This new procedure focuses on the unfolding of creativity over time, and – unlike Turing-style tests – it is amenable to a more meaningful statistical testing.
Research limitations/implications
– This paper argues against Turing-style tests for computational creativity.
Practical implications
– This paper opens a new avenue for viable and more meaningful testing procedures.
Originality/value
– The novel contributions are: an analysis of seven lessons from the Turing test for computational creativity; an argumentation against Turing-style tests; and a proposal of a new testing procedure.
Title: Computing machinery and creativity: lessons learned from the Turing test
Description:
Purpose
– The purpose of this paper is to investigate the relevance and the appropriateness of Turing-style tests for computational creativity.
Design/methodology/approach
– The Turing test is both a milestone and a stumbling block in artificial intelligence (AI).
For more than half a century, the “grand goal of passing the test” has taught the authors many lessons.
Here, the authors analyze the relevance of these lessons for computational creativity.
Findings
– Like the burgeoning AI, computational creativity concerns itself with fundamental questions such as “Can machines be creative?” It is indeed possible to frame such questions as empirical, Turing-style tests.
However, such tests entail a number of intricate and possibly unsolvable problems, which might easily lead the authors into old and new blind alleys.
The authors propose an outline of an alternative testing procedure that is fundamentally different from Turing-style tests.
This new procedure focuses on the unfolding of creativity over time, and – unlike Turing-style tests – it is amenable to a more meaningful statistical testing.
Research limitations/implications
– This paper argues against Turing-style tests for computational creativity.
Practical implications
– This paper opens a new avenue for viable and more meaningful testing procedures.
Originality/value
– The novel contributions are: an analysis of seven lessons from the Turing test for computational creativity; an argumentation against Turing-style tests; and a proposal of a new testing procedure.
Related Results
Delilah—encrypting speech
Delilah—encrypting speech
Once Enigma was solved and the pioneering work on Tunny was done, Turing’s battering-ram mind was needed elsewhere. Routine codebreaking irked him and he was at his best when break...
Turing machines
Turing machines
Turing machines are abstract computing devices, named after Alan Mathison Turing. A Turing machine operates on a potentially infinite tape uniformly divided into squares, and is ca...
Provocative Tests in Diagnosis of Thoracic Outlet Syndrome: A Narrative Review
Provocative Tests in Diagnosis of Thoracic Outlet Syndrome: A Narrative Review
Abstract
Thoracic outlet syndrome (TOS) is a group of conditions caused by the compression of the neurovascular bundle within the thoracic outlet. It is classified into three main ...
Turing Patterns
Turing Patterns
In the first chapter of this book, we noted the “dark age” of nearly forty years separating the work of Bray and Lotka in the early 1920s and the discovery of the BZ reaction in th...
Generalized Computational Systems
Generalized Computational Systems
The definition of a computational system that I proposed in chapter 1 (definition 3) employs the concept of Turing computability. In this chapter, however, I will show that this co...
The Universal Turing Machine: A Half-Century Survey
The Universal Turing Machine: A Half-Century Survey
Abstract
This volume commemorates the work of Alan Turing, because it was Turing who not only introduced the most persuasive and influential concept of a machine mod...
Turing Incomputable Computation
Turing Incomputable Computation
A new computing model, called the active element machine (AEM), is presented that demonstrates Turing incomputable computation using quantum random input. The AEM deterministically...
The Essential Turing
The Essential Turing
Abstract
Alan Turing was one of the most influential thinkers of the 20th century. In 1935, aged 22, he developed the mathematical theory upon which all subsequent s...

