Turing Completeness Debate

This cluster centers on discussions debating whether a specific programming language, system, or construct is Turing complete, including explanations of Turing completeness, its low threshold, and practical relevance.

📉 Falling 0.4x Programming Languages

5,757

Comments

Years Active

Top Authors

#1765

Topic ID

Activity Over Time

2007

2008

2009

2010

108

2011

178

2012

149

2013

195

2014

207

2015

311

2016

317

2017

373

2018

302

2019

426

2020

440

2021

480

2022

506

2023

579

2024

621

2025

411

2026

Top Contributors

vidarh (46) Dylan16807 (41) tromp (39) eru (38) kaba0 (31)

Keywords

HINT Z3 compsoc.dur LLM mov.pdf wikipedia.org xkcd.com ac.uk github.com i.e turing turing complete complete completeness turing machine machine lambda calculus lego lambda church

Sample Comments

carnaval • Jan 24, 2014 • View on HN

nothing. http://en.wikipedia.org/wiki/Turing_completeness

qqq • Jan 1, 2009 • View on HN

of course it's turing complete. the bar for that is very low.

PhasmaFelis • Jul 9, 2017 • View on HN

Is it even possible for any non-trivial programming language to not be Turing-complete?

cwmma • Apr 19, 2015 • View on HN

yeah it's basically turing complete if the turning machine is allowed to be hand cranked

jimbokun • Aug 12, 2024 • View on HN

It's true in terms of Turing Completeness.

anotheryou • Sep 16, 2017 • View on HN

It' turing complete, no? ;) (google it)

bbcbasic • May 1, 2017 • View on HN

That's a testament to Turing completeness.

tlrobinson • Oct 8, 2018 • View on HN

Alan Turing? Because it’s not Turing complete?

toroszo • Oct 23, 2019 • View on HN

It's not "computing" if it's not Turing complete

xyzzyz • Oct 1, 2011 • View on HN

What does Turing-completeness have to do with it?