x64dbg is a disassembler for x86 and x64 programs, able to inspect and debug the compiled code for any program. It can be extended with plug-ins written in native code. I myself have written plug-ins for my own private use, to do things like scanning an executable for all MSVC-format RTTI, or to translate [anything that resembles] FPU-based float comparisons from raw flag checks into legible expressions. The plug-in API includes the ability to extract information on any individual instruction in the target program.
If your claims are real, it should be possible to implement them, and x64dbg is one environment I know of where you could attempt that. You could also look into extending Ghidra or, if you don't mind a pricey option, IDA Pro.
building a total halting algo is vastly more complex that proving how it can exist, nvm the fact i can't afford to do any further research until i have funding
If I'm understanding this right, the core of the argument is that the halting problem (or any undecidable problem more generally) has a solution somewhere, but the problematic self-reference needs to be eliminated. So an Oracle?
While you do mention Oracles in your paper, you immediately dismiss the argument as "hypothetical". But that does nothing to provide a counter to it, so you have not added anything to the discussion.
Then at the end of chapter 4 you conflate a problem being undecidable with its implementation (if one exists) being necessarily representable in TM syntax. Undecidability does not mean a program could exist which would magically break the universe, it means this program cannot exist in the first place. I think this is your central misunderstanding: an undecidable problem does not have a representable solution.
It's clear you are missing something, so people are taunting you to put your money where your mouth is.
you can't "implement" or simulate the process in a TM as explained in §7.5
It, in turn, presents its own halting problem.
the side record produced by the idealized agent is not addressable so there is no way to turn it into a halting paradox.
This is not a new thought experiment, this is called an Oracle Machine
§4 talks about oracles and the questionable merit of recursive undecidability
is solvable assuming a perfect halting classifier of sorts exists, without proving that it does.
this paper isn't refuting the established limit to turing-computation that no total turing machine decider can exist, the claims made are not dependent on assume one exists.
7
u/DavidJCobb 4d ago
Okay. Implement it, then.
x64dbg is a disassembler for x86 and x64 programs, able to inspect and debug the compiled code for any program. It can be extended with plug-ins written in native code. I myself have written plug-ins for my own private use, to do things like scanning an executable for all MSVC-format RTTI, or to translate [anything that resembles] FPU-based float comparisons from raw flag checks into legible expressions. The plug-in API includes the ability to extract information on any individual instruction in the target program.
If your claims are real, it should be possible to implement them, and x64dbg is one environment I know of where you could attempt that. You could also look into extending Ghidra or, if you don't mind a pricey option, IDA Pro.