- Braid is undecidable
2014/12/02 by Linus Hamilton, Hamilton, Linus · 2 voices
Computer Science · Mathematics · #Algorithm #Artificial Intelligence in Games #Artificial intelligence #Braid #Braid group #Braid theory #Cellular Automata and Applications #Combinatorics #Computability, Logic, AI Algorithms #Computation #Computer science #DTIME #Description number #Discrete mathematics #EXPTIME #Embedding #Mathematics #NSPACE #Super-recursive algorithm #Theoretical computer science #Time hierarchy theorem #Turing machine #Undecidable problem #Universal Turing machine #cs.CC
- Memcomputing NP -complete problems in polynomial time using polynomial resources and collective states
2014/11/18 by Fabio L. Traversa, Chiara Ramella, Fabrizio Bonani +1 · 1 voice · 7 citations
Computer Science · Engineering · Mathematics · #Advanced Memory and Neural Computing #Algorithm #Architecture #Computation #Computer science #Ferroelectric and Negative Capacitance Devices #Mathematics #NP #NSPACE #Non-deterministic Turing machine #Nondeterministic algorithm #Overhead (engineering) #Polynomial #Programming language #Quantum Computing Algorithms and Architecture #State (computer science) #Theoretical computer science #Time hierarchy theorem #Turing machine #Universal Turing machine #Von Neumann architecture #cs.ET #cs.NE
- Neural Turing Machines
2014/10/20 by Alex Graves, Greg Wayne, Graves, Alex +3 · 11 voices · 107 citations
Computer Science · Engineering · #Advanced Memory and Neural Computing #Algorithm #Artificial intelligence #Artificial neural network #Computation #Computer science #Content-addressable memory #Description number #Ferroelectric and Negative Capacitance Devices #NSPACE #Neural Networks and Applications #Non-deterministic Turing machine #Programming language #Super-recursive algorithm #Theoretical computer science #Turing #Turing machine #Turing machine examples #Universal Turing machine #Von Neumann architecture #cs.NE
- Hypercomputation: computing more than the Turing machine
2002/09/25 by Toby Ord, Ord, Toby · 1 voice · 5 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Artificial intelligence #Benford’s Law and Fraud Detection #Computability, Logic, AI Algorithms #Computation #Computer science #Description number #Gödel #Gödel's incompleteness theorems #Mathematics #Model of computation #NSPACE #Non-deterministic Turing machine #Programming language #Quantum Computing Algorithms and Architecture #Randomness #Super-recursive algorithm #Theoretical computer science #Time hierarchy theorem #Turing #Turing machine #Turing machine examples #Universal Turing machine #cs.OH #math-ph #math.LO #math.MP #msc:03D10 #msc:68Q10 #msc:68Q30
- On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape turing machines
1989/02/01 by Zvi Galil, Ravi Kannan, Endre Szemerédi · 1 citation
Computer Science · Mathematics · #Advanced Data Storage Technologies #Algorithm #Cellular Automata and Applications #Combinatorics #Computation #Discrete mathematics #Mathematics #NSPACE #Non-deterministic Turing machine #Nondeterministic algorithm #Probabilistic Turing machine #Quantum Computing Algorithms and Architecture #Sublinear function #Time hierarchy theorem #Turing machine #Upper and lower bounds
- The other Turing machine
1977/01/01 by B. Carpenter, B. E. Carpenter, R. W. Doran +1 · 1 citation
Computer Science · #Computability, Logic, AI Algorithms #Computer science #Description number #NSPACE #Non-deterministic Turing machine #Programming language #Super-recursive algorithm #Turing #Turing machine #Turing machine examples #Universal Turing machine