H. Boche, V. Pohl, H.V. Poor
Period Finding for Continuous Functions Cannot Be Automated on Turing Machines
IEEE Transactions on Computers
2026
Accepted
Jun

H. Boche, V. Pohl, H.V. Poor
Construction of Computable Continuous Functions with Non-computable Energy
ISIT 2026 (IEEE International Symposium on Information Theory)
IEEE
2026

H. Boche, V. Pohl, H.V. Poor
Computability theory for multidimensional signal processing
Multidimensional Signal Processing
K.V. Mishra, G.R. Arce, A.S.R. Srinivasa Rao, eds.
Elsevier/North Holland
2026

H. Boche, V. Pohl, H.V. Poor
Shannon’s sampling series has the highest possible arithmetic complexity
ICC 2026 (IEEE International Conference on Communications)
IEEE
2026

H. Boche, V. Pohl, H.V. Poor
On the Convexification of Non-Linear Optimization Problems under Performance Guarantees
CDC 2025 (Conference on Decision and Control)
IEEE
2025

H. Boche, V. Pohl, H.V. Poor
Fundamental Limits for Iterated Function Optimization on Turing Machines
ISIT 2025 (IEEE International Symposium on Information Theory)
IEEE
2025

H. Boche, V. Pohl, H.V. Poor
The Optimal Causal Linear Predictor is Not Turing Computable
111-135
Information Theory and Related Fields: Festschrift in Memory of Ning Cai
Springer Cham
2025

H. Boche, V. Pohl, H.V. Poor
Computing Orthogonal Projections Can Be Too Computational Expensive
CDC 2024 (Conference on Decision and Control)
IEEE
2024

H. Boche, V. Pohl, H.V. Poor
Characterization of the Complexity of Computing the Minimum Mean Square Error of Causal Prediction
IEEE Transactions on Information Theory
2024
70
9
Sep
6627 - 6638

H. Boche, V. Pohl, H.V. Poor
On the Complexity of Computing the Minimum Mean Square Error of Causal Prediction
ACC 2024 (American Control Conference)
2024