A note on alternating one-pebble Turing machines with sublogarithmic space

2006 ◽  
Vol 98 (5) ◽  
pp. 174-176
Author(s):  
Andrzej Szepietowski
Keyword(s):  
Turing Machines ◽  
Sublogarithmic Space

scholarly journals Some properties of one-pebble Turing machines with sublogarithmic space

2005 ◽  
Vol 341 (1-3) ◽  
pp. 138-149 ◽  
Author(s):  
Atsuyuki Inoue ◽  
Akira Ito ◽  
Katsushi Inoue ◽  
Tokio Okazaki
Keyword(s):  
Turing Machines ◽  
Sublogarithmic Space

Some Assumptions about Problem Solving Representation in Turing’s Model of Intelligence

1970 ◽  
Vol 4 (2) ◽  
pp. 136-142 ◽  
Author(s):  
Raymundo Morado ◽  
Francisco Hernández-Quiroz
Keyword(s):  
Problem Solving ◽  
Computational Models ◽  
Turing Machines

Turing machines as a model of intelligence can be motivated under some assumptions, both mathematical and philosophical. Some of these are about the possibility, the necessity, and the limits of representing problem solving by mechanical means. The assumptions about representation that we consider in this paper are related to information representability and availability, processing as solving, nonessentiality of complexity issues, and finiteness, discreteness and sequentiality of the representation. We discuss these assumptions and particularly something that might happen if they were to be rejected or weakened. Tinkering with these assumptions sheds light on the import of alternative computational models.

The Essence of Quantum Computing

2018 ◽  
Author(s):  
Rajendra K. Bera
Keyword(s):  
Hilbert Space ◽  
Quantum Computing ◽  
Quantum Physics ◽  
Quantum Algorithms ◽  
Quantum Computers ◽  
Turing Machines ◽  
Classical Physics ◽  
Core Set ◽  
The World ◽  
Subordinate Role

It now appears that quantum computers are poised to enter the world of computing and establish its dominance, especially, in the cloud. Turing machines (classical computers) tied to the laws of classical physics will not vanish from our lives but begin to play a subordinate role to quantum computers tied to the enigmatic laws of quantum physics that deal with such non-intuitive phenomena as superposition, entanglement, collapse of the wave function, and teleportation, all occurring in Hilbert space. The aim of this 3-part paper is to introduce the readers to a core set of quantum algorithms based on the postulates of quantum mechanics, and reveal the amazing power of quantum computing.

Sign in / Sign up

Export Citation Format

Share Document