You are on the new improved site. You can view the old site in view-only mode here until June 27, 2026

Filter Results

Search all journals

Enter search terms…

Advanced search

/

About

About Sage
About Sage Journals
Privacy Policy
Terms of Use
Contact Us
Help

Information for

Authors
Editors
Librarians
Researchers
Reviewers
Frequently asked questions

Copyright © 2026 by Sage Publications.京ICP备09090397号-11

Search results

Search results page

Articles (107)

Journals (0)

1-10 of 107 results for halting problem

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: A probabilistic anytime algorithm for the halting problem

Retricted access

Research article

First published 2018-6-7

A probabilistic anytime algorithm for the halting problem

Cristian S. Calude, Monica Dumitrescu

Computability

Select article: A statistical anytime algorithm for the Halting Problem

Retricted access

Research article

First published 2020-5-13

A statistical anytime algorithm for the Halting Problem

Cristian S. Calude, Monica Dumitrescu

Computability

Select article: Solvability of the Halting and Reachability Problem for Binary 2-tag Systems

Retricted access

Research article

First published 2010-5

Solvability of the Halting and Reachability Problem for Binary 2-tag Systems

Liesbeth De Mol

Fundamenta Informaticae

Select article: The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian

Retricted access

Research article

First published 2021-4-16

The halting problem and security’s language-theoretic approach: Praise and criticism from a technical historian

Edgar G. Daylight

Computability

Select article: An Algebraic Characterization of the Halting Probability

Retricted access

Research article

First published 2007-9

An Algebraic Characterization of the Halting Probability

Gregory Chaitin

Fundamenta Informaticae

Select article: Another Example of Higher Order Randomness

Retricted access

Research article

First published 2002-8

Another Example of Higher Order Randomness

Verónica Becher, Gregory Chaitin

Fundamenta Informaticae

Select article: Universality and Almost Decidability

Retricted access

Research article

First published 2015-6

Universality and Almost Decidability

Cristian S. Calude, Damien Desfontaines

Fundamenta Informaticae

Select article: Termination of Graph Rewriting is Undecidable

Retricted access

Research article

First published 1998-2

Termination of Graph Rewriting is Undecidable

Detlef Plump

Fundamenta Informaticae

Select article: Effectivity problems of algorithmic logic

Retricted access

Research article

First published 1977

Effectivity problems of algorithmic logic

Antoni Kreczmar

Fundamenta Informaticae

Select article: Building Problem Forums

Retricted access

Research article

First published 2016-6

Building Problem Forums

Kyle P. Vealey

Business and Professional Communication Quarterly

1
2
3
•••
11
10 / page

Article type

Publication date

Subjects

Access