Results 161 to 170 of about 132,919 (197)
Striking the balance: Complexity, simplicity, and credibility in mathematical biology. [PDF]
Proc Natl Acad Sci U S ARodero C, Niederer SA.
europepmc +1 more source
Simplicity and Complexity in Combinatorial Optimization. [PDF]
Entropy (Basel)Dingle K, Hutter M.
europepmc +1 more source
Fundamental limits on patterning by Turing-like reaction-diffusion mechanisms
Muzatko D, Daga B, Hiscock TW.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2017
This chapter discusses Turing machines. A Turing machine is the combination of a sequential, finite-state machine plus an external read/write memory storage medium called the tape (think of a ribbon of magnetic tape). The tape is a linear sequence of squares, with each square holding one of several possible symbols.
Edna E. Reiter, Clayton Matthew Johnson
+4 more sources
This chapter discusses Turing machines. A Turing machine is the combination of a sequential, finite-state machine plus an external read/write memory storage medium called the tape (think of a ribbon of magnetic tape). The tape is a linear sequence of squares, with each square holding one of several possible symbols.
Edna E. Reiter, Clayton Matthew Johnson
+4 more sources
Cybernetics and Systems Analysis, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Minds and Machines, 2002
Summary: Accelerating Turing machines are Turing machines of a sort able to perform tasks that are commonly regarded as impossible for Turing machines. For example, they can determine whether or not the decimal representation of \(\pi\) contains \(n\) consecutive 7s, for any \(n\); solve the Turing-machine halting problem; and decide the predicate ...
openaire +2 more sources
Summary: Accelerating Turing machines are Turing machines of a sort able to perform tasks that are commonly regarded as impossible for Turing machines. For example, they can determine whether or not the decimal representation of \(\pi\) contains \(n\) consecutive 7s, for any \(n\); solve the Turing-machine halting problem; and decide the predicate ...
openaire +2 more sources
2017
A model of computation, the so-called inductive Turing machine, is introduced. In this model, a process of ''computation'' is not required to halt for giving the result. The ''computation capacity'' of inductive T- machines is shown to be strictly stronger than that of usual Turing machines.
openaire +2 more sources
A model of computation, the so-called inductive Turing machine, is introduced. In this model, a process of ''computation'' is not required to halt for giving the result. The ''computation capacity'' of inductive T- machines is shown to be strictly stronger than that of usual Turing machines.
openaire +2 more sources
1991
Abstract "In introducing the idea of a pushdown automaton in Chapter 5 we found it helpful to think of a word w = a1a2 an in A as printed on a tape with the initial state i scanning the leftmost square. An FSA can be seen as acting on w by constantly moving right, deleting a symbol at each stage.
openaire +1 more source
Abstract "In introducing the idea of a pushdown automaton in Chapter 5 we found it helpful to think of a word w = a1a2 an in A as printed on a tape with the initial state i scanning the leftmost square. An FSA can be seen as acting on w by constantly moving right, deleting a symbol at each stage.
openaire +1 more source