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 (35)

Journals (0)

1-10 of 35 results for Computational Undecidability

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: On the Undecidability of Attractor Properties for Cellular Automata

Retricted access

Research article

First published 2012-4

On the Undecidability of Attractor Properties for Cellular Automata

Pietro Di Lena, Luciano Margara

Fundamenta Informaticae

Select article: The Effects of a Career Planning Course and a Computer-Assisted Career Guidance Program (SIGI PLUS) on Undecided University Students

Retricted access

Research article

First published 1990-3

The Effects of a Career Planning Course and a Computer-Assisted Career Guidance Program (SIGI PLUS) on Undecided University Students

Spencer Niles, Jeffrey W. Garis

Journal of Career Development

Select article: Computable Contact Algebras

Retricted access

Research article

First published 2019

Computable Contact Algebras

Nikolay Bazhenov

Fundamenta Informaticae

Select article: On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus

Retricted access

Research article

First published 2022

On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus

Eugene Eberbach

Fundamenta Informaticae

Select article: Logical Undecidabilities Made Easy

Retricted access

Research article

First published 2008-12

Logical Undecidabilities Made Easy

Daniel Leivant

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: Almost Periodic Configurations on Linear Cellular Automata

Retricted access

Research article

First published 2003-11

Almost Periodic Configurations on Linear Cellular Automata

Klaus Sutner

Fundamenta Informaticae

Select article: Decidability and Universality in Symbolic Dynamical Systems

Retricted access

Research article

First published 2006-12

Decidability and Universality in Symbolic Dynamical Systems

Jean-Charles Delvenne, Petr Kůrka, Vincent Blondel

Fundamenta Informaticae

Select article: Cellular Automata,Decidability and Phasespace

Retricted access

Research article

First published 2010-9

Cellular Automata,Decidability and Phasespace

K. Sutner

Fundamenta Informaticae

Select article: Reflexivity,Recursion and Social Life: Elements for a Postmodern Sociology

Retricted access

Research article

First published 1989-11

Reflexivity,Recursion and Social Life: Elements for a Postmodern Sociology

Robert Platt

The Sociological Review

1
2
3
4
10 / page

Article type

Publication date

Subjects

Access