Skip to main navigation
Skip to search
Skip to main content

University of Bristol Home

Help & Terms of Use

Home
Profiles
Research units
Research Outputs
Projects
Student theses
Datasets
Activities
Prizes
Facilities/Equipment

Search by expertise, name or affiliation

Non-deterministic halting times for Hamkins-Kidder turing machines

School of Mathematics
Pure Mathematics
Set Theory and Logic

Research output: Contribution to journal › Article (Academic Journal) › peer-review

Overview
Fingerprint

Fingerprint

Dive into the research topics of 'Non-deterministic halting times for Hamkins-Kidder turing machines'. Together they form a unique fingerprint.

Sort by
Weight
Alphabetically

Mathematics

Engineering

Computer Science

Powered by Pure, Scopus & Elsevier Fingerprint Engine™

All content on this site: Copyright © 2024 Elsevier B.V. or its licensors and contributors. All rights are reserved, including those for text and data mining, AI training, and similar technologies. For all open access content, the Creative Commons licensing terms apply

We use cookies to help provide and enhance our service and tailor content. By continuing you agree to the use of cookies

University of Bristol data protection policy

About web accessibility

Report vulnerability