CoChat

Quantum mechanical Hamiltonian models of discrete processes that erase their own histories: Application to Turing machines

Benioff, Paul A. · 1982 · International Journal of Theoretical Physics

The DOI matches its Crossref record; 19 of the 20 references it cites were found in a registry or an index.

Overview

Integrity signals

Registry

Crossref · 10.1007/bf01857725

Cites

19 of 19 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 19 references

Research works printed but not linked: 2

  1. Bell, J. S. (1975).Helvetica Physica Acta,48, 93.
  2. Hepp, K. (1972).Helvetica Physica Acta,45, 237.

Cited by

Metadata

Authors
Benioff, P. A.
Affiliations
Argonne National Laboratory (US)
Corresponding author
Benioff, Paul A.
Venue
International Journal of Theoretical Physics
Published
1982-04
Volume
21
Issue
3-4
Pages
177-201
ISSN
  • 0020-7748 (ISSN-L)
  • 1572-9575
OpenAlex
W2065184494
Cited by
113
References
20
Citations by year
2026: 1 · 2025: 2 · 2024: 4 · 2023: 6 · 2022: 1 · 2021: 1 · 2020: 4 · 2019: 1 · 2018: 1 · 2017: 1 · 2016: 2 · 2015: 3 · 2014: 5 · 2013: 4 · 2012: 4
FWCI
8.02
Type
journal article
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
International Journal of Theoretical Physics (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
Turing machines, discrete processes, fixed points, ballast system, quantum computing

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.