Questions I’m exploring
These are questions I keep coming back to. Some have become investigations. Others are things I have only started exploring.
When does incomplete evidence determine hidden structure?
Enigma indicators reveal strong algebraic constraints, but reconstruction can stop at rotor-order, twist, or spin ambiguities. I am studying which observations and exact-twist conditions turn those constraints into a verified recovery.
Can quantum advantage be proved formally?
Quantum computing feels intuitively different. I want to understand what would establish an advantage over classical computation, and what exactly such a proof would compare.
How do P, NP, and BQP relate to one another?
I know the informal definitions of these classes. I want to understand how they are related and which relationships are known.
Which kinds of problems could benefit from quantum computing?
If quantum computation offers an advantage, what features of a problem make that advantage possible, and how broadly does it apply?
What determines the power and speed of a computational model?
Which features of a model change what it can compute, and which change the resources it needs to do so?
How do I use AI without losing my own judgment?
AI can help me learn and work faster, but I still want to understand what I am doing, choose my own direction, and avoid adding more empty content to the world.