New answers tagged

1 vote
Accepted

Why can't humans translate all of their abilities into an algorithm? Will that hold true in the future?

Your question contains so many sub-questions and claims, making it really hard to answer, but I will try my best, starting with debunking your claims. No, You Cannot Predict Halting! You are ...
DirkT's user avatar
  • 847
2 votes
Accepted

If Q* can break encryption would that prove P=NP?

You would have to show how being able to break AES-192 encryption would make it possible to solve some NP-complete problem. There would have to be an algorithm like this: “Given is an instance P of an ...
gnasher729's user avatar
  • 28.4k
0 votes

Trying to implement BFS and I am stuck

Every tree is also a graph. Therefore, you can use breadth-first search directly on a tree. It doesn't require recursion; you can use a queue and a loop. As soon as you encounter a node that ...
D.W.'s user avatar
  • 156k
0 votes

Trying to implement BFS and I am stuck

The pseudo code for DFS using recursion would look something like this: ...
Amirreza Hashemi's user avatar
0 votes

Objective function

A simple one: You go to a restaurant, sit down at a table, and want a nice meal. Define, as precisely as possible, leaving nothing out, what you want to achieve.
gnasher729's user avatar
  • 28.4k

Top 50 recent answers are included