List Question
20 TechQA 2023-04-17T06:41:27.587000Prove that the following problem is undecidable by a reduction from the halting problem:
109 views
Asked by Suleyman Kiani
Can we assure a strictly decreasing function is computable?
162 views
Asked by Pol
Why do we define equivalent turing machines as two turing machines with the same accepted languages?
411 views
Asked by Neil Zhang
Disjunctive Normal Form and satisfiable is in P (DNFSAT)
742 views
Asked by ili
Make the assumption that P = NP
73 views
Asked by AudioBubble
Equality between two propositions nat -> nat
114 views
Asked by Musher Soccoli
Inputs to Program to Illustrate Halting Problem
156 views
Asked by Robin Andrews
How to define a function with Church numerals in lambda-terms?
298 views
Asked by user3351676
How to define a coding function for all finite subsets of N?
221 views
Asked by user3351676
Proving the inexpressibility of a function in a given language
141 views
Asked by Ben
proving that a language is part of a grammar and vice versa
687 views
Asked by rem208
How do you prove whether a simple unmeaningful code is computable or not?
440 views
Asked by Lorale
What is the most concise way to generate strings of language anbncn using JavaScript without using loops?
104 views
Asked by Benjamin Paige
Turing machines and decidability
489 views
Asked by jbushi
Multiple questions related to Actor-based model
32 views
Asked by Francisco Javier
Automata and Computability
40 views
Asked by jimmyb
Determining a program's execution time by its length in bits?
76 views
Asked by AudioBubble
Can a grammar ever be parsed by LL(1) but not with LR(1)?
958 views
Asked by Ryan Foster
Something is not computable, can it be co-recursively enumerable?
381 views
Asked by sharprabbitz