Name
Abstract | ||
|---|---|---|
Theoretical computer science has offered various computation models like automata, Turing machine, lambda calculus, and their
importance to theoretical work and to practice is widely recognized. The progress of the classical topics of formal language
theory, computational complexity, and mathematical semantics of programming languages is due to these computation models.
In this talk we propose two challenges that have tight connection to mathematical theory of programs and probably need new
computation models to attack them.
|
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/3-540-44929-9_46 | IFIP TCS |
Keywords | DocType | ISBN |
compuational models | Conference | 3-540-67823-9 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoshihito Toyama | 1 | 533 | 49.60 |