vix.ing · top · new · best · stats · spec
  1. Did Turing prove the undecidability of the halting problem?
    2024/06/30 by Joel David Hamkins, Theodor Nenu, Hamkins, Joel David +1 · 5 voices · 1 citation
    Computer Science · #Algorithm #Computability, Logic, AI Algorithms #Computation #Computer science #Description number #Halting problem #Programming language #Turing #Turing machine #Universal Turing machine
  2. Intrinsic Propensity for Vulnerability in Computers? Arbitrary Code Execution in the Universal Turing Machine
    2021/04/22 by Pontus Johnson, Johnson, Pontus · 2 voices · 1 citation
    Computer Science · #Advanced Malware Detection Techniques #Code (set theory) #Computation #Computer science #Computer security #Description number #Distributed systems and fault tolerance #Machine code #Programming language #Security and Verification in Computing #Super-recursive algorithm #Theoretical computer science #Turing #Turing machine #Universal Turing machine #Vulnerability (computing)
  3. Complexity Blowup in Simulating Analog Linear Time-Invariant Systems on Digital Computers
    2021/01/01 by Holger Boche, Volker Pohl · 3 voices · 1 citation
    Computer Science · Mathematics · #Algorithm #Cellular Automata and Applications #Computability #Computability, Logic, AI Algorithms #Computer science #Description number #Differentiable function #Discrete mathematics #Invariant (physics) #Mathematical analysis #Mathematics #Probabilistic Turing machine #Pure mathematics #Quantum Computing Algorithms and Architecture #Super-recursive algorithm #Turing #Turing machine #Universal Turing machine #Upper and lower bounds
  4. 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
  5. 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
  6. Infinite Time Turing Machines
    2002/11/01 by Joel David Hamkins · 1 citation
    Computer Science · Mathematics · #Advanced Topology and Set Theory #Algorithm #Computability #Computability, Logic, AI Algorithms #Computation #Computer science #Description number #Discrete mathematics #Expressive power #Mathematics #Programming language #Super-recursive algorithm #Theoretical computer science #Theory of computation #Time hierarchy theorem #Topological and Geometric Data Analysis #Transfinite number #Turing #Turing machine #Universal Turing machine
  7. 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
  8. The other Turing machine
    1977/01/01 by B. E. Carpenter, B. 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