Models of high-level computation
Classical models of computation are useful for understanding computability in the small; however, they fall short when it comes to analyzing large-scale, complex computations. To address this gap, theoretical computer science has witnessed the emergence of several formalisms that attempt to raise th...
Saved in:
| Main Author: | Damian Arellanes |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Frontiers Media S.A.
2025-07-01
|
| Series: | Frontiers in Computer Science |
| Subjects: | |
| Online Access: | https://www.frontiersin.org/articles/10.3389/fcomp.2025.1564048/full |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Computably Enumerable Semisimple Rings
by: Huishan Wu
Published: (2025-01-01) -
Computation of Minimal Polynomials and Multivector Inverses in Non-Degenerate Clifford Algebras
by: Dimiter Prodanov
Published: (2025-03-01) -
Compute algebra and thurston geometries
by: Nemat Abazari, et al.
Published: (2016-06-01) -
Data-intensive service deployment based on edge computing
by: Yongmei GAO, et al.
Published: (2019-07-01) -
Data-intensive service deployment based on edge computing
by: Yongmei GAO, et al.
Published: (2019-07-01)