Member Avatar

Anything a person desires?

Recommended Answers

Actually, no. There are definite limits to computability. Look up Alan Turing and the Halting Problem

Jump to Post

All 2 Replies

Only if it is within the specifications of the language.

Actually, no. There are definite limits to computability. Look up Alan Turing and the Halting Problem for one well-known example of an undecidable proposition.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of 1.21 million developers, IT pros, digital marketers, and technology enthusiasts learning and sharing knowledge.