Σάββατο, 19 Ιανουαρίου 2013

Non-Universality in Computation

Selim Akl has convincingly argued that there is no universal computer. This may come to a surprise to people since one of the first things we learn when studying computability theory is the notion of the universal Turing machine. But then again, we learn that there is a thesis that dictates what and what cannot be computed!

Δεν υπάρχουν σχόλια:

A "Solution" to Riemann Hypothesis

Riemann hypothesi s is "is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex n...