Tag: turing-machines
Found 104 results for 'turing-machines'.
1) cc.complexity-theory - Does P contain incomprehensible languages? (TCS community wiki)
2) cc.complexity-theory - "The" category of Turing machines?
3) turing-machines - What are different definitions of Universal Turing-machine?
4) cc.complexity-theory - Can emptiness of reversal-bounded counter languages be decided in time polynomial to the number of counters?
5) cc.complexity-theory - Is $L \subset 1NL$ when $L \neq NL$?
6) automata-theory - Why were Finite Automata and Turing Machines created?
7) turing-machines - Does Wikipedia assume a solution to the halting problem in their description of universal one way functions?
8) cc.complexity-theory - Is $\mathsf{DTIME}(n) = \mathsf{DTIME}(2n)$?
9) cc.complexity-theory - Is this language recognizable by a 3 symbols TM in O(n log n)?
10) reference-request - Terminology for types of universal computation
11) computability - Conflicting definitions regarding TM and Recursively Enumerable languages
12) cc.complexity-theory - Does P contain incomprehensible languages? (TCS community wiki)
13) pl.programming-languages - Is there such a thing as a state-based programming language?
14) computability - What's the simplest noncontroversial 2-state universal Turing machine?
15) cc.complexity-theory - Time Hierarchies in DSPACE(O(s(n)))
16) cc.complexity-theory - $\ell_p$-norm preserving Turing machines
17) computability - Realizability theory: difference in power between Lambda calculus and Turing Machines
18) computability - Relationship between Turing Machine and Lambda calculus?
19) lo.logic - Church's Theorem and Gödel's Incompleteness Theorems
20) lo.logic - Church's Theorem and Gödel's Incompleteness Theorems
21) cc.complexity-theory - Oblivious Turing Machine emulation lower bound
22) computability - How come Wikipedia says that Random Turing Machines can provide uncomputable output?
23) turing-machines - Did Alan Turing's student Robin Gandy assert that Charles Babbage had no notion of a universal computing machine?
24) lambda-calculus - What does it mean that there are differing views on how computations are represented on the Turing Machine?
25) reference-request - Transition Diagram of a Universal Turing Machine
26) lambda-calculus - What does it mean that there are differing views on how computations are represented on the Turing Machine?
27) reference-request - Truly random number generator: Turing computable?
28) turing-machines - Why NL is not L
29) cc.complexity-theory - Why do we use single tape Turing machines for time complexity?
30) turing-machines - Computing input length on a one-tape Turing machine
31) automata-theory - Do bounded-visit nondeterministic linear bounded automata recognize only regular languages?
32) cc.complexity-theory - $DTIME_1(o(n^2))\setminus$ REGULAR
33) cc.complexity-theory - Circuits with oracles vs. Turing Machines with oracles
34) reference-request - Looking for Literature Source for Following idea
35) automata-theory - Turing Machines as Coalgebras
36) automata-theory - Difference between infinite state machines and turing machines
37) cr.crypto-security - Q: Trusting program output from an untrusted machine
38) cc.complexity-theory - Busy Beavers: quadratic relation of output size and running time?
39) reference-request - What is the time complexity of base conversion on a multi-tape Turing machine?
40) reference-request - iterations of a $\epsilon$-FSM transducer on a tape as equivalent to a TM computation
41) quantum-computing - Simulation of every physical quantum system on quantum computer
42) turing-machines - Multi Head universal Turing machine
43) turing-machines - Turing machines over a structure
44) automata-theory - Is there a non Turing-complete model of computation whose halting problem is undecidable?
45) automata-theory - Is there a non Turing-complete model of computation whose halting problem is undecidable?
46) reference-request - Historical reasons for adoption of Turing Machine as primary model of computation.
47) fl.formal-languages - Is the concept of the Turing Machine derived from automata?
48) computability - Characterisation of computability of partial functions from infinite words into finite words by functions with prefix-free domain
49) cc.complexity-theory - Problems with mixed unary/binary inputs
50) cc.complexity-theory - Simulating Turing machines (output included) with circuits