Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

LFCS
2016
Springer

favoriteEmaildiscussreport

54views Artificial Intelligence» more LFCS 2016»

Parallel Feedback Turing Computability

8 years 20 days ago

Parallel Feedback Turing Computability

Download math.fau.edu

In contrast to most kinds of computability studied in mathematical logic, feedback computability has a non-degenerate notion of parallelism. Here we study parallelism for the most basic kind of feedback, namely that of Turing computability. We investigate several diﬀerent possible deﬁnitions of parallelism in this context, with an eye toward specifying what is so computable. For the deterministic notions of parallelism identiﬁed we are successful in this analysis; for the non-deterministic notion, not completely.

Robert S. Lubarsky

Real-time Traffic

Artificial Intelligence | LFCS 2016 |

claim paper

Related Content

» Implementation of Turing Machines with the Scufl DataFlow Language

» Abstract Geometrical Computation TuringComputing Ability and Undecidability

» Turing Complete Catalytic Particle Computers

» Pipelined Decomposable BSP Computers

» Composition of Cryptographic Protocols in a Probabilistic PolynomialTime Process Calculus

» Is It Real or Is It Randomized A Financial Turing Test

» Scaled Dimension and the Kolmogorov Complexity of TuringHard Sets

» P Systems with Active Membranes Characterize PSPACE

» Feedback Output Queuing A Novel Architecture for Efficient Switching Systems

» Adaptive scheduling with parallelism feedback

Post Info
More Details (n/a)

Added	07 Apr 2016
Updated	07 Apr 2016
Type	Journal
Year	2016
Where	LFCS
Authors	Robert S. Lubarsky

Comments (0)