Benjamin G. Rin

According to our database1, Benjamin G. Rin authored at least 9 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Arimaa Is PSPACE-Hard.
Proceedings of the 12th International Conference on Fun with Algorithms, 2024

Hamiltonian Paths and Cycles in NP-Complete Puzzles.
Proceedings of the 12th International Conference on Fun with Algorithms, 2024

2020
Reachability for infinite time Turing machines with long tapes.
Log. Methods Comput. Sci., 2020

2018
Writability and reachability for alpha-tape infinite time Turing machines.
CoRR, 2018

2017
Koepke Machines and Satisfiability for Infinitary Propositional Languages.
Proceedings of the Unveiling Dynamics and Complexity, 2017

2016
Realizability Semantics for Quantified Modal Logic: Generalizing Flagg's 1985 Construction.
Rev. Symb. Log., 2016

2015
Transfinite recursion and computation in the iterative conception of set.
Synth., 2015

2014
The computational strengths of α-tape infinite time Turing machines.
Ann. Pure Appl. Log., 2014

2013
Actuality in Propositional Modal Logic.
Stud Logica, 2013


  Loading...