Anytime Algorithms for Non-Ending Computations (Q2947801): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Strong noncomputability of random strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Most programs stop quickly or never halt / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Natural halting probabilities, partial randomness, and zeta functions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The halting problem is decidable on a set of asymptotic probability one / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Renormalisation and computation II: time cut-off and the Halting Problem / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129054115500252 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2237358699 / rank | |||
Normal rank | |||
Latest revision as of 10:50, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Anytime Algorithms for Non-Ending Computations |
scientific article |
Statements
Anytime Algorithms for Non-Ending Computations (English)
0 references
29 September 2015
0 references
anytime algorithm
0 references
algorithmically compressible number
0 references
halting problem
0 references
density
0 references
