Pith. Sign in

RECORD

On the Definition of Non-deterministic Mechanisms

Logic in Computer Science · Submitted 23 Jun 2009

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim We then show that all the three mathematical concepts are equivalent to one another.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID0906.4216 (version 1)
Pith IDOTTK3TGQ, Pith's permanent record of this paper and its review
CitationVenkata Rao Kuchibhotla, Viswanath Kasturi. "On the Definition of Non-deterministic Mechanisms." arXiv:0906.4216 (2009). https://pith.science/paper/OTTK3TGQ
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,480 input tokens, $0.0001 reported.

What the abstract itself states, as probabilities: claims first 0.03 · states limitation 0.05 · human participants 0.03 · controlled comparison 0.02 · randomized assignment 0.01 · states quantitative result 0.28 · compares with prior results 0.17 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

We present here three different approaches to the problem of modeling mathematically the concept of a non-deterministic mechanism. Each of these three approaches leads to a mathematical definition. We then show that all the three mathematical concepts are equivalent to one another. This insight gives us the option of approaching the wp-formalism of Dijkstra from a different viewpoint that is easier to understand and to teach.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We present here three different approaches to the problem of modeling mathematically the concept of a non-deterministic mechanism. contribution 1.00 0.90 0.04 asserted 0.99
s1 Each of these three approaches leads to a mathematical definition. contribution 0.67 0.86 0.08 asserted 1.00
s2 We then show that all the three mathematical concepts are equivalent to one another. result 0.98 0.94 0.67 asserted 1.00
s3 This insight gives us the option of approaching the wp-formalism of Dijkstra from a different viewpoint that is easier to understand and to teach. interpretation 0.99 0.63 0.21 asserted 0.61

What kind of paper the classifier reports this is: theoretical result 0.99 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We present here three different approaches to the problem of modeling mathematically the concept of a non-deterministic mechanism. Each of these three approaches leads to a mathematical definition. We then show that all the three mathematical concepts are equivalent to one another. This insight gives us the option of approaching the wp-formalism of Dijkstra from a different viewpoint that is easier to understand and to teach.

Human review

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.