Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

A New Reducibility between Turing‐ and wtt‐Reducibility

View through CrossRef
AbstractA new reducibility between Turing and weak truth‐table reducibility is defined, which gives an affirmative answer to the open question about the existence of such an intermediate reducibility proposed formally by M. Stob.Mathematics Subject Classification: 03D25.
Title: A New Reducibility between Turing‐ and wtt‐Reducibility
Description:
AbstractA new reducibility between Turing and weak truth‐table reducibility is defined, which gives an affirmative answer to the open question about the existence of such an intermediate reducibility proposed formally by M.
Stob.
Mathematics Subject Classification: 03D25.

Related Results

Whitepaper WTT Impact Canvas: Entwicklung und Pilotierung eines Canvas zur Darstellung der Wirkung von Transfermaßnahmen
Whitepaper WTT Impact Canvas: Entwicklung und Pilotierung eines Canvas zur Darstellung der Wirkung von Transfermaßnahmen
Die Messung möglicher Effekte des Wissens-und Technologietransfers (WTT) als Teil der Dritten Mission hat eine hohe Relevanz, wenngleich nicht alles über reine Kennzahlen erfasst w...
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’s model of the mind
Turing’s model of the mind
This chapter examines Alan Turing’s contribution to the field that offers our best understanding of the mind: cognitive science. The idea that the human mind is (in some sense) a c...
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...
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...
Computing machinery and creativity: lessons learned from the Turing test
Computing machinery and creativity: lessons learned from the Turing test
Purpose – The purpose of this paper is to investigate the relevance and the appropriateness of Turing-style tests for computational creativity. ...

Back to Top