scientific article

zbMath0665.68042MaRDI QIDQ3816984

Jia-Wei Hong

Publication date: 1986

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

finite automatarecursive functionscomputational modelsrandom access machinesparallel computationalvector machinescomputational complexitiesmultitape Turing machinesduality between parallel time and spaceTuring-Church's thesis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

Adaptive logspace reducibility and parallel time, Cyclic Boolean circuits, A constant-space sequential model of computation for first-order logic, A constant-space sequential model of computation for first-order logic