Does the halting problem in directed acyclic graphs remain NP-hard?

If I remove infinite loops, indirect self-referential loops, and recursion in a program written in a Turing-complete programming language, will the algorithm implicitly define a directed acyclic...

04 April 2018 4,635 2 View