Network profile

Ayrat

Reputation

956

956
729
503

2018
2019
2020
2021

Next privilege

1,000 Rep.

See votes

Badges

1

6

21

Newest

Yearling

Next badge

15/30

Impact

2 posts edited

0 helpful flags

33 votes cast

17 Questions

Votes Activity Newest Views

10

17

votes

1

answer

17k

views

Memory Consistency vs Cache Coherence

computer-architecture cpu-cache shared-memory

Feb 14 '15 at 20:25 Wandering Logic 16.4k

1

10

votes

1

answer

779

views

Algorithm to translate a deterministic Büchi automaton to LTL (when possible)

logic automata linear-temporal-logic buchi-automata

Jul 14 '12 at 13:05 Gilles 'SO- stop being evil' 39.8k

5

8

votes

3

answers

2k

views

What is the relation between First Order Logic and First Order Theory?

logic first-order-logic

Apr 26 '16 at 20:10 Andrej Bauer 26.1k

2

6

votes

1

answer

544

views

Exponential example for simplex used in SMT solvers

linear-programming smt-solvers

Oct 21 '17 at 15:38 Rodrigo de Azevedo 814

2

5

votes

3

answers

788

views

Intuitive explanation of Hoare assignment axiom

hoare-logic

Nov 22 '16 at 10:42 Ayrat 956

3

4

votes

3

answers

2k

views

Show a TM-recognizable language of TMs can be expressed by TM-description language of equivalent TMs

turing-machines computability decision-problem

Sep 21 at 18:23 xdavidliu 620

4

votes

3

answers

319

views

Metagame Paradox: what is wrong with this explanation?

computability turing-machines game-theory

Jun 16 '19 at 12:57 Mike Rosoft 121

4

votes

1

answer

79

views

Is model checking PSpace-hard in formula size?

complexity-theory model-checking linear-temporal-logic parameterized-complexity

Apr 10 '19 at 15:38 DCTLib 2,627

2

3

votes

3

answers

135

views

Linear Temporal Logic with non-Boolean propositions (e.g. Integers)?

reference-request logic linear-temporal-logic

Jan 30 '19 at 7:50 Ayrat 956

2

votes

1

answer

32

views

Why is the satisfiability of ESO formulas not equal to the satisfiability of FO formulas?

first-order-logic higher-order-logic

Mar 12 at 13:11 Noah Schweber 2,027

2

votes

1

answer

180

views

Is complexity class $\Sigma^1_1$ from polynomial hierarchy decidable?

complexity-theory complexity-classes

Apr 2 '18 at 20:43 Ariel 11.9k

2

votes

1

answer

190

views

Are there any LTL to _non_ deterministic Rabin automaton translators?

automata reference-request simulation linear-temporal-logic

Apr 11 '17 at 20:53 Community♦ 1

2

votes

1

answer

35

views

Can Nondet Rabin Tree automaton be determinized?

reference-request nondeterminism tree-automata

Mar 28 '17 at 13:00 David Richerby 78.5k

1

vote

1

answer

58

views

How were weights chosen in Runge-Kutta (4) method?

numerical-algorithms

Mar 29 at 22:33 Pseudonym 14k

1

vote

1

answer

65

views

Poly-time reductions for proving EXPTIME-hardness are _not_ enough?

complexity-theory time-complexity reductions

Jan 29 '19 at 18:46 David Richerby 78.5k

1

vote

2

answers

49

views

NP-hardness does not imply lower bound, strictly speaking?

complexity-theory reductions np-hard complexity-classes

Jan 19 '19 at 17:07 Discrete lizard♦ 6,444

2

1

vote

3

answers

1k

views

Why every finite set is computable?

computability turing-machines

Jul 12 '13 at 5:55 Community♦ 1

Computer Science Stack Exchange works best with JavaScript enabled