I know I can't do this with my little hashpower but I'm just interested in understanding the theory behind this.
Thanks.
You don't really need any hashing power to attempt double spending. You just need to create two different transactions that both spend a particular tx output, and you broadcast both the two transactions to the network. Eventually one will get confirmed, and one will never get confirmed.
But if you are talking about reverting a confirmed transaction and replacing it with another one, it will be a different story.
There exist tools (such as the one here, although it's not intended for newbies: https://github.com/petertodd/replace-by-fee-tools) that will create double-spend transactions which may work some of the time. By "work", I only mean that it can "fool" recipients who choose not to wait for confirmations.
(FYI many people don't consider the term "double-spend" to ever apply to 0-conf transactions...)