Hacker GitHub

← All repos

jbangert/trapcc

View on GitHub ↗ ★ 1,327 C

Computing with traps

30 mentions on Hacker News by 27 people: 8 stories, 22 comments · first 2013-02-22 · latest 2026-08-08

Mentions per year 30 mentions · busiest year 2013 (6)
20082026
  1. …fault that creates another lookup that... Leads to x86 page table MMU magic being turing complete: https://github.com/jbangert/trapcc And the simplest thing you can do on such a system is just to loop indefinitely, thus creating a simple…
    comment by thyristan · 2026-08-08 · in Assembly Hall of Shame
  2. …the data format is Turing-complete not only in its instructions, but in the page table! See https://github.com/jbangert/trapcc If anything, when you build a system and it starts to get complex, you have to go out of your way to ensure it's…
  3. A variation of this has been done using Intel MMU fault handling. Behold: https://github.com/jbangert/trapcc This is a proof by construction that the Intel MMU's fault handling mechanism is Turing complete. We have constructed an assembler…
    comment by FreakLegion · 2023-10-07 · in Subtraction is functionally complete
  4. …tps://en.wikipedia.org/wiki/One-instruction_set_computer ) project or x86 MMU being turing complete ( https://github.com/jbangert/trapcc ). Both are clearly just interesting hacks (which may have some interesting implications about…
    comment by ithkuil · 2023-10-06 · in Building Processors from the Ground Up
  5. …http://www.cs.jhu.edu/~sam/ccs243-mason.pdf [3] http://www.cl.cam.ac.uk/~sd601/papers/mov.pdf [4] https://github.com/jbangert/trapcc
  6. x86 is Turing-complete with no instructions, too: https://github.com/jbangert/trapcc
  7. Someone made a NISC compiler: https://github.com/jbangert/trapcc
  8. in a similar vein, here is an exmple program that runs using only x86 CPU faults. https://github.com/jbangert/trapcc
  9. …Here you go, computation via continuous MMU faults without actually completing any instructions: https://github.com/jbangert/trapcc https://www.youtube.com/watch?v=eSRcvrVs5ug
    comment by burfog · 2019-01-24 · in Intel 80386, part 1: Introduction
  10. The page table walking hardware on x86 is pretty distinct from the main core, and is Turing complete. https://github.com/jbangert/trapcc
    comment by monocasa · 2018-11-09 · in How Many Computers Are in Your Computer?
  11. You don't even need mov. X86 MMU fault handling mechanism is Turing complete. https://github.com/jbangert/trapcc
    comment by sigjuice · 2016-12-31 · in X86 Assembly Guide
  12. And for the minimalist, the zero-instruction C compiler https://github.com/jbangert/trapcc
  13. How about computing with 0 instructions? (aka Intel MMU's fault handling is Turing complete): https://github.com/jbangert/trapcc
  14. …is actually Turing-complete without even executing a single instruction. Page faulting is enough: https://github.com/jbangert/trapcc
    comment by foobar2020 · 2015-08-07 · in Movfuscator: A single-instruction C compiler
  15. Who needs instructions? Page faults are Turing complete: https://github.com/jbangert/trapcc
  16. (author here) https://github.com/jbangert/trapcc We did get a few hypervisor crashes and the Intel architecture has all sorts of subtle behaviour that is often not modelled properly. It would be good to see someone build on my work.
  17. …setting up the page tables such that the MMU functions as a rudimentary one-instruction computer. https://github.com/jbangert/trapcc Real, asymptotically-efficient computations in CSS would require some kind of layer of indirection -- a…
  18. Forget registers; modern x86 is turing-complete without any instructions : https://github.com/jbangert/trapcc
    comment by stephencanon · 2014-02-12 · in x86 is Turing-complete with no registers
  19. …Computation without ever incrementing the program counter. Link to the code by the same guys: https://github.com/jbangert/trapcc
  20. …0 x86 instructions to run the computation. There's a video of it running available too [2]. [1] : https://github.com/jbangert/trapcc [2] : http://www.youtube.com/watch?v=eSRcvrVs5ug
    comment by testbro · 2013-09-01 · in MOV is Turing Complete [pdf]
  21. If you read through the slides @ https://github.com/jbangert/trapcc/blob/master/slides/PFLA-s... there is potential to bypass hardware memory protection. Very interesting.
    comment by phyalow · 2013-02-22 · in X86 MMU fault handling is turing complete
  22. The slides in the github repo ( https://github.com/jbangert/trapcc/blob/master/slides/PFLA-s... ) also have a few interesting points, like "No publicly available simulator implements this correctly" (how did they record the youtube video?)…