definition
No public endorsements yet.
Loading review…
Sign in with ORCIDConcept map
Definition
A binary language belongs to if a deterministic Turing machine decides membership in polynomial time. We reuse the definition of lax-554803 without modification: input is an ordinary binary string, output is one Boolean, and one machine and one polynomial work for all inputs.
Lean source view on GitHub
| 1 | import Lax554803.PolynomialTime |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: The complexity class P |
| 6 | type: definition |
| 7 | --- |
| 8 | A binary language belongs to if a deterministic Turing machine |
| 9 | decides membership in polynomial time. We reuse the definition of lax-554803 |
| 10 | without modification: input is an ordinary binary string, output is one |
| 11 | Boolean, and one machine and one polynomial work for all inputs. |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax434930.PolynomialTime |
| 15 | |
| 16 | /-- A finite binary string, as in lax-554803. -/ |
| 17 | abbrev Word := Lax554803.PolynomialTime.Word |
| 18 | |
| 19 | /-- A language of finite binary strings, as in lax-554803. -/ |
| 20 | abbrev Language := Lax554803.PolynomialTime.Language |
| 21 | |
| 22 | /-- Deterministic polynomial time, exactly as defined in lax-554803. -/ |
| 23 | abbrev P : Set Language := Lax554803.PolynomialTime.P |
| 24 | |
| 25 | end Lax434930.PolynomialTime |
| 26 |
Builds on
From Mathlib
none
Community review
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.
0 comments