Παρασκευή, 16 Νοεμβρίου 2012

Super-recursive algorithms

It seems that some people do not understand the connection
between hypercomputation and what Mark Burgin calls super-recursive algorithms. According to Burgin, "super-recursive algorithms are algorithms that control hypercomputation." In different words, a method that describes a task that produces a result not computable by a Turing machine is a super-recursive algorithm (or a hyperalgorithm, as I like to call them).

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

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...