MuPAD codes which implement limit-computable functions that cannot be bounded by any computable function
Saved in:
| Main Author: | Apoloniusz Tyszka |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Information Processing Society
2014-09-01
|
| Series: | Annals of computer science and information systems |
| Online Access: | https://annals-csis.org/Volume_2/pliks/91.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A hypothetical way to compute an upper bound for the heights
of solutions of a Diophantine equation with a finite number of solutions
by: Apoloniusz Tyszka
Published: (2015-10-01) -
The Computability of the Channel Reliability Function and Related Bounds
by: Holger Boche, et al.
Published: (2025-06-01) -
The Hadamard gate cannot be replaced by a resource state in universal quantum computation
by: Benjamin D. M. Jones, et al.
Published: (2024-09-01) -
Automatic code optimization for computing the McCaskill partition functions
by: Wlodzimierz Bielecki, et al.
Published: (2022-09-01) -
Parallel cache-efficient code for computing the McCaskill partition functions
by: Marek Pałkowski, et al.
Published: (2019-09-01)