Home › Entities › academia › A probabilistic anytime algorithm for the halting problem

A probabilistic anytime algorithm for the halting problem

Research article (Computability, 2017) · cited 10× · AI/ML
CreativeWork academia

Facts

4 properties
Instance of
scholarly article[2]
Publication date
May 16, 2017as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Published in
Computabilityas of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
Title
A probabilistic anytime algorithm for the halting problemas of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
🔖 Identifiers · 2
OpenAlex ID
W2614456850as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded
DOI
10.3233/COM-170073as of 2026-09-23
where from?
Source
OpenAlex
Edition
20260923 · as of 2026-09-23
Bronze
not in the catalog
Transform
4ort-mint · openalex:20260923 · version not recorded

Report an error or request removal Lineage (PROV-JSON)

📜 Data licence
Source: OpenAlex (openalex.org), snapshot of 2026-09-23. CC0 1.0 Universal. CC0 1.0 Universal · OpenAlex
🔗 Connections
Authored by 2
Cristian Calude, Monica Dumitrescu
← Author of 2
Cristian Calude, Monica Dumitrescu
Press Enter · cited answer in seconds

Summary

A probabilistic anytime algorithm for the halting problem is a scholarly article[1].

Related Entities

Cristian Calude

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). A probabilistic anytime algorithm for the halting problem. Retrieved October 17, 2026, from https://4ort.xyz/entity/a-probabilistic-anytime-algorithm-for-the-halting-problem
MLA “A probabilistic anytime algorithm for the halting problem.” 4ort.xyz Knowledge Graph, 4ort.xyz, 17 Oct. 2026, https://4ort.xyz/entity/a-probabilistic-anytime-algorithm-for-the-halting-problem.
BibTeX @misc{4ortxyz_a-probabilistic-anytime-algorithm-for-the-halting-problem_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{A probabilistic anytime algorithm for the halting problem}}, year = {2026}, url = {https://4ort.xyz/entity/a-probabilistic-anytime-algorithm-for-the-halting-problem}, note = {Accessed: 2026-10-17}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): A probabilistic anytime algorithm for the halting problem — https://4ort.xyz/entity/a-probabilistic-anytime-algorithm-for-the-halting-problem (retrieved 2026-10-17)

Canonical URL: https://4ort.xyz/entity/a-probabilistic-anytime-algorithm-for-the-halting-problem · Last refreshed: