Tag: turing-machines


Found 104 results for 'turing-machines'.


51) oracles - Is there a definitive reference for Turing machines with multiple oracle tapes?
52) computability - Is a turing machine with random number generator more powerful?
53) automata-theory - What kind of computational model is the brain?
54) turing-machines - Busy beaver candidate elimination: Minimum space requirements
55) computability - Enumerating decidable languages
56) automata-theory - Are all turing machines paths predictable?
57) computability - What is the simplest universal unidimensional interaction net system?
58) soft-question - Real computers have only a finite number of states, so what is the relevance of Turing machines to real computers?
59) fl.formal-languages - Are there any open problems concerning decidability?
60) computability - Langton's ant highway conjecture and undecidability
61) lo.logic - Program transformation using partial functions which preserve partial correctness
62) computability - Computing the DAG of a program given source code or AST
63) cc.complexity-theory - A notion of time for uniform circuits
64) turing-machines - A metric space on Turing machines
65) cc.complexity-theory - Time Hierarchies in DSPACE(O(s(n)))
66) turing-machines - Prime factorisation of decidable problems
67) reference-request - Reference for checking primitive recursiveness
68) reference-request - Is there a theory of computation that takes failure and decay of the computation substrate into account?
69) fl.formal-languages - What is the practical importance of making or using a Turing complete language?
70) machine-learning - What is the VC dimension of Turing machines with specified maximum size?
71) cc.complexity-theory - Is every "nontrivial" algorithm Turing-complete?
72) computability - Can all mathematical operations be encoded with a Turing Complete language?
73) computability - What functions can System F not compute?
74) turing-machines - For a specific unbounded Turing machine, is its Halting problem undecidable?
75) soft-question - (How) Could we discover/analyze NP problems in the absence of the Turing model of computation?
76) computability - Is there a name for "physical things out of which one can build a Turing machine"?
77) computability - Was Babbage's Analytical Engine really turing-complete?
78) computability - Uniform mortality problem for Turing Machines
79) turing-machines - Source of Turing-machine illustration
80) turing-machines - Is multiprocessing possible on a Turing Machine?
81) computability - Was bombe machine turing complete?
82) turing-machines - Dependence of decidability on the encoding of Turing machines
83) computability - Realizability theory: difference in power between Lambda calculus and Turing Machines
84) computability - Is every busy beaver strictly monotonic asymptotically?
85) computability - Why does the Placid Platypus function grow faster than any computable function?
86) computability - A definition of computable numbers that requires to "wait an infinite amount of time" to get the correct result; how to make this precise
87) turing-machines - Is there an easy way to improve this Tree Normal Form for Busy Beaver candidates?
88) computability - Definition of a prefix-free Turing machine
89) turing-machines - Does mathematical model for conccurent computations exist?
90) computability - Is there any way to differentiate between "sort of" Turing-Complete and "really" Turing-Complete?
91) turing-machines - Turing Machine restrictions that render halting decidable
92) computability - Does an infinitely long tape make any difference when proving theorems about Turing Machines?
93) lo.logic - Is there a reasonable automated proof system for TCS theorems?
94) computability - Undecidable problems not Turing-complete?
95) turing-machines - Distributed Turing Machine?
96) pl.programming-languages - Template Metaprogramming and Turing Completeness
97) cc.complexity-theory - Characterisation of P in terms of register machines
98) computability - A total language that only a Turing complete language can interpret
99) computability - If an abstract machine can simulate itself, does that make it Turing complete?
100) turing-machines - How good can a halting detector be?